/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:27:23,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:27:23,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:27:23,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:27:23,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:27:23,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:27:23,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:27:23,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:27:23,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:27:23,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:27:23,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:27:23,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:27:23,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:27:23,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:27:23,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:27:23,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:27:23,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:27:23,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:27:23,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:27:23,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:27:23,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:27:23,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:27:23,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:27:23,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:27:23,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:27:23,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:27:23,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:27:23,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:27:23,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:27:23,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:27:23,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:27:23,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:27:23,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:27:23,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:27:23,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:27:23,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:27:23,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:27:23,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:27:23,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:27:23,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:27:23,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:27:23,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:27:23,332 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:27:23,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:27:23,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:27:23,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:27:23,334 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:27:23,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:27:23,335 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:27:23,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:27:23,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:27:23,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:27:23,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:27:23,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:27:23,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:27:23,337 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:27:23,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:27:23,338 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:27:23,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:27:23,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:27:23,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:27:23,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:27:23,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:27:23,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:27:23,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:27:23,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:27:23,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:27:23,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:27:23,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:27:23,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:27:23,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:27:23,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:27:23,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:27:23,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:27:23,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:27:23,643 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:27:23,644 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:27:23,644 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-2.i [2020-07-17 22:27:23,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f955befa5/8efd44eb8b374053a03246fc1f82a6f4/FLAG042010575 [2020-07-17 22:27:24,288 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:27:24,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-2.i [2020-07-17 22:27:24,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f955befa5/8efd44eb8b374053a03246fc1f82a6f4/FLAG042010575 [2020-07-17 22:27:24,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f955befa5/8efd44eb8b374053a03246fc1f82a6f4 [2020-07-17 22:27:24,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:27:24,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:27:24,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:27:24,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:27:24,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:27:24,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:27:24" (1/1) ... [2020-07-17 22:27:24,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8fdbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:24, skipping insertion in model container [2020-07-17 22:27:24,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:27:24" (1/1) ... [2020-07-17 22:27:24,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:27:24,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:27:25,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:27:25,199 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:27:25,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:27:25,333 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:27:25,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25 WrapperNode [2020-07-17 22:27:25,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:27:25,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:27:25,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:27:25,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:27:25,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (1/1) ... [2020-07-17 22:27:25,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (1/1) ... [2020-07-17 22:27:25,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (1/1) ... [2020-07-17 22:27:25,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (1/1) ... [2020-07-17 22:27:25,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (1/1) ... [2020-07-17 22:27:25,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (1/1) ... [2020-07-17 22:27:25,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (1/1) ... [2020-07-17 22:27:25,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:27:25,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:27:25,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:27:25,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:27:25,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (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 [2020-07-17 22:27:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:27:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:27:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 22:27:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 22:27:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-17 22:27:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-17 22:27:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-17 22:27:25,488 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-17 22:27:25,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:27:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:27:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:27:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:27:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:27:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:27:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:27:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:27:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:27:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:27:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:27:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:27:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:27:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:27:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:27:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:27:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:27:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:27:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:27:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 22:27:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 22:27:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-17 22:27:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-17 22:27:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-17 22:27:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:27:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:27:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:27:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:27:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:27:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:27:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:27:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:27:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:27:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:27:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:27:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:27:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:27:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:27:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:27:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:27:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:27:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:27:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:27:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:27:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:27:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:27:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:27:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:27:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:27:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:27:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:27:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:27:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:27:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:27:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:27:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:27:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:27:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:27:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:27:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:27:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:27:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:27:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:27:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:27:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:27:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:27:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:27:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:27:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:27:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:27:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:27:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:27:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:27:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:27:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:27:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:27:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:27:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:27:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-17 22:27:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:27:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:27:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:27:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:27:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:27:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:27:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:27:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:27:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:27:25,898 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-17 22:27:26,139 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:27:26,140 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:27:26,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:27:26 BoogieIcfgContainer [2020-07-17 22:27:26,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:27:26,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:27:26,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:27:26,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:27:26,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:27:24" (1/3) ... [2020-07-17 22:27:26,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a1ad3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:27:26, skipping insertion in model container [2020-07-17 22:27:26,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:27:25" (2/3) ... [2020-07-17 22:27:26,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a1ad3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:27:26, skipping insertion in model container [2020-07-17 22:27:26,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:27:26" (3/3) ... [2020-07-17 22:27:26,153 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-07-17 22:27:26,165 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:27:26,174 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:27:26,190 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:27:26,215 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:27:26,215 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:27:26,215 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:27:26,216 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:27:26,216 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:27:26,216 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:27:26,216 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:27:26,216 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:27:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-17 22:27:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:27:26,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:26,249 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:26,249 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1613857984, now seen corresponding path program 1 times [2020-07-17 22:27:26,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:26,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850435515] [2020-07-17 22:27:26,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:26,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {38#true} is VALID [2020-07-17 22:27:26,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:27:26,495 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-17 22:27:26,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:26,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {38#true} is VALID [2020-07-17 22:27:26,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:27:26,501 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-17 22:27:26,501 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret14 := main(); {38#true} is VALID [2020-07-17 22:27:26,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {38#true} is VALID [2020-07-17 22:27:26,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {38#true} is VALID [2020-07-17 22:27:26,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {38#true} is VALID [2020-07-17 22:27:26,504 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} assume !true; {39#false} is VALID [2020-07-17 22:27:26,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-17 22:27:26,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {39#false} is VALID [2020-07-17 22:27:26,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-17 22:27:26,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-17 22:27:26,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {39#false} is VALID [2020-07-17 22:27:26,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} assume 3 != #t~mem13;havoc #t~mem13; {39#false} is VALID [2020-07-17 22:27:26,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-17 22:27:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:26,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850435515] [2020-07-17 22:27:26,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:26,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:26,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075068398] [2020-07-17 22:27:26,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:27:26,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:26,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:26,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:26,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:26,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:26,591 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-17 22:27:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:26,791 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2020-07-17 22:27:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:27:26,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:27:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:27:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:27:26,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-17 22:27:26,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:26,975 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:27:26,975 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 22:27:26,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 22:27:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 22:27:27,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:27,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-17 22:27:27,036 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:27:27,036 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:27:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:27,042 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-17 22:27:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-17 22:27:27,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:27,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:27,044 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:27:27,044 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:27:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:27,051 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-17 22:27:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-17 22:27:27,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:27,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:27,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:27,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:27:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-17 22:27:27,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2020-07-17 22:27:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:27,061 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-17 22:27:27,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-17 22:27:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:27:27,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:27,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:27,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:27:27,064 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1642379272, now seen corresponding path program 1 times [2020-07-17 22:27:27,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:27,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724086329] [2020-07-17 22:27:27,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:27,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {198#true} is VALID [2020-07-17 22:27:27,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-17 22:27:27,258 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} #115#return; {198#true} is VALID [2020-07-17 22:27:27,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {206#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:27,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {198#true} is VALID [2020-07-17 22:27:27,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-17 22:27:27,260 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #115#return; {198#true} is VALID [2020-07-17 22:27:27,261 INFO L263 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret14 := main(); {198#true} is VALID [2020-07-17 22:27:27,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {198#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {198#true} is VALID [2020-07-17 22:27:27,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {198#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {198#true} is VALID [2020-07-17 22:27:27,263 INFO L280 TraceCheckUtils]: 7: Hoare triple {198#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,266 INFO L280 TraceCheckUtils]: 9: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,272 INFO L280 TraceCheckUtils]: 12: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~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; {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,273 INFO L280 TraceCheckUtils]: 13: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,274 INFO L280 TraceCheckUtils]: 14: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,275 INFO L280 TraceCheckUtils]: 16: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,276 INFO L280 TraceCheckUtils]: 17: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {205#(= |main_#t~mem13| 3)} is VALID [2020-07-17 22:27:27,277 INFO L280 TraceCheckUtils]: 18: Hoare triple {205#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {199#false} is VALID [2020-07-17 22:27:27,277 INFO L280 TraceCheckUtils]: 19: Hoare triple {199#false} assume !false; {199#false} is VALID [2020-07-17 22:27:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:27,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724086329] [2020-07-17 22:27:27,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:27,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:27:27,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98924000] [2020-07-17 22:27:27,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-17 22:27:27,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:27,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:27:27,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:27,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:27:27,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:27,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:27:27,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:27:27,311 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2020-07-17 22:27:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:27,678 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-17 22:27:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:27:27,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-17 22:27:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:27:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:27:27,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-17 22:27:27,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:27,786 INFO L225 Difference]: With dead ends: 50 [2020-07-17 22:27:27,787 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 22:27:27,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 22:27:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2020-07-17 22:27:27,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:27,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 34 states. [2020-07-17 22:27:27,802 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 34 states. [2020-07-17 22:27:27,803 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 34 states. [2020-07-17 22:27:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:27,807 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-17 22:27:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-17 22:27:27,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:27,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:27,808 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 46 states. [2020-07-17 22:27:27,808 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 46 states. [2020-07-17 22:27:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:27,812 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-17 22:27:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-17 22:27:27,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:27,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:27,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:27,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:27:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2020-07-17 22:27:27,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2020-07-17 22:27:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:27,817 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-07-17 22:27:27,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:27:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-17 22:27:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:27:27,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:27,818 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:27,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:27:27,819 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2024806125, now seen corresponding path program 1 times [2020-07-17 22:27:27,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:27,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81309097] [2020-07-17 22:27:27,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:27,943 INFO L280 TraceCheckUtils]: 0: Hoare triple {414#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {406#true} is VALID [2020-07-17 22:27:27,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-17 22:27:27,943 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #115#return; {406#true} is VALID [2020-07-17 22:27:27,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:27,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {414#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {406#true} is VALID [2020-07-17 22:27:27,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-17 22:27:27,946 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #115#return; {406#true} is VALID [2020-07-17 22:27:27,946 INFO L263 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret14 := main(); {406#true} is VALID [2020-07-17 22:27:27,946 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {406#true} is VALID [2020-07-17 22:27:27,947 INFO L280 TraceCheckUtils]: 6: Hoare triple {406#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {406#true} is VALID [2020-07-17 22:27:27,948 INFO L280 TraceCheckUtils]: 7: Hoare triple {406#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,949 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,949 INFO L280 TraceCheckUtils]: 9: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,950 INFO L280 TraceCheckUtils]: 10: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,951 INFO L280 TraceCheckUtils]: 11: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:27,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~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; {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,954 INFO L280 TraceCheckUtils]: 14: Hoare triple {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:27,955 INFO L280 TraceCheckUtils]: 15: Hoare triple {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {413#(= |main_#t~mem11| 3)} is VALID [2020-07-17 22:27:27,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {413#(= |main_#t~mem11| 3)} assume !!(1 == #t~mem11);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {407#false} is VALID [2020-07-17 22:27:27,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {407#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {407#false} is VALID [2020-07-17 22:27:27,956 INFO L280 TraceCheckUtils]: 18: Hoare triple {407#false} assume !(1 == #t~mem11);havoc #t~mem11; {407#false} is VALID [2020-07-17 22:27:27,957 INFO L280 TraceCheckUtils]: 19: Hoare triple {407#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {407#false} is VALID [2020-07-17 22:27:27,957 INFO L280 TraceCheckUtils]: 20: Hoare triple {407#false} assume 3 != #t~mem13;havoc #t~mem13; {407#false} is VALID [2020-07-17 22:27:27,957 INFO L280 TraceCheckUtils]: 21: Hoare triple {407#false} assume !false; {407#false} is VALID [2020-07-17 22:27:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:27,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81309097] [2020-07-17 22:27:27,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:27:27,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440872554] [2020-07-17 22:27:27,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-17 22:27:27,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:27,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:27:27,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:27,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:27:27,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:27:27,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:27:27,987 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2020-07-17 22:27:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:28,341 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-17 22:27:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:27:28,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-17 22:27:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:27:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:27:28,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-17 22:27:28,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:28,426 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:27:28,426 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:27:28,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:27:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2020-07-17 22:27:28,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:28,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 32 states. [2020-07-17 22:27:28,458 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 32 states. [2020-07-17 22:27:28,459 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 32 states. [2020-07-17 22:27:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:28,466 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-17 22:27:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-17 22:27:28,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:28,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:28,469 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 44 states. [2020-07-17 22:27:28,469 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 44 states. [2020-07-17 22:27:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:28,474 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-17 22:27:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-17 22:27:28,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:28,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:28,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:28,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:27:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-07-17 22:27:28,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2020-07-17 22:27:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:28,481 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-07-17 22:27:28,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:27:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-17 22:27:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:27:28,482 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:28,482 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:28,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:27:28,483 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1000103149, now seen corresponding path program 1 times [2020-07-17 22:27:28,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:28,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066115919] [2020-07-17 22:27:28,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:28,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {610#true} is VALID [2020-07-17 22:27:28,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2020-07-17 22:27:28,590 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #115#return; {610#true} is VALID [2020-07-17 22:27:28,591 INFO L263 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {618#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:28,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {610#true} is VALID [2020-07-17 22:27:28,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2020-07-17 22:27:28,592 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #115#return; {610#true} is VALID [2020-07-17 22:27:28,592 INFO L263 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret14 := main(); {610#true} is VALID [2020-07-17 22:27:28,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {610#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {610#true} is VALID [2020-07-17 22:27:28,593 INFO L280 TraceCheckUtils]: 6: Hoare triple {610#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {610#true} is VALID [2020-07-17 22:27:28,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {610#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:28,596 INFO L280 TraceCheckUtils]: 8: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:28,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:28,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:28,599 INFO L280 TraceCheckUtils]: 11: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:28,600 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~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; {616#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:28,602 INFO L280 TraceCheckUtils]: 13: Hoare triple {616#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {617#(= 3 |main_#t~mem9|)} is VALID [2020-07-17 22:27:28,603 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {611#false} is VALID [2020-07-17 22:27:28,604 INFO L280 TraceCheckUtils]: 15: Hoare triple {611#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {611#false} is VALID [2020-07-17 22:27:28,604 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#false} assume !(2 == #t~mem9);havoc #t~mem9; {611#false} is VALID [2020-07-17 22:27:28,604 INFO L280 TraceCheckUtils]: 17: Hoare triple {611#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {611#false} is VALID [2020-07-17 22:27:28,604 INFO L280 TraceCheckUtils]: 18: Hoare triple {611#false} assume !(1 == #t~mem11);havoc #t~mem11; {611#false} is VALID [2020-07-17 22:27:28,605 INFO L280 TraceCheckUtils]: 19: Hoare triple {611#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {611#false} is VALID [2020-07-17 22:27:28,605 INFO L280 TraceCheckUtils]: 20: Hoare triple {611#false} assume 3 != #t~mem13;havoc #t~mem13; {611#false} is VALID [2020-07-17 22:27:28,605 INFO L280 TraceCheckUtils]: 21: Hoare triple {611#false} assume !false; {611#false} is VALID [2020-07-17 22:27:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:28,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066115919] [2020-07-17 22:27:28,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:28,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:27:28,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482981210] [2020-07-17 22:27:28,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-17 22:27:28,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:28,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:27:28,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:28,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:27:28,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:28,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:27:28,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:27:28,635 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2020-07-17 22:27:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:28,943 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-17 22:27:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:27:28,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-17 22:27:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:27:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:27:28,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-17 22:27:29,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:29,004 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:27:29,005 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:27:29,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:27:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2020-07-17 22:27:29,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:29,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 29 states. [2020-07-17 22:27:29,023 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 29 states. [2020-07-17 22:27:29,023 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 29 states. [2020-07-17 22:27:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:29,025 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-17 22:27:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-17 22:27:29,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:29,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:29,026 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 41 states. [2020-07-17 22:27:29,026 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 41 states. [2020-07-17 22:27:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:29,029 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-17 22:27:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-17 22:27:29,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:29,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:29,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:29,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:27:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-17 22:27:29,031 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2020-07-17 22:27:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:29,032 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-17 22:27:29,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:27:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:27:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:27:29,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:29,033 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:29,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:27:29,033 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash 422878047, now seen corresponding path program 1 times [2020-07-17 22:27:29,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:29,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394824093] [2020-07-17 22:27:29,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:29,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {816#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {805#true} is VALID [2020-07-17 22:27:29,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-17 22:27:29,248 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-17 22:27:29,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {816#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:29,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {816#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {805#true} is VALID [2020-07-17 22:27:29,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-17 22:27:29,251 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-17 22:27:29,251 INFO L263 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret14 := main(); {805#true} is VALID [2020-07-17 22:27:29,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {805#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {810#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-17 22:27:29,253 INFO L280 TraceCheckUtils]: 6: Hoare triple {810#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {810#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-17 22:27:29,254 INFO L280 TraceCheckUtils]: 7: Hoare triple {810#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:29,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:29,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:29,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:29,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {811#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {812#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:29,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {812#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {812#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:29,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {812#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {813#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-17 22:27:29,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {813#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {813#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-17 22:27:29,264 INFO L280 TraceCheckUtils]: 15: Hoare triple {813#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet6);havoc #t~nondet6; {813#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-17 22:27:29,265 INFO L280 TraceCheckUtils]: 16: Hoare triple {813#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (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; {814#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:29,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {814#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {815#(= 2 |main_#t~mem9|)} is VALID [2020-07-17 22:27:29,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {815#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {806#false} is VALID [2020-07-17 22:27:29,266 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-17 22:27:29,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#false} assume !(1 == #t~mem11);havoc #t~mem11; {806#false} is VALID [2020-07-17 22:27:29,266 INFO L280 TraceCheckUtils]: 21: Hoare triple {806#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-17 22:27:29,267 INFO L280 TraceCheckUtils]: 22: Hoare triple {806#false} assume 3 != #t~mem13;havoc #t~mem13; {806#false} is VALID [2020-07-17 22:27:29,267 INFO L280 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-17 22:27:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:29,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394824093] [2020-07-17 22:27:29,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889430570] [2020-07-17 22:27:29,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:29,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-17 22:27:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:29,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:29,534 INFO L384 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 [2020-07-17 22:27:29,535 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,546 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:29,547 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,547 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 22:27:29,551 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:29,551 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|]. (and (= |#valid| (store |v_#valid_13| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:29,552 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:29,663 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:29,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-17 22:27:29,666 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,679 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:29,692 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2020-07-17 22:27:29,693 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,704 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:29,705 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,705 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-07-17 22:27:29,708 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:29,709 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, |v_#valid_14|]. (and (= (store |v_#memory_int_16| main_~p~0.base (store (select |v_#memory_int_16| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |v_#valid_14| main_~a~0.base)) (= (select |v_#valid_14| main_~t~0.base) 0) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:29,709 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:29,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:27:29,813 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 22:27:29,815 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,821 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:29,821 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,822 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-07-17 22:27:29,885 INFO L384 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 19 treesize of output 18 [2020-07-17 22:27:29,888 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:29,910 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:29,920 INFO L544 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. [2020-07-17 22:27:29,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-07-17 22:27:29,926 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:29,927 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= 2 (select (select |v_#memory_int_18| main_~p~0.base) 0)) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 0 main_~p~0.offset) (= (store |v_#memory_int_18| v_main_~p~0.base_18 (store (select |v_#memory_int_18| v_main_~p~0.base_18) v_main_~p~0.offset_18 3)) |#memory_int|)) [2020-07-17 22:27:29,927 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)) (= 0 main_~p~0.offset)) [2020-07-17 22:27:30,022 INFO L384 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 10 [2020-07-17 22:27:30,026 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:30,032 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:30,036 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:30,036 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-07-17 22:27:30,039 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:30,040 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 2 .cse0) (= |main_#t~mem9| .cse0) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))) [2020-07-17 22:27:30,040 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-17 22:27:30,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2020-07-17 22:27:30,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {805#true} is VALID [2020-07-17 22:27:30,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-17 22:27:30,046 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-17 22:27:30,047 INFO L263 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret14 := main(); {805#true} is VALID [2020-07-17 22:27:30,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {805#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {835#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:30,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {835#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {835#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:30,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {835#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:30,073 INFO L280 TraceCheckUtils]: 8: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:30,078 INFO L280 TraceCheckUtils]: 9: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:30,079 INFO L280 TraceCheckUtils]: 10: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:30,081 INFO L280 TraceCheckUtils]: 11: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {855#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:30,082 INFO L280 TraceCheckUtils]: 12: Hoare triple {855#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {855#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:30,084 INFO L280 TraceCheckUtils]: 13: Hoare triple {855#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {862#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:30,085 INFO L280 TraceCheckUtils]: 14: Hoare triple {862#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {862#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:30,086 INFO L280 TraceCheckUtils]: 15: Hoare triple {862#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {862#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:30,089 INFO L280 TraceCheckUtils]: 16: Hoare triple {862#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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; {872#(and (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} is VALID [2020-07-17 22:27:30,091 INFO L280 TraceCheckUtils]: 17: Hoare triple {872#(and (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {815#(= 2 |main_#t~mem9|)} is VALID [2020-07-17 22:27:30,092 INFO L280 TraceCheckUtils]: 18: Hoare triple {815#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {806#false} is VALID [2020-07-17 22:27:30,093 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-17 22:27:30,093 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#false} assume !(1 == #t~mem11);havoc #t~mem11; {806#false} is VALID [2020-07-17 22:27:30,093 INFO L280 TraceCheckUtils]: 21: Hoare triple {806#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-17 22:27:30,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {806#false} assume 3 != #t~mem13;havoc #t~mem13; {806#false} is VALID [2020-07-17 22:27:30,094 INFO L280 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-17 22:27:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:30,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:30,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-17 22:27:30,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151139187] [2020-07-17 22:27:30,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-17 22:27:30,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:30,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:27:30,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:30,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:27:30,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:27:30,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:27:30,152 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 14 states. [2020-07-17 22:27:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:31,120 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2020-07-17 22:27:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:27:31,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-17 22:27:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:27:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-17 22:27:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:27:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-17 22:27:31,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2020-07-17 22:27:31,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:31,205 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:27:31,205 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:27:31,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:27:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:27:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-17 22:27:31,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:31,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 36 states. [2020-07-17 22:27:31,232 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 36 states. [2020-07-17 22:27:31,232 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 36 states. [2020-07-17 22:27:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:31,236 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-17 22:27:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-17 22:27:31,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:31,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:31,237 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 48 states. [2020-07-17 22:27:31,237 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 48 states. [2020-07-17 22:27:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:31,241 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-17 22:27:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-17 22:27:31,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:31,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:31,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:31,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:27:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-17 22:27:31,244 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2020-07-17 22:27:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:31,245 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-17 22:27:31,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:27:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-17 22:27:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:27:31,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:31,246 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:31,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:31,452 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1286279711, now seen corresponding path program 1 times [2020-07-17 22:27:31,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:31,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4270449] [2020-07-17 22:27:31,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:31,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {1119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1108#true} is VALID [2020-07-17 22:27:31,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-17 22:27:31,624 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-17 22:27:31,625 INFO L263 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:31,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1108#true} is VALID [2020-07-17 22:27:31,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-17 22:27:31,626 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-17 22:27:31,626 INFO L263 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret14 := main(); {1108#true} is VALID [2020-07-17 22:27:31,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {1108#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1113#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-17 22:27:31,628 INFO L280 TraceCheckUtils]: 6: Hoare triple {1113#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1113#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-17 22:27:31,629 INFO L280 TraceCheckUtils]: 7: Hoare triple {1113#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1114#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:31,630 INFO L280 TraceCheckUtils]: 8: Hoare triple {1114#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1114#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:31,632 INFO L280 TraceCheckUtils]: 9: Hoare triple {1114#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1115#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:31,633 INFO L280 TraceCheckUtils]: 10: Hoare triple {1115#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1115#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:31,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {1115#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1116#(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 [2020-07-17 22:27:31,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {1116#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1116#(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 [2020-07-17 22:27:31,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {1116#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1116#(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 [2020-07-17 22:27:31,637 INFO L280 TraceCheckUtils]: 14: Hoare triple {1116#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1116#(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 [2020-07-17 22:27:31,638 INFO L280 TraceCheckUtils]: 15: Hoare triple {1116#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1116#(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 [2020-07-17 22:27:31,639 INFO L280 TraceCheckUtils]: 16: Hoare triple {1116#(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; {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:31,640 INFO L280 TraceCheckUtils]: 17: Hoare triple {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:31,640 INFO L280 TraceCheckUtils]: 18: Hoare triple {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:31,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1118#(= |main_#t~mem11| 1)} is VALID [2020-07-17 22:27:31,642 INFO L280 TraceCheckUtils]: 20: Hoare triple {1118#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {1109#false} is VALID [2020-07-17 22:27:31,642 INFO L280 TraceCheckUtils]: 21: Hoare triple {1109#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1109#false} is VALID [2020-07-17 22:27:31,642 INFO L280 TraceCheckUtils]: 22: Hoare triple {1109#false} assume 3 != #t~mem13;havoc #t~mem13; {1109#false} is VALID [2020-07-17 22:27:31,642 INFO L280 TraceCheckUtils]: 23: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2020-07-17 22:27:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:31,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4270449] [2020-07-17 22:27:31,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987455452] [2020-07-17 22:27:31,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:31,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-17 22:27:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:31,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:31,769 INFO L384 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 [2020-07-17 22:27:31,770 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:31,774 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:31,775 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:31,775 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 22:27:31,777 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:31,777 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (and (= |#valid| (store |v_#valid_15| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:31,778 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:31,847 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:31,847 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-17 22:27:31,849 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:31,859 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:31,866 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2020-07-17 22:27:31,866 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:31,876 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:31,876 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:31,877 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-07-17 22:27:31,879 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:31,880 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, |v_#valid_16|]. (and (= (store |v_#memory_int_19| main_~p~0.base (store (select |v_#memory_int_19| main_~p~0.base) main_~p~0.offset 1)) |#memory_int|) (= 1 (select |v_#valid_16| main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 0 (select |v_#valid_16| main_~t~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:31,880 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:31,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:27:31,946 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 22:27:31,953 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:31,959 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:31,960 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:31,960 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-07-17 22:27:32,017 INFO L384 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 19 treesize of output 18 [2020-07-17 22:27:32,019 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:32,027 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:32,030 INFO L544 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. [2020-07-17 22:27:32,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-07-17 22:27:32,034 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:32,034 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (store |v_#memory_int_21| v_main_~p~0.base_20 (store (select |v_#memory_int_21| v_main_~p~0.base_20) v_main_~p~0.offset_20 3)) |#memory_int|) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (select (select |v_#memory_int_21| main_~p~0.base) 0) 1) (= 0 main_~p~0.offset)) [2020-07-17 22:27:32,034 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0))) [2020-07-17 22:27:32,149 INFO L384 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 10 [2020-07-17 22:27:32,151 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:32,155 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:32,157 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:32,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-07-17 22:27:32,159 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:32,160 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_20, v_main_~p~0.offset_20, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= |main_#t~mem11| .cse0) (= 1 .cse0))) [2020-07-17 22:27:32,160 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| 1) [2020-07-17 22:27:32,168 INFO L263 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2020-07-17 22:27:32,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {1108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1108#true} is VALID [2020-07-17 22:27:32,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-17 22:27:32,169 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-17 22:27:32,169 INFO L263 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret14 := main(); {1108#true} is VALID [2020-07-17 22:27:32,173 INFO L280 TraceCheckUtils]: 5: Hoare triple {1108#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1138#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:32,173 INFO L280 TraceCheckUtils]: 6: Hoare triple {1138#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1138#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:32,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {1138#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:32,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:32,176 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1152#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:32,177 INFO L280 TraceCheckUtils]: 10: Hoare triple {1152#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1152#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:32,178 INFO L280 TraceCheckUtils]: 11: Hoare triple {1152#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:32,178 INFO L280 TraceCheckUtils]: 12: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:32,179 INFO L280 TraceCheckUtils]: 13: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:32,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:32,180 INFO L280 TraceCheckUtils]: 15: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:32,182 INFO L280 TraceCheckUtils]: 16: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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; {1175#(and (= 0 main_~p~0.offset) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-17 22:27:32,183 INFO L280 TraceCheckUtils]: 17: Hoare triple {1175#(and (= 0 main_~p~0.offset) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1175#(and (= 0 main_~p~0.offset) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-17 22:27:32,183 INFO L280 TraceCheckUtils]: 18: Hoare triple {1175#(and (= 0 main_~p~0.offset) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} assume !(2 == #t~mem9);havoc #t~mem9; {1175#(and (= 0 main_~p~0.offset) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-17 22:27:32,184 INFO L280 TraceCheckUtils]: 19: Hoare triple {1175#(and (= 0 main_~p~0.offset) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1118#(= |main_#t~mem11| 1)} is VALID [2020-07-17 22:27:32,185 INFO L280 TraceCheckUtils]: 20: Hoare triple {1118#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {1109#false} is VALID [2020-07-17 22:27:32,185 INFO L280 TraceCheckUtils]: 21: Hoare triple {1109#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1109#false} is VALID [2020-07-17 22:27:32,185 INFO L280 TraceCheckUtils]: 22: Hoare triple {1109#false} assume 3 != #t~mem13;havoc #t~mem13; {1109#false} is VALID [2020-07-17 22:27:32,186 INFO L280 TraceCheckUtils]: 23: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2020-07-17 22:27:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:32,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:32,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-17 22:27:32,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340461597] [2020-07-17 22:27:32,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-17 22:27:32,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:32,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:27:32,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:32,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:27:32,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:27:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:27:32,251 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 14 states. [2020-07-17 22:27:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:33,448 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2020-07-17 22:27:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:27:33,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-17 22:27:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:27:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2020-07-17 22:27:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:27:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2020-07-17 22:27:33,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2020-07-17 22:27:33,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:33,552 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:27:33,553 INFO L226 Difference]: Without dead ends: 59 [2020-07-17 22:27:33,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:27:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-17 22:27:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-17 22:27:33,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:33,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-17 22:27:33,587 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-17 22:27:33,588 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-17 22:27:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:33,591 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-17 22:27:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-17 22:27:33,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:33,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:33,592 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-17 22:27:33,593 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-17 22:27:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:33,595 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-17 22:27:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-17 22:27:33,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:33,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:33,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:33,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:27:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-17 22:27:33,601 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-17 22:27:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:33,603 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-17 22:27:33,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:27:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-17 22:27:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:27:33,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:33,604 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:33,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:33,809 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:33,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:33,810 INFO L82 PathProgramCache]: Analyzing trace with hash -562710342, now seen corresponding path program 1 times [2020-07-17 22:27:33,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:33,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502680876] [2020-07-17 22:27:33,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:34,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {1469#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1457#true} is VALID [2020-07-17 22:27:34,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-17 22:27:34,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-17 22:27:34,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1469#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:34,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {1469#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1457#true} is VALID [2020-07-17 22:27:34,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-17 22:27:34,079 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-17 22:27:34,079 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret14 := main(); {1457#true} is VALID [2020-07-17 22:27:34,084 INFO L280 TraceCheckUtils]: 5: Hoare triple {1457#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:34,085 INFO L280 TraceCheckUtils]: 6: Hoare triple {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:34,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,088 INFO L280 TraceCheckUtils]: 11: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:34,089 INFO L280 TraceCheckUtils]: 12: Hoare triple {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:34,090 INFO L280 TraceCheckUtils]: 13: Hoare triple {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,096 INFO L280 TraceCheckUtils]: 14: Hoare triple {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,103 INFO L280 TraceCheckUtils]: 15: Hoare triple {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~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; {1466#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-17 22:27:34,109 INFO L280 TraceCheckUtils]: 17: Hoare triple {1466#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1466#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-17 22:27:34,110 INFO L280 TraceCheckUtils]: 18: Hoare triple {1466#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,111 INFO L280 TraceCheckUtils]: 20: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,111 INFO L280 TraceCheckUtils]: 21: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,112 INFO L280 TraceCheckUtils]: 22: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,113 INFO L280 TraceCheckUtils]: 23: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1468#(= |main_#t~mem13| 3)} is VALID [2020-07-17 22:27:34,114 INFO L280 TraceCheckUtils]: 24: Hoare triple {1468#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {1458#false} is VALID [2020-07-17 22:27:34,114 INFO L280 TraceCheckUtils]: 25: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-17 22:27:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:34,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502680876] [2020-07-17 22:27:34,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558099589] [2020-07-17 22:27:34,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:34,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-17 22:27:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:34,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:34,273 INFO L384 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 [2020-07-17 22:27:34,273 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,280 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,280 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,280 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 22:27:34,282 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:34,283 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_17|]. (and (= |#valid| (store |v_#valid_17| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:34,283 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:34,323 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,324 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-17 22:27:34,328 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,333 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,334 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-17 22:27:34,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:34,367 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,389 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,399 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:34,400 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,411 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,412 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,413 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-17 22:27:34,418 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:34,418 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_15|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_17|]. (and (not (= main_~t~0.base main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset) (= (store |v_#memory_$Pointer$.offset_15| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_15| main_~a~0.base) 4 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_17| main_~a~0.base (store (select |v_#memory_$Pointer$.base_17| main_~a~0.base) 4 main_~t~0.base)))) [2020-07-17 22:27:34,418 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (and (not (= main_~a~0.base .cse0)) (= main_~p~0.base .cse0) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))) [2020-07-17 22:27:34,458 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2020-07-17 22:27:34,466 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 treesize of output 15 [2020-07-17 22:27:34,466 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,478 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,511 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,512 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-07-17 22:27:34,521 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-17 22:27:34,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:34,524 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,545 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-17 22:27:34,550 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-07-17 22:27:34,552 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,559 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,560 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,560 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-17 22:27:34,568 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:34,568 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_18|, |v_#memory_int_22|, |v_#memory_$Pointer$.offset_16|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_18| main_~p~0.base) 4)) (.cse1 (select (select |v_#memory_$Pointer$.offset_16| main_~p~0.base) 4))) (and (= (store |v_#memory_$Pointer$.offset_16| .cse0 (store (select |v_#memory_$Pointer$.offset_16| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= 0 main_~p~0.offset) (not (= main_~p~0.base .cse0)) (= (store |v_#memory_$Pointer$.base_18| .cse0 (store (select |v_#memory_$Pointer$.base_18| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_22| .cse0 (store (select |v_#memory_int_22| .cse0) .cse1 3)) |#memory_int|))) [2020-07-17 22:27:34,568 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))) (and (= 3 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= .cse0 main_~p~0.base)) (= 0 main_~p~0.offset))) [2020-07-17 22:27:34,617 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-07-17 22:27:34,619 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,624 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,627 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2020-07-17 22:27:34,628 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,632 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,634 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,634 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-17 22:27:34,636 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:34,636 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_23, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_23) 4)) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_23) 4))) (and (= .cse0 main_~p~0.base) (= .cse1 main_~p~0.offset) (not (= v_main_~p~0.base_23 .cse0)) (= (select (select |#memory_int| .cse0) .cse1) 3))) [2020-07-17 22:27:34,636 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-17 22:27:34,648 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-17 22:27:34,649 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,652 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:34,652 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:34,652 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 22:27:34,655 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:34,656 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= |main_#t~mem13| .cse0) (= 3 .cse0))) [2020-07-17 22:27:34,656 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem13| 3) [2020-07-17 22:27:34,657 INFO L263 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1457#true} is VALID [2020-07-17 22:27:34,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {1457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1457#true} is VALID [2020-07-17 22:27:34,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-17 22:27:34,657 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-17 22:27:34,657 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret14 := main(); {1457#true} is VALID [2020-07-17 22:27:34,662 INFO L280 TraceCheckUtils]: 5: Hoare triple {1457#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:34,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:34,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,672 INFO L280 TraceCheckUtils]: 9: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:34,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {1463#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:34,676 INFO L280 TraceCheckUtils]: 12: Hoare triple {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:34,677 INFO L280 TraceCheckUtils]: 13: Hoare triple {1464#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,678 INFO L280 TraceCheckUtils]: 14: Hoare triple {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,679 INFO L280 TraceCheckUtils]: 15: Hoare triple {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {1465#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~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; {1521#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-17 22:27:34,681 INFO L280 TraceCheckUtils]: 17: Hoare triple {1521#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1521#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-17 22:27:34,682 INFO L280 TraceCheckUtils]: 18: Hoare triple {1521#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,683 INFO L280 TraceCheckUtils]: 19: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,683 INFO L280 TraceCheckUtils]: 20: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,684 INFO L280 TraceCheckUtils]: 21: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,685 INFO L280 TraceCheckUtils]: 22: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:34,685 INFO L280 TraceCheckUtils]: 23: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1468#(= |main_#t~mem13| 3)} is VALID [2020-07-17 22:27:34,686 INFO L280 TraceCheckUtils]: 24: Hoare triple {1468#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {1458#false} is VALID [2020-07-17 22:27:34,686 INFO L280 TraceCheckUtils]: 25: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-17 22:27:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:34,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:34,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-17 22:27:34,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102059808] [2020-07-17 22:27:34,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-07-17 22:27:34,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:34,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:27:34,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:34,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:27:34,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:27:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:27:34,732 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 11 states. [2020-07-17 22:27:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:35,785 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2020-07-17 22:27:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:27:35,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-07-17 22:27:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:27:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-17 22:27:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:27:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-17 22:27:35,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2020-07-17 22:27:35,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:35,880 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:27:35,880 INFO L226 Difference]: Without dead ends: 63 [2020-07-17 22:27:35,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:27:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-17 22:27:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2020-07-17 22:27:35,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:35,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 51 states. [2020-07-17 22:27:35,913 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 51 states. [2020-07-17 22:27:35,913 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 51 states. [2020-07-17 22:27:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:35,916 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-17 22:27:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-17 22:27:35,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:35,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:35,916 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 63 states. [2020-07-17 22:27:35,917 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 63 states. [2020-07-17 22:27:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:35,919 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-17 22:27:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-17 22:27:35,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:35,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:35,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:35,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-17 22:27:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2020-07-17 22:27:35,922 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2020-07-17 22:27:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:35,923 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2020-07-17 22:27:35,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:27:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2020-07-17 22:27:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:27:35,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:35,924 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:36,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:36,138 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash 449917269, now seen corresponding path program 1 times [2020-07-17 22:27:36,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:36,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824663582] [2020-07-17 22:27:36,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:36,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {1837#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1825#true} is VALID [2020-07-17 22:27:36,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-17 22:27:36,374 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-17 22:27:36,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1837#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:36,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {1837#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1825#true} is VALID [2020-07-17 22:27:36,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-17 22:27:36,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-17 22:27:36,377 INFO L263 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret14 := main(); {1825#true} is VALID [2020-07-17 22:27:36,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {1825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:36,392 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:36,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:36,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:36,394 INFO L280 TraceCheckUtils]: 9: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:36,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:36,396 INFO L280 TraceCheckUtils]: 11: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:36,397 INFO L280 TraceCheckUtils]: 12: Hoare triple {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:36,399 INFO L280 TraceCheckUtils]: 13: Hoare triple {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:36,400 INFO L280 TraceCheckUtils]: 14: Hoare triple {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:36,401 INFO L280 TraceCheckUtils]: 15: Hoare triple {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:36,403 INFO L280 TraceCheckUtils]: 16: Hoare triple {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~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; {1834#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-17 22:27:36,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {1834#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1834#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-17 22:27:36,405 INFO L280 TraceCheckUtils]: 18: Hoare triple {1834#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:36,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:36,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:36,407 INFO L280 TraceCheckUtils]: 21: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1836#(= |main_#t~mem11| 3)} is VALID [2020-07-17 22:27:36,408 INFO L280 TraceCheckUtils]: 22: Hoare triple {1836#(= |main_#t~mem11| 3)} assume !!(1 == #t~mem11);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1826#false} is VALID [2020-07-17 22:27:36,408 INFO L280 TraceCheckUtils]: 23: Hoare triple {1826#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-17 22:27:36,409 INFO L280 TraceCheckUtils]: 24: Hoare triple {1826#false} assume !(1 == #t~mem11);havoc #t~mem11; {1826#false} is VALID [2020-07-17 22:27:36,409 INFO L280 TraceCheckUtils]: 25: Hoare triple {1826#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-17 22:27:36,409 INFO L280 TraceCheckUtils]: 26: Hoare triple {1826#false} assume 3 != #t~mem13;havoc #t~mem13; {1826#false} is VALID [2020-07-17 22:27:36,410 INFO L280 TraceCheckUtils]: 27: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2020-07-17 22:27:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:36,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824663582] [2020-07-17 22:27:36,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700995917] [2020-07-17 22:27:36,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:36,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-17 22:27:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:36,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:36,574 INFO L384 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 [2020-07-17 22:27:36,574 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,583 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,584 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,584 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 22:27:36,587 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:36,588 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_19|]. (and (= |#valid| (store |v_#valid_19| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:36,588 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:36,633 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,634 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-17 22:27:36,635 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,645 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,646 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,646 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-17 22:27:36,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:36,690 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,706 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,714 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:36,714 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,729 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,733 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,733 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-17 22:27:36,738 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:36,739 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_17|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_19|]. (and (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_17| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_17| main_~a~0.base) 4 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset) (= (store |v_#memory_$Pointer$.base_19| main_~a~0.base (store (select |v_#memory_$Pointer$.base_19| main_~a~0.base) 4 main_~t~0.base)) |#memory_$Pointer$.base|)) [2020-07-17 22:27:36,739 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (and (not (= main_~a~0.base .cse0)) (= main_~p~0.base .cse0) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))) [2020-07-17 22:27:36,808 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_23|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|]} [2020-07-17 22:27:36,815 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 treesize of output 15 [2020-07-17 22:27:36,815 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,829 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,833 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2020-07-17 22:27:36,836 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,845 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,866 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,866 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 85 [2020-07-17 22:27:36,871 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-07-17 22:27:36,872 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:27:36,874 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,888 INFO L624 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2020-07-17 22:27:36,889 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,889 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-17 22:27:36,899 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:36,899 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_20|, |v_#memory_int_23|, |v_#memory_$Pointer$.offset_18|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_20| main_~p~0.base) 4)) (.cse1 (select (select |v_#memory_$Pointer$.offset_18| main_~p~0.base) 4))) (and (not (= .cse0 main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_23| .cse0 (store (select |v_#memory_int_23| .cse0) .cse1 3))) (= 0 main_~p~0.offset) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_20| .cse0 (store (select |v_#memory_$Pointer$.base_20| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_18| .cse0 (store (select |v_#memory_$Pointer$.offset_18| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))))) [2020-07-17 22:27:36,899 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))) (and (= 3 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= .cse0 main_~p~0.base)) (= 0 main_~p~0.offset))) [2020-07-17 22:27:36,961 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-07-17 22:27:36,962 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,968 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,971 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2020-07-17 22:27:36,974 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,979 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,980 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,981 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-17 22:27:36,983 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:36,983 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_26, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_26) 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_26) 4))) (and (= 3 (select (select |#memory_int| .cse0) .cse1)) (= .cse0 main_~p~0.base) (= main_~p~0.offset .cse1) (not (= v_main_~p~0.base_26 .cse0)))) [2020-07-17 22:27:36,983 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-17 22:27:36,995 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-17 22:27:36,998 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:36,999 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:36,999 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:37,000 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 22:27:37,002 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:37,002 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (<= .cse0 |main_#t~mem11|) (= 3 .cse0))) [2020-07-17 22:27:37,003 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem11|) [2020-07-17 22:27:37,030 INFO L263 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2020-07-17 22:27:37,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {1825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1825#true} is VALID [2020-07-17 22:27:37,031 INFO L280 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-17 22:27:37,031 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-17 22:27:37,032 INFO L263 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret14 := main(); {1825#true} is VALID [2020-07-17 22:27:37,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {1825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:37,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:37,034 INFO L280 TraceCheckUtils]: 7: Hoare triple {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:37,035 INFO L280 TraceCheckUtils]: 8: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:37,036 INFO L280 TraceCheckUtils]: 9: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:37,037 INFO L280 TraceCheckUtils]: 10: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:37,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {1831#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:37,038 INFO L280 TraceCheckUtils]: 12: Hoare triple {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:37,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {1832#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:37,042 INFO L280 TraceCheckUtils]: 14: Hoare triple {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:37,046 INFO L280 TraceCheckUtils]: 15: Hoare triple {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:37,048 INFO L280 TraceCheckUtils]: 16: Hoare triple {1833#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~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; {1889#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-17 22:27:37,049 INFO L280 TraceCheckUtils]: 17: Hoare triple {1889#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1889#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-17 22:27:37,050 INFO L280 TraceCheckUtils]: 18: Hoare triple {1889#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:37,051 INFO L280 TraceCheckUtils]: 19: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:37,052 INFO L280 TraceCheckUtils]: 20: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:37,052 INFO L280 TraceCheckUtils]: 21: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1905#(<= 3 |main_#t~mem11|)} is VALID [2020-07-17 22:27:37,053 INFO L280 TraceCheckUtils]: 22: Hoare triple {1905#(<= 3 |main_#t~mem11|)} assume !!(1 == #t~mem11);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1826#false} is VALID [2020-07-17 22:27:37,053 INFO L280 TraceCheckUtils]: 23: Hoare triple {1826#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-17 22:27:37,053 INFO L280 TraceCheckUtils]: 24: Hoare triple {1826#false} assume !(1 == #t~mem11);havoc #t~mem11; {1826#false} is VALID [2020-07-17 22:27:37,054 INFO L280 TraceCheckUtils]: 25: Hoare triple {1826#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-17 22:27:37,054 INFO L280 TraceCheckUtils]: 26: Hoare triple {1826#false} assume 3 != #t~mem13;havoc #t~mem13; {1826#false} is VALID [2020-07-17 22:27:37,054 INFO L280 TraceCheckUtils]: 27: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2020-07-17 22:27:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:37,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:37,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-17 22:27:37,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378768202] [2020-07-17 22:27:37,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-17 22:27:37,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:37,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:27:37,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:37,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:27:37,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:37,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:27:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:27:37,104 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 12 states. [2020-07-17 22:27:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:38,125 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2020-07-17 22:27:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:27:38,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-17 22:27:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:27:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2020-07-17 22:27:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:27:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2020-07-17 22:27:38,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2020-07-17 22:27:38,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:38,223 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:27:38,223 INFO L226 Difference]: Without dead ends: 59 [2020-07-17 22:27:38,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:27:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-17 22:27:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-07-17 22:27:38,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:38,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 42 states. [2020-07-17 22:27:38,256 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 42 states. [2020-07-17 22:27:38,256 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 42 states. [2020-07-17 22:27:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:38,260 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-17 22:27:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-17 22:27:38,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:38,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:38,260 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 59 states. [2020-07-17 22:27:38,261 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 59 states. [2020-07-17 22:27:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:38,263 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-17 22:27:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-17 22:27:38,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:38,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:38,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:38,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:27:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-07-17 22:27:38,279 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2020-07-17 22:27:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:38,279 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-07-17 22:27:38,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:27:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-07-17 22:27:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:27:38,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:38,280 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:38,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:38,495 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1474620245, now seen corresponding path program 2 times [2020-07-17 22:27:38,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:38,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749832868] [2020-07-17 22:27:38,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:38,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {2196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2184#true} is VALID [2020-07-17 22:27:38,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-17 22:27:38,732 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-17 22:27:38,733 INFO L263 TraceCheckUtils]: 0: Hoare triple {2184#true} call ULTIMATE.init(); {2196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:38,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {2196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2184#true} is VALID [2020-07-17 22:27:38,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-17 22:27:38,733 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-17 22:27:38,733 INFO L263 TraceCheckUtils]: 4: Hoare triple {2184#true} call #t~ret14 := main(); {2184#true} is VALID [2020-07-17 22:27:38,734 INFO L280 TraceCheckUtils]: 5: Hoare triple {2184#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:38,735 INFO L280 TraceCheckUtils]: 6: Hoare triple {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:38,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:38,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:38,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:38,737 INFO L280 TraceCheckUtils]: 10: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:38,738 INFO L280 TraceCheckUtils]: 11: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:38,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:38,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:38,741 INFO L280 TraceCheckUtils]: 14: Hoare triple {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:38,742 INFO L280 TraceCheckUtils]: 15: Hoare triple {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:38,743 INFO L280 TraceCheckUtils]: 16: Hoare triple {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~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; {2193#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-17 22:27:38,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {2193#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2193#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-17 22:27:38,744 INFO L280 TraceCheckUtils]: 18: Hoare triple {2193#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:38,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2195#(= 3 |main_#t~mem9|)} is VALID [2020-07-17 22:27:38,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {2195#(= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2185#false} is VALID [2020-07-17 22:27:38,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {2185#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-17 22:27:38,746 INFO L280 TraceCheckUtils]: 22: Hoare triple {2185#false} assume !(2 == #t~mem9);havoc #t~mem9; {2185#false} is VALID [2020-07-17 22:27:38,746 INFO L280 TraceCheckUtils]: 23: Hoare triple {2185#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-17 22:27:38,746 INFO L280 TraceCheckUtils]: 24: Hoare triple {2185#false} assume !(1 == #t~mem11);havoc #t~mem11; {2185#false} is VALID [2020-07-17 22:27:38,746 INFO L280 TraceCheckUtils]: 25: Hoare triple {2185#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-17 22:27:38,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {2185#false} assume 3 != #t~mem13;havoc #t~mem13; {2185#false} is VALID [2020-07-17 22:27:38,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {2185#false} assume !false; {2185#false} is VALID [2020-07-17 22:27:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:38,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749832868] [2020-07-17 22:27:38,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822143803] [2020-07-17 22:27:38,749 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:38,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:27:38,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:27:38,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-17 22:27:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:38,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:38,883 INFO L384 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 [2020-07-17 22:27:38,884 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:38,888 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:38,889 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:38,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 22:27:38,891 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:38,892 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (and (= |#valid| (store |v_#valid_21| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:38,892 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:38,928 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:38,928 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-17 22:27:38,930 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:38,937 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:38,938 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:38,938 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-17 22:27:38,978 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:38,978 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:38,990 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:38,997 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:38,998 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,015 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:39,017 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,018 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-17 22:27:39,023 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:39,023 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_19|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_21|]. (and (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_19| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_19| main_~a~0.base) 4 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_21| main_~a~0.base (store (select |v_#memory_$Pointer$.base_21| main_~a~0.base) 4 main_~t~0.base))) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset)) [2020-07-17 22:27:39,024 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (and (not (= main_~a~0.base .cse0)) (= 0 main_~a~0.offset) (= main_~p~0.base .cse0) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))) [2020-07-17 22:27:39,062 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|]} [2020-07-17 22:27:39,067 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 treesize of output 15 [2020-07-17 22:27:39,068 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,081 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:39,099 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:39,099 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-07-17 22:27:39,113 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-17 22:27:39,113 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:39,115 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,138 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-17 22:27:39,144 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-07-17 22:27:39,145 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,152 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:39,152 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,153 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-17 22:27:39,161 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:39,162 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_22|, |v_#memory_int_24|, |v_#memory_$Pointer$.offset_20|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_22| main_~p~0.base) 4)) (.cse1 (select (select |v_#memory_$Pointer$.offset_20| main_~p~0.base) 4))) (and (= |#memory_int| (store |v_#memory_int_24| .cse0 (store (select |v_#memory_int_24| .cse0) .cse1 3))) (not (= .cse0 main_~p~0.base)) (= 0 main_~p~0.offset) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_22| .cse0 (store (select |v_#memory_$Pointer$.base_22| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_$Pointer$.offset_20| .cse0 (store (select |v_#memory_$Pointer$.offset_20| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|))) [2020-07-17 22:27:39,162 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))) (and (= 3 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= .cse0 main_~p~0.base)) (= 0 main_~p~0.offset))) [2020-07-17 22:27:39,202 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-07-17 22:27:39,205 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,212 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:39,216 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2020-07-17 22:27:39,217 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,222 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:39,224 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,224 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-17 22:27:39,227 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:39,227 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_29, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) 4)) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) 4))) (and (not (= v_main_~p~0.base_29 .cse0)) (= 3 (select (select |#memory_int| .cse0) .cse1)) (= .cse0 main_~p~0.base) (= main_~p~0.offset .cse1))) [2020-07-17 22:27:39,227 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-17 22:27:39,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-17 22:27:39,242 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,244 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:39,244 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:39,244 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 22:27:39,246 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:39,246 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (<= .cse0 |main_#t~mem9|) (= 3 .cse0))) [2020-07-17 22:27:39,246 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem9|) [2020-07-17 22:27:39,272 INFO L263 TraceCheckUtils]: 0: Hoare triple {2184#true} call ULTIMATE.init(); {2184#true} is VALID [2020-07-17 22:27:39,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {2184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2184#true} is VALID [2020-07-17 22:27:39,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-17 22:27:39,273 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-17 22:27:39,273 INFO L263 TraceCheckUtils]: 4: Hoare triple {2184#true} call #t~ret14 := main(); {2184#true} is VALID [2020-07-17 22:27:39,274 INFO L280 TraceCheckUtils]: 5: Hoare triple {2184#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:39,275 INFO L280 TraceCheckUtils]: 6: Hoare triple {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:39,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:39,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:39,277 INFO L280 TraceCheckUtils]: 9: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:39,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:39,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {2190#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:39,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:39,280 INFO L280 TraceCheckUtils]: 13: Hoare triple {2191#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:39,281 INFO L280 TraceCheckUtils]: 14: Hoare triple {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:39,282 INFO L280 TraceCheckUtils]: 15: Hoare triple {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:39,283 INFO L280 TraceCheckUtils]: 16: Hoare triple {2192#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~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; {2248#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-17 22:27:39,283 INFO L280 TraceCheckUtils]: 17: Hoare triple {2248#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2248#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-17 22:27:39,284 INFO L280 TraceCheckUtils]: 18: Hoare triple {2248#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:39,285 INFO L280 TraceCheckUtils]: 19: Hoare triple {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2258#(<= 3 |main_#t~mem9|)} is VALID [2020-07-17 22:27:39,286 INFO L280 TraceCheckUtils]: 20: Hoare triple {2258#(<= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2185#false} is VALID [2020-07-17 22:27:39,286 INFO L280 TraceCheckUtils]: 21: Hoare triple {2185#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-17 22:27:39,286 INFO L280 TraceCheckUtils]: 22: Hoare triple {2185#false} assume !(2 == #t~mem9);havoc #t~mem9; {2185#false} is VALID [2020-07-17 22:27:39,286 INFO L280 TraceCheckUtils]: 23: Hoare triple {2185#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-17 22:27:39,287 INFO L280 TraceCheckUtils]: 24: Hoare triple {2185#false} assume !(1 == #t~mem11);havoc #t~mem11; {2185#false} is VALID [2020-07-17 22:27:39,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {2185#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-17 22:27:39,287 INFO L280 TraceCheckUtils]: 26: Hoare triple {2185#false} assume 3 != #t~mem13;havoc #t~mem13; {2185#false} is VALID [2020-07-17 22:27:39,287 INFO L280 TraceCheckUtils]: 27: Hoare triple {2185#false} assume !false; {2185#false} is VALID [2020-07-17 22:27:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:39,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:39,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-17 22:27:39,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364377083] [2020-07-17 22:27:39,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-17 22:27:39,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:39,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:27:39,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:39,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:27:39,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:27:39,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:27:39,332 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 12 states. [2020-07-17 22:27:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:40,184 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-17 22:27:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:27:40,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-17 22:27:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:27:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2020-07-17 22:27:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:27:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2020-07-17 22:27:40,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2020-07-17 22:27:40,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:40,294 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:27:40,295 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:27:40,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:27:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:27:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2020-07-17 22:27:40,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:40,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 37 states. [2020-07-17 22:27:40,319 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 37 states. [2020-07-17 22:27:40,319 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 37 states. [2020-07-17 22:27:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:40,321 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-17 22:27:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-17 22:27:40,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:40,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:40,322 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 49 states. [2020-07-17 22:27:40,322 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 49 states. [2020-07-17 22:27:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:40,324 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-17 22:27:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-17 22:27:40,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:40,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:40,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:40,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:27:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-17 22:27:40,326 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2020-07-17 22:27:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:40,326 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-17 22:27:40,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:27:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-17 22:27:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:27:40,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:40,327 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:40,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:40,539 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash -149429434, now seen corresponding path program 2 times [2020-07-17 22:27:40,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:40,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600479375] [2020-07-17 22:27:40,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:40,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {2524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2509#true} is VALID [2020-07-17 22:27:40,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-17 22:27:40,808 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-17 22:27:40,809 INFO L263 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:40,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2509#true} is VALID [2020-07-17 22:27:40,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-17 22:27:40,810 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-17 22:27:40,810 INFO L263 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret14 := main(); {2509#true} is VALID [2020-07-17 22:27:40,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {2509#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:40,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:40,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,815 INFO L280 TraceCheckUtils]: 9: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,820 INFO L280 TraceCheckUtils]: 10: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,822 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2516#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {2516#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2516#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,826 INFO L280 TraceCheckUtils]: 13: Hoare triple {2516#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2517#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:40,831 INFO L280 TraceCheckUtils]: 14: Hoare triple {2517#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2517#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:40,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {2517#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2518#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-17 22:27:40,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {2518#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2518#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-17 22:27:40,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {2518#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2519#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,839 INFO L280 TraceCheckUtils]: 18: Hoare triple {2519#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2519#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,840 INFO L280 TraceCheckUtils]: 19: Hoare triple {2519#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2519#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:40,842 INFO L280 TraceCheckUtils]: 20: Hoare triple {2519#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~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; {2520#(or (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-17 22:27:40,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {2520#(or (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2521#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 |main_#t~mem9|))} is VALID [2020-07-17 22:27:40,843 INFO L280 TraceCheckUtils]: 22: Hoare triple {2521#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 |main_#t~mem9|))} assume !(2 == #t~mem9);havoc #t~mem9; {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:40,844 INFO L280 TraceCheckUtils]: 23: Hoare triple {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:40,845 INFO L280 TraceCheckUtils]: 24: Hoare triple {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:40,846 INFO L280 TraceCheckUtils]: 25: Hoare triple {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2523#(= |main_#t~mem13| 3)} is VALID [2020-07-17 22:27:40,847 INFO L280 TraceCheckUtils]: 26: Hoare triple {2523#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {2510#false} is VALID [2020-07-17 22:27:40,847 INFO L280 TraceCheckUtils]: 27: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2020-07-17 22:27:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:40,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600479375] [2020-07-17 22:27:40,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658362820] [2020-07-17 22:27:40,850 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:40,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:27:40,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:27:40,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-17 22:27:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:40,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:40,991 INFO L384 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 [2020-07-17 22:27:40,992 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,004 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,004 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,004 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 22:27:41,007 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:41,007 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_23|]. (and (= (store |v_#valid_23| main_~a~0.base 1) |#valid|) (= 0 main_~a~0.offset)) [2020-07-17 22:27:41,007 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:41,097 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,097 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-17 22:27:41,100 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,143 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-17 22:27:41,156 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:41,157 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,173 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,174 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,174 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-17 22:27:41,180 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:41,180 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|, |v_#valid_24|]. (and (= |#valid| (store |v_#valid_24| main_~t~0.base 1)) (= main_~a~0.base main_~p~0.base) (= 0 (select |v_#valid_24| main_~t~0.base)) (= 0 main_~a~0.offset) (= (store |v_#memory_int_25| main_~p~0.base (store (select |v_#memory_int_25| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= main_~a~0.offset main_~p~0.offset) (= 1 (select |v_#valid_24| main_~p~0.base))) [2020-07-17 22:27:41,181 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:41,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:27:41,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 22:27:41,280 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,291 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,292 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,292 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-17 22:27:41,369 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,369 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-17 22:27:41,371 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,383 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,393 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-17 22:27:41,395 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,406 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,406 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,406 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-17 22:27:41,410 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:41,410 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, |v_#valid_25|]. (and (not (= main_~a~0.base main_~p~0.base)) (= (store |v_#memory_int_27| main_~p~0.base (store (select |v_#memory_int_27| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= (select |v_#valid_25| main_~t~0.base) 0) (= 1 (select |v_#valid_25| main_~a~0.base)) (= 1 (select |v_#valid_25| main_~p~0.base)) (= 0 main_~a~0.offset) (= 2 (select (select |v_#memory_int_27| main_~a~0.base) main_~a~0.offset))) [2020-07-17 22:27:41,410 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~p~0.base))) [2020-07-17 22:27:41,501 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-17 22:27:41,501 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-17 22:27:41,559 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-17 22:27:41,559 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-07-17 22:27:41,562 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,574 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,580 INFO L544 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. [2020-07-17 22:27:41,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-17 22:27:41,724 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-07-17 22:27:41,728 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,741 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,784 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-17 22:27:41,785 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-17 22:27:41,789 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:41,790 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, v_main_~p~0.base_32, v_main_~p~0.offset_32, v_main_~p~0.base_31, v_main_~p~0.offset_31]. (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (store |v_#memory_int_29| v_main_~p~0.base_32 (store (select |v_#memory_int_29| v_main_~p~0.base_32) v_main_~p~0.offset_32 3)) |#memory_int|) (= 2 (select (select |v_#memory_int_29| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (= 2 (select (select |v_#memory_int_29| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31))) [2020-07-17 22:27:41,790 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_32, v_main_~p~0.offset_32, v_main_~p~0.base_31, v_main_~p~0.offset_31]. (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31))) [2020-07-17 22:27:41,918 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-07-17 22:27:41,922 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,928 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:41,931 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:41,932 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-17 22:27:41,933 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:41,934 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_32, v_main_~p~0.offset_32, v_main_~p~0.base_31, main_~p~0.base, v_main_~p~0.offset_31]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (= 2 .cse0) (= |main_#t~mem9| .cse0) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31)))) [2020-07-17 22:27:41,934 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-17 22:27:41,956 INFO L263 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2020-07-17 22:27:41,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {2509#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2509#true} is VALID [2020-07-17 22:27:41,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-17 22:27:41,956 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-17 22:27:41,956 INFO L263 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret14 := main(); {2509#true} is VALID [2020-07-17 22:27:41,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {2509#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:41,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:41,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:41,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:41,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:41,960 INFO L280 TraceCheckUtils]: 10: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:41,961 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2561#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:41,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {2561#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2561#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:41,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {2561#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2568#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:41,964 INFO L280 TraceCheckUtils]: 14: Hoare triple {2568#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2568#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:41,965 INFO L280 TraceCheckUtils]: 15: Hoare triple {2568#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2575#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:41,966 INFO L280 TraceCheckUtils]: 16: Hoare triple {2575#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2575#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:41,971 INFO L280 TraceCheckUtils]: 17: Hoare triple {2575#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2582#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:41,978 INFO L280 TraceCheckUtils]: 18: Hoare triple {2582#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2582#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:41,979 INFO L280 TraceCheckUtils]: 19: Hoare triple {2582#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2582#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:41,982 INFO L280 TraceCheckUtils]: 20: Hoare triple {2582#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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; {2592#(and (exists ((v_main_~p~0.base_32 Int) (v_main_~p~0.base_31 Int) (v_main_~p~0.offset_32 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31)))) (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset))} is VALID [2020-07-17 22:27:41,983 INFO L280 TraceCheckUtils]: 21: Hoare triple {2592#(and (exists ((v_main_~p~0.base_32 Int) (v_main_~p~0.base_31 Int) (v_main_~p~0.offset_32 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31)))) (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2596#(= 2 |main_#t~mem9|)} is VALID [2020-07-17 22:27:41,983 INFO L280 TraceCheckUtils]: 22: Hoare triple {2596#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {2510#false} is VALID [2020-07-17 22:27:41,983 INFO L280 TraceCheckUtils]: 23: Hoare triple {2510#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2510#false} is VALID [2020-07-17 22:27:41,983 INFO L280 TraceCheckUtils]: 24: Hoare triple {2510#false} assume !(1 == #t~mem11);havoc #t~mem11; {2510#false} is VALID [2020-07-17 22:27:41,984 INFO L280 TraceCheckUtils]: 25: Hoare triple {2510#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2510#false} is VALID [2020-07-17 22:27:41,984 INFO L280 TraceCheckUtils]: 26: Hoare triple {2510#false} assume 3 != #t~mem13;havoc #t~mem13; {2510#false} is VALID [2020-07-17 22:27:41,984 INFO L280 TraceCheckUtils]: 27: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2020-07-17 22:27:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:41,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:41,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-17 22:27:41,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654249803] [2020-07-17 22:27:41,988 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-17 22:27:41,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:41,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:27:42,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:42,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:27:42,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:27:42,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:27:42,055 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 19 states. [2020-07-17 22:27:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:43,879 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-17 22:27:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 22:27:43,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-17 22:27:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:27:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2020-07-17 22:27:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:27:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2020-07-17 22:27:43,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2020-07-17 22:27:44,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:44,022 INFO L225 Difference]: With dead ends: 73 [2020-07-17 22:27:44,024 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 22:27:44,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2020-07-17 22:27:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 22:27:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-07-17 22:27:44,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:44,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 55 states. [2020-07-17 22:27:44,059 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 55 states. [2020-07-17 22:27:44,059 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 55 states. [2020-07-17 22:27:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:44,065 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2020-07-17 22:27:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2020-07-17 22:27:44,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:44,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:44,066 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 65 states. [2020-07-17 22:27:44,066 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 65 states. [2020-07-17 22:27:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:44,069 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2020-07-17 22:27:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2020-07-17 22:27:44,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:44,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:44,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:44,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:27:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-07-17 22:27:44,072 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 28 [2020-07-17 22:27:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:44,072 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-07-17 22:27:44,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:27:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-07-17 22:27:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:27:44,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:44,076 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:44,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:44,289 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash 150272518, now seen corresponding path program 1 times [2020-07-17 22:27:44,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:44,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155458456] [2020-07-17 22:27:44,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:44,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {2932#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2917#true} is VALID [2020-07-17 22:27:44,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {2917#true} assume true; {2917#true} is VALID [2020-07-17 22:27:44,566 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2917#true} {2917#true} #115#return; {2917#true} is VALID [2020-07-17 22:27:44,567 INFO L263 TraceCheckUtils]: 0: Hoare triple {2917#true} call ULTIMATE.init(); {2932#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:44,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {2932#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2917#true} is VALID [2020-07-17 22:27:44,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {2917#true} assume true; {2917#true} is VALID [2020-07-17 22:27:44,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2917#true} {2917#true} #115#return; {2917#true} is VALID [2020-07-17 22:27:44,568 INFO L263 TraceCheckUtils]: 4: Hoare triple {2917#true} call #t~ret14 := main(); {2917#true} is VALID [2020-07-17 22:27:44,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {2917#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:44,569 INFO L280 TraceCheckUtils]: 6: Hoare triple {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:44,570 INFO L280 TraceCheckUtils]: 7: Hoare triple {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:44,571 INFO L280 TraceCheckUtils]: 8: Hoare triple {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:44,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {2924#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:44,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {2924#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2924#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:44,574 INFO L280 TraceCheckUtils]: 11: Hoare triple {2924#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:44,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:44,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:44,576 INFO L280 TraceCheckUtils]: 14: Hoare triple {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:44,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {2925#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2926#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} is VALID [2020-07-17 22:27:44,578 INFO L280 TraceCheckUtils]: 16: Hoare triple {2926#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2926#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} is VALID [2020-07-17 22:27:44,579 INFO L280 TraceCheckUtils]: 17: Hoare triple {2926#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2927#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:44,580 INFO L280 TraceCheckUtils]: 18: Hoare triple {2927#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2927#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:44,580 INFO L280 TraceCheckUtils]: 19: Hoare triple {2927#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2927#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:44,581 INFO L280 TraceCheckUtils]: 20: Hoare triple {2927#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~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; {2928#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-17 22:27:44,582 INFO L280 TraceCheckUtils]: 21: Hoare triple {2928#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2928#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-17 22:27:44,582 INFO L280 TraceCheckUtils]: 22: Hoare triple {2928#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !(2 == #t~mem9);havoc #t~mem9; {2928#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-17 22:27:44,582 INFO L280 TraceCheckUtils]: 23: Hoare triple {2928#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2929#(or (= |main_#t~mem11| 1) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-17 22:27:44,583 INFO L280 TraceCheckUtils]: 24: Hoare triple {2929#(or (= |main_#t~mem11| 1) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !(1 == #t~mem11);havoc #t~mem11; {2930#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:44,583 INFO L280 TraceCheckUtils]: 25: Hoare triple {2930#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2931#(= |main_#t~mem13| 3)} is VALID [2020-07-17 22:27:44,584 INFO L280 TraceCheckUtils]: 26: Hoare triple {2931#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {2918#false} is VALID [2020-07-17 22:27:44,584 INFO L280 TraceCheckUtils]: 27: Hoare triple {2918#false} assume !false; {2918#false} is VALID [2020-07-17 22:27:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:44,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155458456] [2020-07-17 22:27:44,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585159248] [2020-07-17 22:27:44,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:44,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-17 22:27:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:44,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:44,694 INFO L384 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 [2020-07-17 22:27:44,695 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,699 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:44,700 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,700 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 22:27:44,702 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:44,702 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_26|]. (and (= |#valid| (store |v_#valid_26| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:44,702 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-17 22:27:44,755 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:44,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-17 22:27:44,760 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,795 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-17 22:27:44,803 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2020-07-17 22:27:44,803 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,816 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:44,817 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,817 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-17 22:27:44,822 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:44,822 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|, |v_#valid_27|]. (and (= 1 (select |v_#valid_27| main_~p~0.base)) (= (store |v_#valid_27| main_~t~0.base 1) |#valid|) (= |#memory_int| (store |v_#memory_int_30| main_~p~0.base (store (select |v_#memory_int_30| main_~p~0.base) main_~p~0.offset 1))) (= main_~a~0.base main_~p~0.base) (= 0 (select |v_#valid_27| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:44,822 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:44,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:27:44,898 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 22:27:44,899 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,908 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:44,908 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,908 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-17 22:27:44,984 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:44,984 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-17 22:27:44,986 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:44,998 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:45,005 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-17 22:27:45,007 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:45,017 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:45,018 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:45,018 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-17 22:27:45,022 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:45,022 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, |v_#valid_28|]. (and (not (= main_~a~0.base main_~p~0.base)) (= (store |v_#memory_int_32| main_~p~0.base (store (select |v_#memory_int_32| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= 0 (select |v_#valid_28| main_~t~0.base)) (= 1 (select (select |v_#memory_int_32| main_~a~0.base) main_~a~0.offset)) (= 1 (select |v_#valid_28| main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select |v_#valid_28| main_~a~0.base))) [2020-07-17 22:27:45,022 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base))) [2020-07-17 22:27:45,091 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-17 22:27:45,091 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-17 22:27:45,138 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-17 22:27:45,139 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-07-17 22:27:45,143 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:45,155 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:45,160 INFO L544 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. [2020-07-17 22:27:45,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-17 22:27:45,311 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-07-17 22:27:45,319 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:45,332 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:45,350 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-17 22:27:45,350 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-17 22:27:45,355 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:45,355 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, v_main_~p~0.base_35, v_main_~p~0.offset_35, v_main_~p~0.base_34, v_main_~p~0.offset_34]. (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 1 (select (select |v_#memory_int_34| main_~p~0.base) 0)) (= |#memory_int| (store |v_#memory_int_34| v_main_~p~0.base_35 (store (select |v_#memory_int_34| v_main_~p~0.base_35) v_main_~p~0.offset_35 3))) (= 0 main_~p~0.offset) (= (select (select |v_#memory_int_34| v_main_~p~0.base_34) v_main_~p~0.offset_34) 2) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34))) [2020-07-17 22:27:45,356 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_35, v_main_~p~0.offset_35, v_main_~p~0.base_34, v_main_~p~0.offset_34]. (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34))) [2020-07-17 22:27:45,612 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-07-17 22:27:45,614 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:45,624 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:45,627 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:45,628 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-17 22:27:45,630 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:45,630 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_35, v_main_~p~0.offset_35, v_main_~p~0.base_34, main_~p~0.base, v_main_~p~0.offset_34]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (= |main_#t~mem11| .cse0) (= 1 .cse0) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) [2020-07-17 22:27:45,631 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| 1) [2020-07-17 22:27:45,649 INFO L263 TraceCheckUtils]: 0: Hoare triple {2917#true} call ULTIMATE.init(); {2917#true} is VALID [2020-07-17 22:27:45,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {2917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2917#true} is VALID [2020-07-17 22:27:45,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {2917#true} assume true; {2917#true} is VALID [2020-07-17 22:27:45,650 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2917#true} {2917#true} #115#return; {2917#true} is VALID [2020-07-17 22:27:45,650 INFO L263 TraceCheckUtils]: 4: Hoare triple {2917#true} call #t~ret14 := main(); {2917#true} is VALID [2020-07-17 22:27:45,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {2917#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:45,652 INFO L280 TraceCheckUtils]: 6: Hoare triple {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:45,653 INFO L280 TraceCheckUtils]: 7: Hoare triple {2922#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:45,654 INFO L280 TraceCheckUtils]: 8: Hoare triple {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:45,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {2923#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {2963#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:45,657 INFO L280 TraceCheckUtils]: 10: Hoare triple {2963#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2963#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:45,659 INFO L280 TraceCheckUtils]: 11: Hoare triple {2963#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:45,660 INFO L280 TraceCheckUtils]: 12: Hoare triple {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:45,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:45,661 INFO L280 TraceCheckUtils]: 14: Hoare triple {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:45,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {2970#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2983#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:45,664 INFO L280 TraceCheckUtils]: 16: Hoare triple {2983#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2983#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:45,667 INFO L280 TraceCheckUtils]: 17: Hoare triple {2983#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2990#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} is VALID [2020-07-17 22:27:45,668 INFO L280 TraceCheckUtils]: 18: Hoare triple {2990#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2990#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} is VALID [2020-07-17 22:27:45,669 INFO L280 TraceCheckUtils]: 19: Hoare triple {2990#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2990#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} is VALID [2020-07-17 22:27:45,674 INFO L280 TraceCheckUtils]: 20: Hoare triple {2990#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 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; {3000#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-17 22:27:45,676 INFO L280 TraceCheckUtils]: 21: Hoare triple {3000#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3000#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-17 22:27:45,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {3000#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} assume !(2 == #t~mem9);havoc #t~mem9; {3000#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-17 22:27:45,678 INFO L280 TraceCheckUtils]: 23: Hoare triple {3000#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {3010#(= |main_#t~mem11| 1)} is VALID [2020-07-17 22:27:45,679 INFO L280 TraceCheckUtils]: 24: Hoare triple {3010#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {2918#false} is VALID [2020-07-17 22:27:45,679 INFO L280 TraceCheckUtils]: 25: Hoare triple {2918#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2918#false} is VALID [2020-07-17 22:27:45,679 INFO L280 TraceCheckUtils]: 26: Hoare triple {2918#false} assume 3 != #t~mem13;havoc #t~mem13; {2918#false} is VALID [2020-07-17 22:27:45,679 INFO L280 TraceCheckUtils]: 27: Hoare triple {2918#false} assume !false; {2918#false} is VALID [2020-07-17 22:27:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:45,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:45,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-17 22:27:45,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59697723] [2020-07-17 22:27:45,689 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-17 22:27:45,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:45,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:27:45,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:45,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:27:45,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:27:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:27:45,767 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 19 states. [2020-07-17 22:27:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:47,830 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2020-07-17 22:27:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 22:27:47,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-17 22:27:47,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:27:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2020-07-17 22:27:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:27:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2020-07-17 22:27:47,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2020-07-17 22:27:47,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:47,992 INFO L225 Difference]: With dead ends: 93 [2020-07-17 22:27:47,993 INFO L226 Difference]: Without dead ends: 87 [2020-07-17 22:27:47,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2020-07-17 22:27:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-17 22:27:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2020-07-17 22:27:48,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:48,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 63 states. [2020-07-17 22:27:48,025 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 63 states. [2020-07-17 22:27:48,025 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 63 states. [2020-07-17 22:27:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:48,028 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-07-17 22:27:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2020-07-17 22:27:48,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:48,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:48,029 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 87 states. [2020-07-17 22:27:48,029 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 87 states. [2020-07-17 22:27:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:48,031 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-07-17 22:27:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2020-07-17 22:27:48,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:48,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:48,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:48,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-17 22:27:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2020-07-17 22:27:48,034 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 28 [2020-07-17 22:27:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:48,034 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2020-07-17 22:27:48,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:27:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-17 22:27:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:27:48,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:48,035 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:48,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:48,248 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash -794385695, now seen corresponding path program 3 times [2020-07-17 22:27:48,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:48,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774188759] [2020-07-17 22:27:48,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:48,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {3416#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3401#true} is VALID [2020-07-17 22:27:48,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {3401#true} assume true; {3401#true} is VALID [2020-07-17 22:27:48,684 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3401#true} {3401#true} #115#return; {3401#true} is VALID [2020-07-17 22:27:48,685 INFO L263 TraceCheckUtils]: 0: Hoare triple {3401#true} call ULTIMATE.init(); {3416#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:27:48,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {3416#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3401#true} is VALID [2020-07-17 22:27:48,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2020-07-17 22:27:48,685 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3401#true} #115#return; {3401#true} is VALID [2020-07-17 22:27:48,685 INFO L263 TraceCheckUtils]: 4: Hoare triple {3401#true} call #t~ret14 := main(); {3401#true} is VALID [2020-07-17 22:27:48,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {3401#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3406#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:48,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {3406#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3406#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:48,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {3406#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:48,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:48,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:48,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-17 22:27:48,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {3407#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3408#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:48,693 INFO L280 TraceCheckUtils]: 12: Hoare triple {3408#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3408#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:48,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {3408#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3409#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:48,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {3409#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3409#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-17 22:27:48,699 INFO L280 TraceCheckUtils]: 15: Hoare triple {3409#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3410#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:48,701 INFO L280 TraceCheckUtils]: 16: Hoare triple {3410#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3410#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:48,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {3410#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3411#(and (or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:48,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {3411#(and (or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3411#(and (or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:48,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {3411#(and (or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {3411#(and (or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:27:48,708 INFO L280 TraceCheckUtils]: 20: Hoare triple {3411#(and (or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 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; {3412#(or (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-17 22:27:48,709 INFO L280 TraceCheckUtils]: 21: Hoare triple {3412#(or (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3413#(or (= 3 |main_#t~mem9|) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-17 22:27:48,709 INFO L280 TraceCheckUtils]: 22: Hoare triple {3413#(or (= 3 |main_#t~mem9|) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {3414#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:27:48,711 INFO L280 TraceCheckUtils]: 23: Hoare triple {3414#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3415#(= 2 |main_#t~mem9|)} is VALID [2020-07-17 22:27:48,713 INFO L280 TraceCheckUtils]: 24: Hoare triple {3415#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {3402#false} is VALID [2020-07-17 22:27:48,713 INFO L280 TraceCheckUtils]: 25: Hoare triple {3402#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {3402#false} is VALID [2020-07-17 22:27:48,713 INFO L280 TraceCheckUtils]: 26: Hoare triple {3402#false} assume !(1 == #t~mem11);havoc #t~mem11; {3402#false} is VALID [2020-07-17 22:27:48,713 INFO L280 TraceCheckUtils]: 27: Hoare triple {3402#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {3402#false} is VALID [2020-07-17 22:27:48,713 INFO L280 TraceCheckUtils]: 28: Hoare triple {3402#false} assume 3 != #t~mem13;havoc #t~mem13; {3402#false} is VALID [2020-07-17 22:27:48,714 INFO L280 TraceCheckUtils]: 29: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2020-07-17 22:27:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:48,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774188759] [2020-07-17 22:27:48,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375809773] [2020-07-17 22:27:48,718 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:27:48,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:27:48,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:27:48,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2020-07-17 22:27:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:48,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:27:48,882 INFO L384 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 [2020-07-17 22:27:48,883 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:48,885 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:48,885 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:48,885 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-17 22:27:48,887 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:48,888 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_29|]. (= |#valid| (store |v_#valid_29| main_~a~0.base 1)) [2020-07-17 22:27:48,888 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-17 22:27:48,975 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:48,975 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-17 22:27:48,978 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:27:48,981 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,010 INFO L624 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2020-07-17 22:27:49,010 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,011 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2020-07-17 22:27:49,014 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:49,015 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_30|]. (and (= |#valid| (store |v_#valid_30| main_~t~0.base 1)) (= main_~a~0.base main_~p~0.base) (= 1 (select |v_#valid_30| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset) (<= (select |v_#valid_30| main_~t~0.base) 0)) [2020-07-17 22:27:49,015 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-17 22:27:49,081 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2020-07-17 22:27:49,081 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,096 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,104 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2020-07-17 22:27:49,105 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,121 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,123 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,123 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2020-07-17 22:27:49,128 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:49,128 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_21|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_27|]. (let ((.cse0 (+ main_~a~0.offset 4))) (and (= 1 (select |#valid| main_~t~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_21| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_21| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_27| main_~a~0.base (store (select |v_#memory_$Pointer$.base_27| main_~a~0.base) .cse0 main_~t~0.base))) (= 1 (select |#valid| main_~a~0.base)))) [2020-07-17 22:27:49,128 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (+ main_~a~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~p~0.base .cse0) (= 1 (select |#valid| .cse0)) (not (= main_~a~0.base .cse0)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1)) (= 1 (select |#valid| main_~a~0.base))))) [2020-07-17 22:27:49,213 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,213 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2020-07-17 22:27:49,216 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:27:49,218 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:27:49,220 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,239 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,240 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_22|]} [2020-07-17 22:27:49,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2020-07-17 22:27:49,248 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,269 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,301 INFO L350 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-07-17 22:27:49,302 INFO L384 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 1 case distinctions, treesize of input 45 treesize of output 31 [2020-07-17 22:27:49,306 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,344 INFO L624 ElimStorePlain]: treesize reduction 10, result has 84.1 percent of original size [2020-07-17 22:27:49,355 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-17 22:27:49,356 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,373 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,374 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,374 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:38 [2020-07-17 22:27:49,427 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:49,427 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_28|, |v_#valid_31|, |v_#memory_$Pointer$.offset_22|, |v_#memory_int_35|]. (let ((.cse1 (+ main_~a~0.offset 4))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_28| main_~a~0.base) .cse1))) (and (= .cse0 main_~p~0.base) (<= (select |v_#valid_31| main_~t~0.base) 0) (= 1 (select |v_#valid_31| .cse0)) (= main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_22| main_~a~0.base) .cse1)) (not (= main_~a~0.base .cse0)) (= 1 (select |v_#valid_31| main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_22| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_22| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|) (= |#memory_int| (store |v_#memory_int_35| main_~p~0.base (store (select |v_#memory_int_35| main_~p~0.base) main_~p~0.offset 2))) (= (store |v_#memory_$Pointer$.base_28| main_~p~0.base (store (select |v_#memory_$Pointer$.base_28| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.base|)))) [2020-07-17 22:27:49,427 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (+ main_~a~0.offset 4))) (and (not (= main_~t~0.base main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))) [2020-07-17 22:27:49,539 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,539 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 160 [2020-07-17 22:27:49,553 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-17 22:27:49,553 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:27:49,557 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,613 INFO L624 ElimStorePlain]: treesize reduction 34, result has 83.0 percent of original size [2020-07-17 22:27:49,628 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 108 [2020-07-17 22:27:49,634 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,657 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:27:49,668 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2020-07-17 22:27:49,670 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,705 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,708 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,709 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:176, output treesize:101 [2020-07-17 22:27:49,716 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:49,717 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_29|, |v_#memory_$Pointer$.offset_23|, main_~t~0.base, main_~t~0.offset, |v_#memory_int_36|]. (let ((.cse4 (+ main_~a~0.offset 4))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_23| main_~a~0.base) .cse4)) (.cse0 (select (select |v_#memory_$Pointer$.base_29| main_~a~0.base) .cse4))) (let ((.cse2 (select |v_#memory_int_36| .cse0)) (.cse1 (+ .cse3 4))) (and (not (= main_~t~0.base main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) main_~p~0.base) (= (store |v_#memory_$Pointer$.offset_23| .cse0 (store (select |v_#memory_$Pointer$.offset_23| .cse0) .cse1 main_~t~0.offset)) |#memory_$Pointer$.offset|) (not (= main_~t~0.base .cse0)) (not (= .cse0 main_~a~0.base)) (= |#memory_int| (store |v_#memory_int_36| .cse0 (store .cse2 .cse1 (select (select |#memory_int| .cse0) .cse1)))) (= 2 (select .cse2 .cse3)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_29| .cse0 (store (select |v_#memory_$Pointer$.base_29| .cse0) .cse1 main_~t~0.base))))))) [2020-07-17 22:27:49,717 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (+ main_~a~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse3))) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse0) (+ .cse1 4)))) (and (not (= main_~a~0.base .cse0)) (= 2 (select (select |#memory_int| .cse0) .cse1)) (not (= .cse0 .cse2)) (= main_~p~0.base .cse2) (not (= main_~a~0.base .cse2)))))) [2020-07-17 22:27:49,800 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|, |v_#memory_$Pointer$.offset_24|], 6=[|v_#memory_$Pointer$.base_30|]} [2020-07-17 22:27:49,808 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 48 [2020-07-17 22:27:49,810 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,832 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,855 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,856 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 215 [2020-07-17 22:27:49,859 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:49,863 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:49,898 INFO L624 ElimStorePlain]: treesize reduction 60, result has 74.4 percent of original size [2020-07-17 22:27:49,954 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:49,954 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 182 [2020-07-17 22:27:49,973 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:49,982 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:49,994 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,000 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,014 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,018 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,028 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-17 22:27:50,037 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,046 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,056 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,063 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,076 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,080 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,099 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,110 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,120 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,134 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,152 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,155 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,170 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,179 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,189 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,196 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,212 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,215 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,242 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,256 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,263 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,277 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,286 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,304 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,313 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,323 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,330 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,343 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,354 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-17 22:27:50,363 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,379 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,389 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,395 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,410 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,414 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,429 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,438 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,449 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,457 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,471 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,475 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,495 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,507 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,518 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,526 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,543 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,547 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,565 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:27:50,578 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,589 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-17 22:27:50,598 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:27:50,614 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:27:50,618 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:27:50,624 INFO L544 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 22:27:50,677 INFO L624 ElimStorePlain]: treesize reduction 108, result has 34.5 percent of original size [2020-07-17 22:27:50,682 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:27:50,683 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:265, output treesize:105 [2020-07-17 22:27:50,695 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:50,695 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_24|, |v_#memory_int_37|, v_main_~p~0.offset_38]. (let ((.cse3 (+ main_~p~0.offset 4))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_30| main_~p~0.base) .cse3)) (.cse1 (select (select |v_#memory_$Pointer$.offset_24| main_~p~0.base) .cse3))) (let ((.cse2 (select (select |v_#memory_$Pointer$.base_30| .cse0) (+ .cse1 4)))) (and (= 2 (select (select |v_#memory_int_37| .cse0) .cse1)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_30| .cse2 (store (select |v_#memory_$Pointer$.base_30| .cse2) v_main_~p~0.offset_38 (select (select |#memory_$Pointer$.base| .cse2) v_main_~p~0.offset_38)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_24| .cse2 (store (select |v_#memory_$Pointer$.offset_24| .cse2) v_main_~p~0.offset_38 (select (select |#memory_$Pointer$.offset| .cse2) v_main_~p~0.offset_38)))) (not (= .cse0 .cse2)) (not (= main_~p~0.base .cse2)) (= |#memory_int| (store |v_#memory_int_37| .cse2 (store (select |v_#memory_int_37| .cse2) v_main_~p~0.offset_38 3))) (not (= .cse0 main_~p~0.base)))))) [2020-07-17 22:27:50,695 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.offset_38]. (let ((.cse3 (+ main_~p~0.offset 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse3)) (.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse3))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) (+ .cse2 4)))) (and (= 3 (select (select |#memory_int| .cse0) v_main_~p~0.offset_38)) (not (= .cse1 main_~p~0.base)) (not (= .cse1 .cse0)) (= 2 (select (select |#memory_int| .cse1) .cse2)) (not (= .cse0 main_~p~0.base)))))) [2020-07-17 22:27:50,786 INFO L440 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-07-17 22:27:50,790 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 74 [2020-07-17 22:27:50,793 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:50,807 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:50,820 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:50,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 49 [2020-07-17 22:27:50,825 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-17 22:27:50,833 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-17 22:27:50,837 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:27:50,862 INFO L624 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2020-07-17 22:27:50,868 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 22:27:50,869 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:123, output treesize:19 [2020-07-17 22:27:50,874 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:50,874 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_39, v_main_~p~0.offset_39, |#memory_$Pointer$.offset|, v_main_~p~0.offset_38]. (let ((.cse3 (+ v_main_~p~0.offset_39 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) .cse3)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) .cse3))) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse1) (+ .cse0 4)))) (and (= main_~p~0.offset .cse0) (not (= v_main_~p~0.base_39 .cse1)) (= 3 (select (select |#memory_int| .cse2) v_main_~p~0.offset_38)) (= .cse1 main_~p~0.base) (not (= v_main_~p~0.base_39 .cse2)) (= 2 (select (select |#memory_int| .cse1) .cse0)) (not (= .cse1 .cse2)))))) [2020-07-17 22:27:50,875 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_77, v_main_~p~0.offset_38]. (and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38))) [2020-07-17 22:27:50,941 INFO L384 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 10 [2020-07-17 22:27:50,943 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:27:50,947 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:27:50,948 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:27:50,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-17 22:27:50,950 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:27:50,951 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_arrayElimCell_77, v_main_~p~0.offset_38]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= 2 .cse0) (= |main_#t~mem9| .cse0) (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38)))) [2020-07-17 22:27:50,951 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-17 22:27:50,957 INFO L263 TraceCheckUtils]: 0: Hoare triple {3401#true} call ULTIMATE.init(); {3401#true} is VALID [2020-07-17 22:27:50,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {3401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3401#true} is VALID [2020-07-17 22:27:50,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2020-07-17 22:27:50,957 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3401#true} #115#return; {3401#true} is VALID [2020-07-17 22:27:50,958 INFO L263 TraceCheckUtils]: 4: Hoare triple {3401#true} call #t~ret14 := main(); {3401#true} is VALID [2020-07-17 22:27:50,959 INFO L280 TraceCheckUtils]: 5: Hoare triple {3401#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3435#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-17 22:27:50,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {3435#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3435#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-17 22:27:50,960 INFO L280 TraceCheckUtils]: 7: Hoare triple {3435#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:50,961 INFO L280 TraceCheckUtils]: 8: Hoare triple {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:50,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:50,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:50,964 INFO L280 TraceCheckUtils]: 11: Hoare triple {3442#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3455#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:50,965 INFO L280 TraceCheckUtils]: 12: Hoare triple {3455#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3455#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:27:50,966 INFO L280 TraceCheckUtils]: 13: Hoare triple {3455#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3462#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| main_~a~0.base)))} is VALID [2020-07-17 22:27:50,967 INFO L280 TraceCheckUtils]: 14: Hoare triple {3462#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| main_~a~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3462#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| main_~a~0.base)))} is VALID [2020-07-17 22:27:50,969 INFO L280 TraceCheckUtils]: 15: Hoare triple {3462#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| main_~a~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3469#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:50,970 INFO L280 TraceCheckUtils]: 16: Hoare triple {3469#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3469#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-17 22:27:50,972 INFO L280 TraceCheckUtils]: 17: Hoare triple {3469#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3476#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} is VALID [2020-07-17 22:27:50,973 INFO L280 TraceCheckUtils]: 18: Hoare triple {3476#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3476#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} is VALID [2020-07-17 22:27:50,974 INFO L280 TraceCheckUtils]: 19: Hoare triple {3476#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} assume !(0 != #t~nondet6);havoc #t~nondet6; {3476#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} is VALID [2020-07-17 22:27:50,976 INFO L280 TraceCheckUtils]: 20: Hoare triple {3476#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3486#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4))) v_main_~p~0.offset_38))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)) main_~p~0.base)))} is VALID [2020-07-17 22:27:50,977 INFO L280 TraceCheckUtils]: 21: Hoare triple {3486#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4))) v_main_~p~0.offset_38))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)) main_~p~0.base)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3486#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4))) v_main_~p~0.offset_38))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)) main_~p~0.base)))} is VALID [2020-07-17 22:27:50,979 INFO L280 TraceCheckUtils]: 22: Hoare triple {3486#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4))) v_main_~p~0.offset_38))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 4)) main_~p~0.base)))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {3493#(and (exists ((v_main_~p~0.offset_38 Int) (v_arrayElimCell_77 Int)) (and (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-17 22:27:50,979 INFO L280 TraceCheckUtils]: 23: Hoare triple {3493#(and (exists ((v_main_~p~0.offset_38 Int) (v_arrayElimCell_77 Int)) (and (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3415#(= 2 |main_#t~mem9|)} is VALID [2020-07-17 22:27:50,980 INFO L280 TraceCheckUtils]: 24: Hoare triple {3415#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {3402#false} is VALID [2020-07-17 22:27:50,980 INFO L280 TraceCheckUtils]: 25: Hoare triple {3402#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {3402#false} is VALID [2020-07-17 22:27:50,980 INFO L280 TraceCheckUtils]: 26: Hoare triple {3402#false} assume !(1 == #t~mem11);havoc #t~mem11; {3402#false} is VALID [2020-07-17 22:27:50,980 INFO L280 TraceCheckUtils]: 27: Hoare triple {3402#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {3402#false} is VALID [2020-07-17 22:27:50,980 INFO L280 TraceCheckUtils]: 28: Hoare triple {3402#false} assume 3 != #t~mem13;havoc #t~mem13; {3402#false} is VALID [2020-07-17 22:27:50,980 INFO L280 TraceCheckUtils]: 29: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2020-07-17 22:27:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:50,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:27:50,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2020-07-17 22:27:50,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043709730] [2020-07-17 22:27:50,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2020-07-17 22:27:50,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:50,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-17 22:27:51,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:51,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 22:27:51,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:51,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 22:27:51,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:27:51,067 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 21 states. [2020-07-17 22:27:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:53,808 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-07-17 22:27:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:27:53,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2020-07-17 22:27:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:27:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2020-07-17 22:27:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:27:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2020-07-17 22:27:53,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 81 transitions. [2020-07-17 22:27:53,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:53,961 INFO L225 Difference]: With dead ends: 90 [2020-07-17 22:27:53,961 INFO L226 Difference]: Without dead ends: 84 [2020-07-17 22:27:53,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2020-07-17 22:27:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-17 22:27:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2020-07-17 22:27:54,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:54,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 68 states. [2020-07-17 22:27:54,024 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 68 states. [2020-07-17 22:27:54,024 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 68 states. [2020-07-17 22:27:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:54,026 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-17 22:27:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-17 22:27:54,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:54,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:54,027 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 84 states. [2020-07-17 22:27:54,027 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 84 states. [2020-07-17 22:27:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:54,030 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-17 22:27:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-17 22:27:54,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:54,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:54,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:54,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-17 22:27:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2020-07-17 22:27:54,032 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 30 [2020-07-17 22:27:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:54,033 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2020-07-17 22:27:54,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 22:27:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2020-07-17 22:27:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:27:54,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:54,034 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:54,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-17 22:27:54,248 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1568321631, now seen corresponding path program 1 times [2020-07-17 22:27:54,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:54,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214627455] [2020-07-17 22:27:54,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:27:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:27:54,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:27:54,320 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:27:54,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-17 22:27:54,363 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-17 22:27:54,364 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: L522-3 has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: L525-3 has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: L525-3 has no Hoare annotation [2020-07-17 22:27:54,365 WARN L170 areAnnotationChecker]: L532-2 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L532-2 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L525-1 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L525-1 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L532-3 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L541-3 has no Hoare annotation [2020-07-17 22:27:54,366 WARN L170 areAnnotationChecker]: L541-3 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L528-1 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L528-1 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L528-3 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L543-2 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L543-2 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-17 22:27:54,367 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L535-3 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L543-3 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-17 22:27:54,368 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-17 22:27:54,369 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-17 22:27:54,369 WARN L170 areAnnotationChecker]: L545-2 has no Hoare annotation [2020-07-17 22:27:54,369 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:27:54,369 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:27:54,370 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:27:54,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:27:54 BoogieIcfgContainer [2020-07-17 22:27:54,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:27:54,375 INFO L168 Benchmark]: Toolchain (without parser) took 29772.40 ms. Allocated memory was 144.7 MB in the beginning and 454.6 MB in the end (delta: 309.9 MB). Free memory was 101.5 MB in the beginning and 402.6 MB in the end (delta: -301.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:54,376 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:27:54,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.20 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 101.1 MB in the beginning and 169.1 MB in the end (delta: -68.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:54,376 INFO L168 Benchmark]: Boogie Preprocessor took 84.04 ms. Allocated memory is still 203.4 MB. Free memory was 169.1 MB in the beginning and 165.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:54,377 INFO L168 Benchmark]: RCFGBuilder took 725.34 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 110.3 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:54,377 INFO L168 Benchmark]: TraceAbstraction took 28227.65 ms. Allocated memory was 203.4 MB in the beginning and 454.6 MB in the end (delta: 251.1 MB). Free memory was 109.6 MB in the beginning and 402.6 MB in the end (delta: -293.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:27:54,379 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 728.20 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 101.1 MB in the beginning and 169.1 MB in the end (delta: -68.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.04 ms. Allocated memory is still 203.4 MB. Free memory was 169.1 MB in the beginning and 165.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 725.34 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 110.3 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28227.65 ms. Allocated memory was 203.4 MB in the beginning and 454.6 MB in the end (delta: 251.1 MB). Free memory was 109.6 MB in the beginning and 402.6 MB in the end (delta: -293.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND TRUE __VERIFIER_nondet_int() [L526] p->h = 1 [L527] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L528] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L529] p->n = t [L530] EXPR p->n [L530] p = p->n [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND TRUE __VERIFIER_nondet_int() [L533] p->h = 2 [L534] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, t={-3:0}] [L535] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, t={-3:0}] [L536] p->n = t [L537] EXPR p->n [L537] p = p->n [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 [L540] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-1:0}, t={-3:0}] [L541] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-1:0}, p->h=1, t={-3:0}] [L541] COND FALSE !(p->h == 2) [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-1:0}, p->h=1, t={-3:0}] [L543] COND TRUE p->h == 1 [L544] EXPR p->n [L544] p = p->n [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, p->h=2, t={-3:0}] [L543] COND FALSE !(p->h == 1) [L545] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, p->h=2, t={-3:0}] [L545] COND TRUE p->h != 3 [L546] __VERIFIER_error() VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.1s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 250 SDtfs, 592 SDslu, 1460 SDs, 0 SdLazy, 2434 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 201 SyntacticMatches, 8 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 151 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 492 ConstructedInterpolants, 17 QuantifiedInterpolants, 141009 SizeOfPredicates, 110 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 291 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 16/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...