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/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:49,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:49,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:49,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:49,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:49,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:49,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:49,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:49,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:49,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:49,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:49,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:49,304 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:49,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:49,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:49,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:49,308 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:49,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:49,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:49,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:49,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:49,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:49,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:49,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:49,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:49,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:49,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:49,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:49,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:49,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:49,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:49,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:49,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:49,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:49,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:49,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:49,332 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:55:49,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:49,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:49,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:49,355 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:49,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:49,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:49,356 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:49,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:49,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:49,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:49,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:49,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:49,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:49,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:49,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:49,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:49,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:49,358 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:49,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:49,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:49,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:49,361 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:49,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:49,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:49,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:49,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:49,362 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:49,362 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:49,362 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:49,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:49,363 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:49,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:49,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:49,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:49,448 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:49,448 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:49,449 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i [2018-11-23 12:55:49,529 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec3805f1/3f4148c70ae141f4a54954ba6fa93ec5/FLAG8a9404b4f [2018-11-23 12:55:49,993 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:49,994 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i [2018-11-23 12:55:50,010 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec3805f1/3f4148c70ae141f4a54954ba6fa93ec5/FLAG8a9404b4f [2018-11-23 12:55:50,303 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec3805f1/3f4148c70ae141f4a54954ba6fa93ec5 [2018-11-23 12:55:50,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:50,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:50,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:50,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:50,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:50,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a25c626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50, skipping insertion in model container [2018-11-23 12:55:50,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:50,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:50,812 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:50,824 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:50,912 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:50,978 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:50,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50 WrapperNode [2018-11-23 12:55:50,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:50,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:50,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:50,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:50,991 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:55:50" (1/1) ... [2018-11-23 12:55:51,019 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:55:50" (1/1) ... [2018-11-23 12:55:51,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:51,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:51,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:51,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:51,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:51,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:51,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:51,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:51,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:51,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:51,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:51,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:51,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:51,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:51,179 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:51,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (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:55:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:55:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:55:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:52,206 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:52,206 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:55:52,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:52 BoogieIcfgContainer [2018-11-23 12:55:52,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:52,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:52,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:52,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:52,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:50" (1/3) ... [2018-11-23 12:55:52,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558a5f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:52, skipping insertion in model container [2018-11-23 12:55:52,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (2/3) ... [2018-11-23 12:55:52,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558a5f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:52, skipping insertion in model container [2018-11-23 12:55:52,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:52" (3/3) ... [2018-11-23 12:55:52,215 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag_false-unreach-call_false-valid-deref.i [2018-11-23 12:55:52,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:52,234 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:55:52,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:55:52,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:52,288 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:52,288 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:52,288 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:52,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:52,289 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:52,289 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:52,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:52,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 12:55:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:55:52,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:52,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:52,319 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:52,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash -955243339, now seen corresponding path program 1 times [2018-11-23 12:55:52,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:52,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:52,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:52,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:52,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 12:55:52,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-23 12:55:52,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:55:52,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #108#return; {40#true} is VALID [2018-11-23 12:55:52,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2018-11-23 12:55:52,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {40#true} is VALID [2018-11-23 12:55:52,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {40#true} is VALID [2018-11-23 12:55:52,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {40#true} is VALID [2018-11-23 12:55:52,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 12:55:52,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {41#false} is VALID [2018-11-23 12:55:52,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:55:52,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); {41#false} is VALID [2018-11-23 12:55:52,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} assume 3 != #t~mem14 || ~i~0 > 20;havoc #t~mem14; {41#false} is VALID [2018-11-23 12:55:52,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 12:55:52,528 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:55:52,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:52,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:52,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:55:52,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:52,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:52,610 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:55:52,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:52,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:52,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:52,623 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 12:55:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:53,020 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2018-11-23 12:55:53,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:53,020 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:55:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:55:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:55:53,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 12:55:53,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:53,324 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:55:53,324 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:55:53,328 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:55:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:55:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:55:53,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:53,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:55:53,369 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:55:53,369 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:55:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:53,373 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-23 12:55:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-11-23 12:55:53,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:53,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:53,375 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:55:53,375 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:55:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:53,379 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-23 12:55:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-11-23 12:55:53,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:53,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:53,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:53,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:55:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-23 12:55:53,385 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2018-11-23 12:55:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:53,386 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 12:55:53,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-11-23 12:55:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:55:53,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:53,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:53,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:53,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2010842698, now seen corresponding path program 1 times [2018-11-23 12:55:53,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:53,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:53,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:53,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:54,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2018-11-23 12:55:54,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {199#true} is VALID [2018-11-23 12:55:54,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {199#true} assume true; {199#true} is VALID [2018-11-23 12:55:54,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} #108#return; {199#true} is VALID [2018-11-23 12:55:54,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {199#true} call #t~ret17 := main(); {199#true} is VALID [2018-11-23 12:55:54,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {199#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {199#true} is VALID [2018-11-23 12:55:54,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {199#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {199#true} is VALID [2018-11-23 12:55:54,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {199#true} is VALID [2018-11-23 12:55:54,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {199#true} #t~short2 := ~i~0 < 20; {201#(or (not |main_#t~short2|) (<= main_~i~0 19))} is VALID [2018-11-23 12:55:54,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {201#(or (not |main_#t~short2|) (<= main_~i~0 19))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {202#(<= main_~i~0 19)} is VALID [2018-11-23 12:55:54,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {202#(<= main_~i~0 19)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {202#(<= main_~i~0 19)} is VALID [2018-11-23 12:55:54,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {202#(<= main_~i~0 19)} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {202#(<= main_~i~0 19)} is VALID [2018-11-23 12:55:54,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {202#(<= main_~i~0 19)} call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4); {203#(and (<= main_~i~0 19) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem8|))} is VALID [2018-11-23 12:55:54,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {203#(and (<= main_~i~0 19) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem8|))} assume !(3 != #t~mem8);havoc #t~mem8; {204#(and (<= main_~i~0 19) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:55:54,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {204#(and (<= main_~i~0 19) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); {205#(and (= 3 |main_#t~mem14|) (<= main_~i~0 19))} is VALID [2018-11-23 12:55:54,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {205#(and (= 3 |main_#t~mem14|) (<= main_~i~0 19))} assume 3 != #t~mem14 || ~i~0 > 20;havoc #t~mem14; {200#false} is VALID [2018-11-23 12:55:54,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {200#false} assume !false; {200#false} is VALID [2018-11-23 12:55:54,147 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:55:54,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:54,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:55:54,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 12:55:54,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:54,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:55:54,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:54,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:55:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:55:54,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:54,199 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 7 states. [2018-11-23 12:55:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,545 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 12:55:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:55:54,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 12:55:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:55:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:55:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:55:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:55:54,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-23 12:55:54,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:54,659 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:55:54,659 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:55:54,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:55:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:55:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-11-23 12:55:54,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:54,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2018-11-23 12:55:54,679 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2018-11-23 12:55:54,680 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2018-11-23 12:55:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,683 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-11-23 12:55:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 12:55:54,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:54,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:54,685 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2018-11-23 12:55:54,686 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2018-11-23 12:55:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,692 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-11-23 12:55:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 12:55:54,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:54,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:54,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:54,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:55:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:55:54,696 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2018-11-23 12:55:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:54,696 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:55:54,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:55:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:55:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:55:54,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:54,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:54,698 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:54,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:54,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2010884424, now seen corresponding path program 1 times [2018-11-23 12:55:54,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:54,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:54,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:54,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:54,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:54,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {380#true} call ULTIMATE.init(); {380#true} is VALID [2018-11-23 12:55:54,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {380#true} is VALID [2018-11-23 12:55:54,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {380#true} assume true; {380#true} is VALID [2018-11-23 12:55:54,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {380#true} {380#true} #108#return; {380#true} is VALID [2018-11-23 12:55:54,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {380#true} call #t~ret17 := main(); {380#true} is VALID [2018-11-23 12:55:54,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {380#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {380#true} is VALID [2018-11-23 12:55:54,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {380#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {380#true} is VALID [2018-11-23 12:55:54,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:54,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} #t~short2 := ~i~0 < 20; {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:54,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:54,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:54,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {382#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {383#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:54,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {383#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4); {384#(= |main_#t~mem8| 3)} is VALID [2018-11-23 12:55:54,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {384#(= |main_#t~mem8| 3)} assume !!(3 != #t~mem8);havoc #t~mem8;call #t~mem9 := read~int(~p~0.base, 4 + ~p~0.offset, 4); {381#false} is VALID [2018-11-23 12:55:54,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {381#false} assume 0 != #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {381#false} is VALID [2018-11-23 12:55:54,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {381#false} assume 1 != #t~mem10;havoc #t~mem10; {381#false} is VALID [2018-11-23 12:55:54,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {381#false} assume !false; {381#false} is VALID [2018-11-23 12:55:54,891 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:55:54,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:54,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:54,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:55:54,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:54,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:54,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:54,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:54,937 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 5 states. [2018-11-23 12:55:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,333 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2018-11-23 12:55:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:55:55,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:55:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2018-11-23 12:55:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2018-11-23 12:55:55,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2018-11-23 12:55:55,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:55,486 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:55:55,486 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:55:55,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:55:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-11-23 12:55:55,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:55,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 33 states. [2018-11-23 12:55:55,499 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 33 states. [2018-11-23 12:55:55,499 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 33 states. [2018-11-23 12:55:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,503 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 12:55:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 12:55:55,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:55,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:55,504 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 47 states. [2018-11-23 12:55:55,505 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 47 states. [2018-11-23 12:55:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,508 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 12:55:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 12:55:55,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:55,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:55,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:55,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:55:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-23 12:55:55,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2018-11-23 12:55:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:55,512 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-23 12:55:55,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-23 12:55:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:55:55,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:55,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:55,514 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:55,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1793847427, now seen corresponding path program 1 times [2018-11-23 12:55:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:55,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {601#true} is VALID [2018-11-23 12:55:55,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {601#true} is VALID [2018-11-23 12:55:55,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-23 12:55:55,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #108#return; {601#true} is VALID [2018-11-23 12:55:55,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret17 := main(); {601#true} is VALID [2018-11-23 12:55:55,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {601#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {603#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:55:55,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {603#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {603#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:55:55,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {603#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:55,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} #t~short2 := ~i~0 < 20; {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:55,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:55,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;#t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~p~0.base, 4 + ~p~0.offset, 4);havoc #t~nondet4;call #t~mem5 := read~int(~p~0.base, 4 + ~p~0.offset, 4); {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:55,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume 0 != #t~mem5;havoc #t~mem5;call write~int(1, ~p~0.base, ~p~0.offset, 4); {605#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:55,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {605#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~t~0.base, ~t~0.offset := #t~malloc6.base, #t~malloc6.offset; {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:55,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:55,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 8 + ~p~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 8 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:55,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} #t~short2 := ~i~0 < 20; {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:55,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:55,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:55,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {607#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {608#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:55,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {608#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4); {608#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:55,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {608#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(3 != #t~mem8);havoc #t~mem8;call #t~mem9 := read~int(~p~0.base, 4 + ~p~0.offset, 4); {608#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:55,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {608#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {609#(= 1 |main_#t~mem10|)} is VALID [2018-11-23 12:55:55,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {609#(= 1 |main_#t~mem10|)} assume 1 != #t~mem10;havoc #t~mem10; {602#false} is VALID [2018-11-23 12:55:55,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {602#false} assume !false; {602#false} is VALID [2018-11-23 12:55:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:55,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:55:55,876 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:55:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:55,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:55:56,021 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 6 treesize of output 5 [2018-11-23 12:55:56,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:55:56,045 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:56,045 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (= |#valid| (store |v_#valid_15| main_~a~0.base 1)) [2018-11-23 12:55:56,045 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:55:56,158 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 11 treesize of output 8 [2018-11-23 12:55:56,166 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 8 treesize of output 7 [2018-11-23 12:55:56,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:55:56,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:56,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:56,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:55:56,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-23 12:55:56,352 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:56,352 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_16|]. (and (= 1 (select |v_#valid_16| main_~p~0.base)) (= 0 (select |v_#valid_16| main_~t~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:55:56,353 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:55:56,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:55:56,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:56,413 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 22 treesize of output 14 [2018-11-23 12:55:56,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:55:56,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 12:55:56,673 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 8 treesize of output 7 [2018-11-23 12:55:56,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,694 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:55:56,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:55:56,698 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:56,698 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, v_main_~p~0.base_23, v_main_~p~0.offset_23]. (and (= (store |v_#memory_int_20| v_main_~p~0.base_23 (store (select |v_#memory_int_20| v_main_~p~0.base_23) v_main_~p~0.offset_23 3)) |#memory_int|) (= 1 (select (select |v_#memory_int_20| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_23 main_~p~0.base))) [2018-11-23 12:55:56,699 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_23, v_main_~p~0.offset_23]. (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_23 main_~p~0.base))) [2018-11-23 12:55:56,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 12:55:56,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 12:55:56,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 12:55:56,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,927 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:55:56,930 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:56,931 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_23, v_main_~p~0.offset_23]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (= |main_#t~mem10| .cse0) (= 1 .cse0) (not (= v_main_~p~0.base_23 main_~p~0.base)))) [2018-11-23 12:55:56,931 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem10| 1) [2018-11-23 12:55:56,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {601#true} is VALID [2018-11-23 12:55:56,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {601#true} is VALID [2018-11-23 12:55:56,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-23 12:55:56,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #108#return; {601#true} is VALID [2018-11-23 12:55:56,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret17 := main(); {601#true} is VALID [2018-11-23 12:55:56,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {601#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {603#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:55:56,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {603#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {603#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:55:56,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {603#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} #t~short2 := ~i~0 < 20; {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;#t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~p~0.base, 4 + ~p~0.offset, 4);havoc #t~nondet4;call #t~mem5 := read~int(~p~0.base, 4 + ~p~0.offset, 4); {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume 0 != #t~mem5;havoc #t~mem5;call write~int(1, ~p~0.base, ~p~0.offset, 4); {605#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {605#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~t~0.base, ~t~0.offset := #t~malloc6.base, #t~malloc6.offset; {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 8 + ~p~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 8 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:55:56,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} #t~short2 := ~i~0 < 20; {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:55:56,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:55:56,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:55:56,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {655#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {668#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:55:56,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {668#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem8 := read~int(~p~0.base, ~p~0.offset, 4); {668#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:55:56,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {668#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(3 != #t~mem8);havoc #t~mem8;call #t~mem9 := read~int(~p~0.base, 4 + ~p~0.offset, 4); {668#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:55:56,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {668#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume 0 != #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); {609#(= 1 |main_#t~mem10|)} is VALID [2018-11-23 12:55:56,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {609#(= 1 |main_#t~mem10|)} assume 1 != #t~mem10;havoc #t~mem10; {602#false} is VALID [2018-11-23 12:55:56,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {602#false} assume !false; {602#false} is VALID [2018-11-23 12:55:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:57,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:55:57,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-23 12:55:57,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 12:55:57,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:57,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:55:57,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:57,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:55:57,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:55:57,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:55:57,062 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 11 states. [2018-11-23 12:55:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,466 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2018-11-23 12:55:58,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:55:58,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 12:55:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:55:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 12:55:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:55:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 12:55:58,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-23 12:55:58,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,698 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:55:58,698 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:55:58,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:55:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:55:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2018-11-23 12:55:58,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:58,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 49 states. [2018-11-23 12:55:58,761 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 49 states. [2018-11-23 12:55:58,761 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 49 states. [2018-11-23 12:55:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,766 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-11-23 12:55:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2018-11-23 12:55:58,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,768 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 78 states. [2018-11-23 12:55:58,768 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 78 states. [2018-11-23 12:55:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,772 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-11-23 12:55:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2018-11-23 12:55:58,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:58,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:55:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 12:55:58,777 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 24 [2018-11-23 12:55:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:58,777 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 12:55:58,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:55:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 12:55:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:55:58,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:58,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:58,779 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:58,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1793854371, now seen corresponding path program 1 times [2018-11-23 12:55:58,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:59,268 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) 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) [2018-11-23 12:55:59,272 INFO L168 Benchmark]: Toolchain (without parser) took 8958.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -265.7 MB). Peak memory consumption was 482.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:59,274 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:59,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.60 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:59,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:59,276 INFO L168 Benchmark]: Boogie Preprocessor took 51.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:59,277 INFO L168 Benchmark]: RCFGBuilder took 1028.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:59,278 INFO L168 Benchmark]: TraceAbstraction took 7063.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 495.5 MB). Peak memory consumption was 495.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:59,282 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 664.60 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 146.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1028.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7063.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 495.5 MB). Peak memory consumption was 495.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...