/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-8fc6572 [2020-07-10 15:04:51,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:04:51,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:04:51,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:04:51,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:04:51,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:04:51,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:04:51,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:04:51,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:04:51,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:04:51,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:04:51,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:04:51,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:04:51,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:04:51,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:04:51,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:04:51,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:04:51,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:04:51,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:04:51,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:04:51,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:04:51,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:04:51,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:04:51,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:04:51,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:04:51,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:04:51,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:04:51,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:04:51,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:04:51,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:04:51,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:04:51,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:04:51,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:04:51,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:04:51,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:04:51,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:04:51,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:04:51,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:04:51,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:04:51,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:04:51,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:04:51,514 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-10 15:04:51,558 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:04:51,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:04:51,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:04:51,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:04:51,560 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:04:51,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:04:51,563 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:04:51,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:04:51,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:04:51,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:04:51,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:04:51,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:04:51,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:04:51,564 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:04:51,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:04:51,566 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:04:51,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:04:51,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:04:51,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:04:51,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:04:51,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:04:51,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:04:51,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:04:51,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:04:51,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:04:51,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:04:51,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:04:51,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:04:51,568 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:04:51,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:04:51,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:04:51,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:04:51,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:04:51,942 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:04:51,943 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:04:51,944 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-10 15:04:52,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beed58d9c/bfd6c79671114f21b9440aee0bf26569/FLAG419c584a7 [2020-07-10 15:04:52,584 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:04:52,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-2.i [2020-07-10 15:04:52,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beed58d9c/bfd6c79671114f21b9440aee0bf26569/FLAG419c584a7 [2020-07-10 15:04:52,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beed58d9c/bfd6c79671114f21b9440aee0bf26569 [2020-07-10 15:04:52,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:04:52,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:04:52,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:52,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:04:52,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:04:52,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:52" (1/1) ... [2020-07-10 15:04:52,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ff13ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:52, skipping insertion in model container [2020-07-10 15:04:52,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:52" (1/1) ... [2020-07-10 15:04:52,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:04:52,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:04:53,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:53,361 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:04:53,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:53,509 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:04:53,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53 WrapperNode [2020-07-10 15:04:53,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:53,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:04:53,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:04:53,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:04:53,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (1/1) ... [2020-07-10 15:04:53,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (1/1) ... [2020-07-10 15:04:53,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (1/1) ... [2020-07-10 15:04:53,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (1/1) ... [2020-07-10 15:04:53,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (1/1) ... [2020-07-10 15:04:53,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (1/1) ... [2020-07-10 15:04:53,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (1/1) ... [2020-07-10 15:04:53,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:04:53,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:04:53,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:04:53,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:04:53,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (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-10 15:04:53,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:04:53,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:04:53,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 15:04:53,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 15:04:53,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-10 15:04:53,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-10 15:04:53,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-10 15:04:53,687 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 15:04:53,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:04:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:04:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:04:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:04:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:04:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:04:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:04:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:04:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:04:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:04:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:04:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:04:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:04:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:04:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:04:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:04:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:04:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:04:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:04:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 15:04:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 15:04:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-10 15:04:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-10 15:04:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-10 15:04:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:04:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:04:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:04:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:04:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:04:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:04:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:04:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:04:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:04:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:04:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:04:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:04:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:04:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:04:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:04:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:04:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:04:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:04:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:04:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:04:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:04:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:04:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:04:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:04:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:04:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:04:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:04:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:04:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:04:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:04:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:04:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:04:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:04:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:04:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:04:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:04:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:04:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:04:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:04:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:04:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:04:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:04:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:04:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:04:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:04:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:04:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:04:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:04:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:04:53,700 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:04:53,700 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:04:53,700 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:04:53,700 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:04:53,700 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:04:53,700 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:04:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:04:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:04:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:04:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:04:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:04:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:04:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:04:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:04:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:04:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:04:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:04:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:04:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:04:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:04:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:04:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:04:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 15:04:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:04:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:04:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:04:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:04:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:04:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:04:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:04:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:04:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:04:54,126 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 15:04:54,439 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:04:54,440 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:04:54,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:54 BoogieIcfgContainer [2020-07-10 15:04:54,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:04:54,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:04:54,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:04:54,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:04:54,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:04:52" (1/3) ... [2020-07-10 15:04:54,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d15fe06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:54, skipping insertion in model container [2020-07-10 15:04:54,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:53" (2/3) ... [2020-07-10 15:04:54,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d15fe06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:54, skipping insertion in model container [2020-07-10 15:04:54,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:54" (3/3) ... [2020-07-10 15:04:54,453 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-07-10 15:04:54,464 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:04:54,472 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:04:54,487 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:04:54,511 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:04:54,512 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:04:54,512 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:04:54,512 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:04:54,512 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:04:54,513 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:04:54,513 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:04:54,513 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:04:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-10 15:04:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:04:54,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:54,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:54,545 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1613857984, now seen corresponding path program 1 times [2020-07-10 15:04:54,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:54,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895745218] [2020-07-10 15:04:54,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:54,805 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-10 15:04:54,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:04:54,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-10 15:04:54,810 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-10 15:04:54,811 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-10 15:04:54,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:04:54,811 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-10 15:04:54,812 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret14 := main(); {38#true} is VALID [2020-07-10 15:04:54,812 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-10 15:04:54,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {38#true} is VALID [2020-07-10 15:04:54,813 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-10 15:04:54,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} assume !true; {39#false} is VALID [2020-07-10 15:04:54,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:04:54,815 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-10 15:04:54,815 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:04:54,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:04:54,816 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-10 15:04:54,816 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} assume 3 != #t~mem13;havoc #t~mem13; {39#false} is VALID [2020-07-10 15:04:54,816 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-10 15:04:54,818 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-10 15:04:54,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895745218] [2020-07-10 15:04:54,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:54,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:54,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980528233] [2020-07-10 15:04:54,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:04:54,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:54,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:54,866 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-10 15:04:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:54,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:54,879 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-10 15:04:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:55,065 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2020-07-10 15:04:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:55,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:04:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-10 15:04:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-10 15:04:55,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-10 15:04:55,179 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-10 15:04:55,191 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:04:55,191 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:04:55,195 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-10 15:04:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:04:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 15:04:55,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:55,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 15:04:55,243 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:04:55,243 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:04:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:55,247 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-10 15:04:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 15:04:55,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:55,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:55,249 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:04:55,249 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:04:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:55,253 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-10 15:04:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 15:04:55,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:55,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:55,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:55,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:04:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-10 15:04:55,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2020-07-10 15:04:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:55,259 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-10 15:04:55,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 15:04:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:55,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:55,261 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-10 15:04:55,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:04:55,261 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1642379272, now seen corresponding path program 1 times [2020-07-10 15:04:55,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:55,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970871578] [2020-07-10 15:04:55,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:55,432 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-10 15:04:55,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-10 15:04:55,433 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} #115#return; {198#true} is VALID [2020-07-10 15:04:55,435 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-10 15:04:55,435 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-10 15:04:55,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-10 15:04:55,436 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #115#return; {198#true} is VALID [2020-07-10 15:04:55,436 INFO L263 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret14 := main(); {198#true} is VALID [2020-07-10 15:04:55,436 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-10 15:04:55,437 INFO L280 TraceCheckUtils]: 6: Hoare triple {198#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {198#true} is VALID [2020-07-10 15:04:55,438 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-10 15:04:55,439 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-10 15:04:55,440 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-10 15:04:55,441 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-10 15:04:55,442 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-10 15:04:55,445 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-10 15:04:55,446 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-10 15:04:55,447 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-10 15:04:55,448 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-10 15:04:55,449 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-10 15:04:55,450 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-10 15:04:55,451 INFO L280 TraceCheckUtils]: 18: Hoare triple {205#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {199#false} is VALID [2020-07-10 15:04:55,452 INFO L280 TraceCheckUtils]: 19: Hoare triple {199#false} assume !false; {199#false} is VALID [2020-07-10 15:04:55,454 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-10 15:04:55,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970871578] [2020-07-10 15:04:55,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:55,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:04:55,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180285164] [2020-07-10 15:04:55,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:04:55,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:55,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:04:55,488 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-10 15:04:55,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:04:55,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:04:55,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:04:55,489 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2020-07-10 15:04:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:55,871 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-10 15:04:55,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:04:55,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:04:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:04:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:04:55,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-10 15:04:55,969 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-10 15:04:55,972 INFO L225 Difference]: With dead ends: 50 [2020-07-10 15:04:55,972 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 15:04:55,973 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-10 15:04:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 15:04:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2020-07-10 15:04:55,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:55,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 34 states. [2020-07-10 15:04:55,989 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 34 states. [2020-07-10 15:04:55,989 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 34 states. [2020-07-10 15:04:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:55,993 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-10 15:04:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-10 15:04:55,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:55,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:55,995 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 46 states. [2020-07-10 15:04:55,995 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 46 states. [2020-07-10 15:04:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:55,999 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-10 15:04:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-10 15:04:56,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:56,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:56,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:56,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:04:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2020-07-10 15:04:56,006 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2020-07-10 15:04:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:56,006 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-07-10 15:04:56,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:04:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-10 15:04:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:56,008 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:56,008 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-10 15:04:56,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:04:56,011 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2024806125, now seen corresponding path program 1 times [2020-07-10 15:04:56,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:56,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999748393] [2020-07-10 15:04:56,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:56,185 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-10 15:04:56,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-10 15:04:56,186 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #115#return; {406#true} is VALID [2020-07-10 15:04:56,188 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-10 15:04:56,188 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-10 15:04:56,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-10 15:04:56,189 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #115#return; {406#true} is VALID [2020-07-10 15:04:56,189 INFO L263 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret14 := main(); {406#true} is VALID [2020-07-10 15:04:56,189 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-10 15:04:56,190 INFO L280 TraceCheckUtils]: 6: Hoare triple {406#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {406#true} is VALID [2020-07-10 15:04:56,191 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-10 15:04:56,192 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-10 15:04:56,193 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-10 15:04:56,194 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-10 15:04:56,194 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-10 15:04:56,196 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-10 15:04:56,197 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-10 15:04:56,197 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-10 15:04:56,198 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-10 15:04:56,199 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-10 15:04:56,200 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-10 15:04:56,200 INFO L280 TraceCheckUtils]: 18: Hoare triple {407#false} assume !(1 == #t~mem11);havoc #t~mem11; {407#false} is VALID [2020-07-10 15:04:56,200 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-10 15:04:56,201 INFO L280 TraceCheckUtils]: 20: Hoare triple {407#false} assume 3 != #t~mem13;havoc #t~mem13; {407#false} is VALID [2020-07-10 15:04:56,201 INFO L280 TraceCheckUtils]: 21: Hoare triple {407#false} assume !false; {407#false} is VALID [2020-07-10 15:04:56,202 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-10 15:04:56,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999748393] [2020-07-10 15:04:56,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:56,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:04:56,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976447809] [2020-07-10 15:04:56,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-10 15:04:56,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:56,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:04:56,231 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-10 15:04:56,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:04:56,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:04:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:04:56,233 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2020-07-10 15:04:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:56,641 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-10 15:04:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:04:56,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-10 15:04:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 15:04:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 15:04:56,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 15:04:56,721 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-10 15:04:56,724 INFO L225 Difference]: With dead ends: 52 [2020-07-10 15:04:56,725 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:04:56,725 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-10 15:04:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:04:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2020-07-10 15:04:56,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:56,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 32 states. [2020-07-10 15:04:56,747 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 32 states. [2020-07-10 15:04:56,748 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 32 states. [2020-07-10 15:04:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:56,751 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-10 15:04:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-10 15:04:56,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:56,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:56,752 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 44 states. [2020-07-10 15:04:56,752 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 44 states. [2020-07-10 15:04:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:56,755 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-10 15:04:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-10 15:04:56,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:56,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:56,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:56,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:04:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-07-10 15:04:56,758 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2020-07-10 15:04:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:56,759 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-07-10 15:04:56,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:04:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-10 15:04:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:56,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:56,760 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-10 15:04:56,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:04:56,760 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1000103149, now seen corresponding path program 1 times [2020-07-10 15:04:56,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:56,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495452035] [2020-07-10 15:04:56,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:56,849 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-10 15:04:56,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2020-07-10 15:04:56,850 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #115#return; {610#true} is VALID [2020-07-10 15:04:56,851 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-10 15:04:56,851 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-10 15:04:56,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2020-07-10 15:04:56,852 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #115#return; {610#true} is VALID [2020-07-10 15:04:56,852 INFO L263 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret14 := main(); {610#true} is VALID [2020-07-10 15:04:56,852 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-10 15:04:56,852 INFO L280 TraceCheckUtils]: 6: Hoare triple {610#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {610#true} is VALID [2020-07-10 15:04:56,853 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-10 15:04:56,853 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-10 15:04:56,854 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-10 15:04:56,855 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-10 15:04:56,855 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-10 15:04:56,856 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-10 15:04:56,857 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-10 15:04:56,857 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-10 15:04:56,858 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-10 15:04:56,858 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#false} assume !(2 == #t~mem9);havoc #t~mem9; {611#false} is VALID [2020-07-10 15:04:56,858 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-10 15:04:56,859 INFO L280 TraceCheckUtils]: 18: Hoare triple {611#false} assume !(1 == #t~mem11);havoc #t~mem11; {611#false} is VALID [2020-07-10 15:04:56,859 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-10 15:04:56,860 INFO L280 TraceCheckUtils]: 20: Hoare triple {611#false} assume 3 != #t~mem13;havoc #t~mem13; {611#false} is VALID [2020-07-10 15:04:56,860 INFO L280 TraceCheckUtils]: 21: Hoare triple {611#false} assume !false; {611#false} is VALID [2020-07-10 15:04:56,861 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-10 15:04:56,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495452035] [2020-07-10 15:04:56,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:56,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:04:56,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926195618] [2020-07-10 15:04:56,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-10 15:04:56,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:56,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:04:56,906 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-10 15:04:56,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:04:56,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:04:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:04:56,908 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2020-07-10 15:04:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:57,218 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-10 15:04:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:04:57,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-10 15:04:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 15:04:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 15:04:57,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 15:04:57,300 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-10 15:04:57,302 INFO L225 Difference]: With dead ends: 52 [2020-07-10 15:04:57,303 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 15:04:57,303 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-10 15:04:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 15:04:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2020-07-10 15:04:57,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:57,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 29 states. [2020-07-10 15:04:57,320 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 29 states. [2020-07-10 15:04:57,320 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 29 states. [2020-07-10 15:04:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:57,324 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-10 15:04:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-10 15:04:57,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:57,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:57,325 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 41 states. [2020-07-10 15:04:57,325 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 41 states. [2020-07-10 15:04:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:57,327 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-10 15:04:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-10 15:04:57,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:57,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:57,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:57,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:04:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 15:04:57,330 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2020-07-10 15:04:57,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:57,330 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 15:04:57,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:04:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:04:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:57,331 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:57,332 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-10 15:04:57,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:04:57,332 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash 422878047, now seen corresponding path program 1 times [2020-07-10 15:04:57,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:57,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778134067] [2020-07-10 15:04:57,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:57,550 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-10 15:04:57,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-10 15:04:57,551 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-10 15:04:57,554 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-10 15:04:57,554 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-10 15:04:57,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-10 15:04:57,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-10 15:04:57,555 INFO L263 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret14 := main(); {805#true} is VALID [2020-07-10 15:04:57,559 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-10 15:04:57,562 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-10 15:04:57,565 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-10 15:04:57,566 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-10 15:04:57,572 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-10 15:04:57,573 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-10 15:04:57,575 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-10 15:04:57,576 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-10 15:04:57,578 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-10 15:04:57,579 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-10 15:04:57,580 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-10 15:04:57,581 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-10 15:04:57,582 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-10 15:04:57,582 INFO L280 TraceCheckUtils]: 18: Hoare triple {815#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {806#false} is VALID [2020-07-10 15:04:57,583 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-10 15:04:57,583 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#false} assume !(1 == #t~mem11);havoc #t~mem11; {806#false} is VALID [2020-07-10 15:04:57,583 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-10 15:04:57,583 INFO L280 TraceCheckUtils]: 22: Hoare triple {806#false} assume 3 != #t~mem13;havoc #t~mem13; {806#false} is VALID [2020-07-10 15:04:57,584 INFO L280 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-10 15:04:57,587 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-10 15:04:57,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778134067] [2020-07-10 15:04:57,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026366261] [2020-07-10 15:04:57,588 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-10 15:04:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:57,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-10 15:04:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:57,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:04:57,799 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-10 15:04:57,799 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:04:57,805 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:04:57,805 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:04:57,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-10 15:04:57,816 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:04:57,816 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-10 15:04:57,817 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-10 15:04:57,931 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:04:57,931 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-10 15:04:57,933 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:04:57,944 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:04:57,951 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-10 15:04:57,951 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:04:57,961 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:04:57,962 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-10 15:04:57,962 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-07-10 15:04:57,965 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:04:57,966 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-10 15:04:57,966 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-10 15:04:58,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:04:58,059 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-10 15:04:58,064 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:04:58,074 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:04:58,075 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:04:58,075 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-07-10 15:04:58,148 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-10 15:04:58,150 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:04:58,159 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:04:58,169 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-10 15:04:58,169 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-07-10 15:04:58,175 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:04:58,175 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-10 15:04:58,175 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-10 15:04:58,260 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-10 15:04:58,263 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:04:58,268 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:04:58,271 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-10 15:04:58,272 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-07-10 15:04:58,274 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:04:58,275 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-10 15:04:58,275 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-10 15:04:58,280 INFO L263 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2020-07-10 15:04:58,283 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-10 15:04:58,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-10 15:04:58,284 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-10 15:04:58,284 INFO L263 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret14 := main(); {805#true} is VALID [2020-07-10 15:04:58,300 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-10 15:04:58,301 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-10 15:04:58,302 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-10 15:04:58,304 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-10 15:04:58,309 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-10 15:04:58,311 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-10 15:04:58,313 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-10 15:04:58,315 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-10 15:04:58,318 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-10 15:04:58,319 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-10 15:04:58,320 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-10 15:04:58,324 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-10 15:04:58,326 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-10 15:04:58,327 INFO L280 TraceCheckUtils]: 18: Hoare triple {815#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {806#false} is VALID [2020-07-10 15:04:58,327 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-10 15:04:58,327 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#false} assume !(1 == #t~mem11);havoc #t~mem11; {806#false} is VALID [2020-07-10 15:04:58,328 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-10 15:04:58,328 INFO L280 TraceCheckUtils]: 22: Hoare triple {806#false} assume 3 != #t~mem13;havoc #t~mem13; {806#false} is VALID [2020-07-10 15:04:58,328 INFO L280 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-10 15:04:58,331 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-10 15:04:58,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:04:58,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-10 15:04:58,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165228588] [2020-07-10 15:04:58,336 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-10 15:04:58,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:58,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 15:04:58,394 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-10 15:04:58,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 15:04:58,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:58,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 15:04:58,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:04:58,395 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 14 states. [2020-07-10 15:04:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:59,455 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2020-07-10 15:04:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:04:59,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-10 15:04:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:04:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-10 15:04:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:04:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-10 15:04:59,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2020-07-10 15:04:59,535 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-10 15:04:59,537 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:04:59,537 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:04:59,538 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-10 15:04:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:04:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-10 15:04:59,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:59,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 36 states. [2020-07-10 15:04:59,556 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 36 states. [2020-07-10 15:04:59,557 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 36 states. [2020-07-10 15:04:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:59,559 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-10 15:04:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-10 15:04:59,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:59,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:59,560 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 48 states. [2020-07-10 15:04:59,560 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 48 states. [2020-07-10 15:04:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:59,563 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-10 15:04:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-10 15:04:59,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:59,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:59,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:59,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:04:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-10 15:04:59,566 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2020-07-10 15:04:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:59,566 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-10 15:04:59,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 15:04:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:04:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:59,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:59,568 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-10 15:04:59,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:04:59,783 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1286279711, now seen corresponding path program 1 times [2020-07-10 15:04:59,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:59,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166199679] [2020-07-10 15:04:59,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:59,989 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-10 15:04:59,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-10 15:04:59,990 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-10 15:04:59,991 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-10 15:04:59,992 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-10 15:04:59,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-10 15:04:59,992 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-10 15:04:59,992 INFO L263 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret14 := main(); {1108#true} is VALID [2020-07-10 15:04:59,993 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-10 15:04:59,994 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-10 15:04:59,995 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-10 15:04:59,996 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-10 15:04:59,998 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-10 15:04:59,999 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-10 15:05:00,000 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-10 15:05:00,001 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-10 15:05:00,002 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-10 15:05:00,003 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-10 15:05:00,004 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-10 15:05:00,005 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-10 15:05:00,006 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-10 15:05:00,006 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-10 15:05:00,007 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-10 15:05:00,008 INFO L280 TraceCheckUtils]: 20: Hoare triple {1118#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {1109#false} is VALID [2020-07-10 15:05:00,008 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-10 15:05:00,008 INFO L280 TraceCheckUtils]: 22: Hoare triple {1109#false} assume 3 != #t~mem13;havoc #t~mem13; {1109#false} is VALID [2020-07-10 15:05:00,008 INFO L280 TraceCheckUtils]: 23: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2020-07-10 15:05:00,010 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-10 15:05:00,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166199679] [2020-07-10 15:05:00,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126725751] [2020-07-10 15:05:00,011 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-10 15:05:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:00,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-10 15:05:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:00,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:00,129 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-10 15:05:00,129 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,134 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:00,135 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-10 15:05:00,137 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:00,138 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-10 15:05:00,138 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-10 15:05:00,213 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:00,213 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-10 15:05:00,215 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,229 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:00,238 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-10 15:05:00,238 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,246 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:00,246 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-10 15:05:00,246 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-07-10 15:05:00,249 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:00,249 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-10 15:05:00,249 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-10 15:05:00,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:05:00,340 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-10 15:05:00,341 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,347 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:00,348 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,348 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-07-10 15:05:00,416 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-10 15:05:00,418 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,426 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:00,429 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-10 15:05:00,429 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-07-10 15:05:00,432 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:00,432 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-10 15:05:00,432 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-10 15:05:00,539 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-10 15:05:00,542 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:00,547 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:00,548 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-10 15:05:00,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-07-10 15:05:00,551 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:00,551 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-10 15:05:00,552 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| 1) [2020-07-10 15:05:00,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2020-07-10 15:05:00,555 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-10 15:05:00,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-10 15:05:00,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-10 15:05:00,555 INFO L263 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret14 := main(); {1108#true} is VALID [2020-07-10 15:05:00,557 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-10 15:05:00,558 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-10 15:05:00,559 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-10 15:05:00,560 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-10 15:05:00,563 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-10 15:05:00,564 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-10 15:05:00,566 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-10 15:05:00,567 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-10 15:05:00,568 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-10 15:05:00,569 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-10 15:05:00,570 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-10 15:05:00,573 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-10 15:05:00,574 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-10 15:05:00,575 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-10 15:05:00,576 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-10 15:05:00,578 INFO L280 TraceCheckUtils]: 20: Hoare triple {1118#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {1109#false} is VALID [2020-07-10 15:05:00,578 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-10 15:05:00,578 INFO L280 TraceCheckUtils]: 22: Hoare triple {1109#false} assume 3 != #t~mem13;havoc #t~mem13; {1109#false} is VALID [2020-07-10 15:05:00,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2020-07-10 15:05:00,581 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-10 15:05:00,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:00,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-10 15:05:00,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066678978] [2020-07-10 15:05:00,582 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-10 15:05:00,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:00,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 15:05:00,645 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-10 15:05:00,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 15:05:00,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:00,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 15:05:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:05:00,646 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 14 states. [2020-07-10 15:05:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:01,932 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2020-07-10 15:05:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:05:01,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-10 15:05:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:05:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2020-07-10 15:05:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:05:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2020-07-10 15:05:01,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2020-07-10 15:05:02,034 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-10 15:05:02,036 INFO L225 Difference]: With dead ends: 63 [2020-07-10 15:05:02,036 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 15:05:02,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:05:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 15:05:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-10 15:05:02,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:02,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-10 15:05:02,062 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-10 15:05:02,062 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-10 15:05:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:02,065 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-10 15:05:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-10 15:05:02,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:02,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:02,066 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-10 15:05:02,067 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-10 15:05:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:02,069 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-10 15:05:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-10 15:05:02,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:02,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:02,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:02,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 15:05:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-10 15:05:02,073 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-10 15:05:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:02,073 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-10 15:05:02,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 15:05:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 15:05:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:05:02,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:02,074 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-10 15:05:02,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:02,288 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash -562710342, now seen corresponding path program 1 times [2020-07-10 15:05:02,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:02,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126220773] [2020-07-10 15:05:02,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:02,529 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-10 15:05:02,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-10 15:05:02,530 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-10 15:05:02,531 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-10 15:05:02,531 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-10 15:05:02,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-10 15:05:02,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-10 15:05:02,532 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret14 := main(); {1457#true} is VALID [2020-07-10 15:05:02,540 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-10 15:05:02,541 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-10 15:05:02,542 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-10 15:05:02,543 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-10 15:05:02,544 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-10 15:05:02,545 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-10 15:05:02,546 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-10 15:05:02,547 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-10 15:05:02,549 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-10 15:05:02,558 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-10 15:05:02,559 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-10 15:05:02,561 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-10 15:05:02,561 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-10 15:05:02,562 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-10 15:05:02,563 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-10 15:05:02,563 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-10 15:05:02,564 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-10 15:05:02,564 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-10 15:05:02,565 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-10 15:05:02,565 INFO L280 TraceCheckUtils]: 24: Hoare triple {1468#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {1458#false} is VALID [2020-07-10 15:05:02,566 INFO L280 TraceCheckUtils]: 25: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-10 15:05:02,569 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-10 15:05:02,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126220773] [2020-07-10 15:05:02,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818602281] [2020-07-10 15:05:02,570 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-10 15:05:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:02,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-10 15:05:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:02,678 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:02,690 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-10 15:05:02,691 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,696 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,697 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-10 15:05:02,699 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:02,700 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-10 15:05:02,700 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-10 15:05:02,744 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,744 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-10 15:05:02,747 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,753 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,753 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,753 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-10 15:05:02,784 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-10 15:05:02,785 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,798 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,812 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-10 15:05:02,812 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,822 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,824 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-10 15:05:02,824 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-10 15:05:02,827 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:02,827 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-10 15:05:02,828 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-10 15:05:02,866 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2020-07-10 15:05:02,876 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-10 15:05:02,876 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,889 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,909 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,910 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-10 15:05:02,918 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-10 15:05:02,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:02,921 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,942 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-10 15:05:02,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, 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-10 15:05:02,949 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,971 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:02,971 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:02,972 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-10 15:05:02,981 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:02,982 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-10 15:05:02,982 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-10 15:05:03,033 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-10 15:05:03,036 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:03,042 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:03,046 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-10 15:05:03,048 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:03,052 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:03,053 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-10 15:05:03,054 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-10 15:05:03,055 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:03,056 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-10 15:05:03,056 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-10 15:05:03,070 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-10 15:05:03,072 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:03,073 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:03,073 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-10 15:05:03,074 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-10 15:05:03,078 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:03,078 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-10 15:05:03,078 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem13| 3) [2020-07-10 15:05:03,080 INFO L263 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1457#true} is VALID [2020-07-10 15:05:03,080 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-10 15:05:03,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-10 15:05:03,080 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-10 15:05:03,081 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret14 := main(); {1457#true} is VALID [2020-07-10 15:05:03,081 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-10 15:05:03,082 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-10 15:05:03,083 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-10 15:05:03,084 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-10 15:05:03,084 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-10 15:05:03,085 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-10 15:05:03,086 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-10 15:05:03,086 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-10 15:05:03,088 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-10 15:05:03,089 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-10 15:05:03,090 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-10 15:05:03,092 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-10 15:05:03,093 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-10 15:05:03,094 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-10 15:05:03,095 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-10 15:05:03,095 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-10 15:05:03,095 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-10 15:05:03,096 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-10 15:05:03,096 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-10 15:05:03,097 INFO L280 TraceCheckUtils]: 24: Hoare triple {1468#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {1458#false} is VALID [2020-07-10 15:05:03,097 INFO L280 TraceCheckUtils]: 25: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-10 15:05:03,099 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-10 15:05:03,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:03,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-10 15:05:03,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531894166] [2020-07-10 15:05:03,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-07-10 15:05:03,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:03,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:05:03,140 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-10 15:05:03,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:05:03,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:05:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:05:03,141 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 11 states. [2020-07-10 15:05:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:04,195 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2020-07-10 15:05:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:05:04,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-07-10 15:05:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:05:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-10 15:05:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:05:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-10 15:05:04,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2020-07-10 15:05:04,296 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-10 15:05:04,298 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:05:04,298 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 15:05:04,299 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-10 15:05:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 15:05:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2020-07-10 15:05:04,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:04,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 51 states. [2020-07-10 15:05:04,339 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 51 states. [2020-07-10 15:05:04,339 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 51 states. [2020-07-10 15:05:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:04,356 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-10 15:05:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-10 15:05:04,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:04,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:04,357 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 63 states. [2020-07-10 15:05:04,357 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 63 states. [2020-07-10 15:05:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:04,359 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-10 15:05:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-10 15:05:04,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:04,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:04,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:04,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 15:05:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2020-07-10 15:05:04,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2020-07-10 15:05:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:04,363 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2020-07-10 15:05:04,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:05:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2020-07-10 15:05:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:05:04,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:04,364 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-10 15:05:04,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:04,580 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash 449917269, now seen corresponding path program 1 times [2020-07-10 15:05:04,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:04,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209462392] [2020-07-10 15:05:04,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:04,839 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-10 15:05:04,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-10 15:05:04,840 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-10 15:05:04,841 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-10 15:05:04,841 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-10 15:05:04,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-10 15:05:04,841 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-10 15:05:04,842 INFO L263 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret14 := main(); {1825#true} is VALID [2020-07-10 15:05:04,844 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-10 15:05:04,845 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-10 15:05:04,846 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-10 15:05:04,847 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-10 15:05:04,847 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-10 15:05:04,848 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-10 15:05:04,849 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-10 15:05:04,849 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-10 15:05:04,851 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-10 15:05:04,851 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-10 15:05:04,852 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-10 15:05:04,853 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-10 15:05:04,853 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-10 15:05:04,854 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-10 15:05:04,854 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-10 15:05:04,855 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-10 15:05:04,855 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-10 15:05:04,856 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-10 15:05:04,856 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-10 15:05:04,856 INFO L280 TraceCheckUtils]: 24: Hoare triple {1826#false} assume !(1 == #t~mem11);havoc #t~mem11; {1826#false} is VALID [2020-07-10 15:05:04,856 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-10 15:05:04,856 INFO L280 TraceCheckUtils]: 26: Hoare triple {1826#false} assume 3 != #t~mem13;havoc #t~mem13; {1826#false} is VALID [2020-07-10 15:05:04,857 INFO L280 TraceCheckUtils]: 27: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2020-07-10 15:05:04,858 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-10 15:05:04,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209462392] [2020-07-10 15:05:04,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445736522] [2020-07-10 15:05:04,859 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-10 15:05:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:04,950 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-10 15:05:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:04,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:04,996 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-10 15:05:04,997 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,003 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,003 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,003 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-10 15:05:05,006 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:05,007 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-10 15:05:05,007 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-10 15:05:05,055 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,056 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-10 15:05:05,058 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,066 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,066 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-10 15:05:05,107 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-10 15:05:05,108 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,119 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,126 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-10 15:05:05,127 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,144 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,147 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-10 15:05:05,147 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-10 15:05:05,151 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:05,151 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-10 15:05:05,151 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-10 15:05:05,181 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_23|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|]} [2020-07-10 15:05:05,185 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-10 15:05:05,186 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,204 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,211 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-10 15:05:05,213 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,222 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,243 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,244 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-10 15:05:05,249 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-07-10 15:05:05,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:05:05,252 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,266 INFO L624 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2020-07-10 15:05:05,266 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,266 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-10 15:05:05,274 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:05,274 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-10 15:05:05,274 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-10 15:05:05,333 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-10 15:05:05,335 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,342 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,345 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-10 15:05:05,347 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,352 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,354 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-10 15:05:05,354 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-10 15:05:05,356 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:05,357 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-10 15:05:05,357 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-10 15:05:05,367 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-10 15:05:05,369 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:05,374 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:05,375 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-10 15:05:05,375 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-10 15:05:05,376 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:05,376 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-10 15:05:05,377 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem11|) [2020-07-10 15:05:05,401 INFO L263 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2020-07-10 15:05:05,401 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-10 15:05:05,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-10 15:05:05,402 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-10 15:05:05,402 INFO L263 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret14 := main(); {1825#true} is VALID [2020-07-10 15:05:05,403 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-10 15:05:05,403 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-10 15:05:05,404 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-10 15:05:05,404 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-10 15:05:05,405 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-10 15:05:05,405 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-10 15:05:05,407 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-10 15:05:05,408 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-10 15:05:05,410 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-10 15:05:05,411 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-10 15:05:05,411 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-10 15:05:05,413 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-10 15:05:05,414 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-10 15:05:05,415 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-10 15:05:05,417 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-10 15:05:05,417 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-10 15:05:05,418 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-10 15:05:05,418 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-10 15:05:05,418 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-10 15:05:05,419 INFO L280 TraceCheckUtils]: 24: Hoare triple {1826#false} assume !(1 == #t~mem11);havoc #t~mem11; {1826#false} is VALID [2020-07-10 15:05:05,419 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-10 15:05:05,419 INFO L280 TraceCheckUtils]: 26: Hoare triple {1826#false} assume 3 != #t~mem13;havoc #t~mem13; {1826#false} is VALID [2020-07-10 15:05:05,419 INFO L280 TraceCheckUtils]: 27: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2020-07-10 15:05:05,422 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-10 15:05:05,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:05,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-10 15:05:05,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326128840] [2020-07-10 15:05:05,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-10 15:05:05,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:05,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:05:05,467 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-10 15:05:05,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:05:05,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:05:05,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:05:05,468 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 12 states. [2020-07-10 15:05:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:06,496 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2020-07-10 15:05:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:05:06,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-10 15:05:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:05:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2020-07-10 15:05:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:05:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2020-07-10 15:05:06,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2020-07-10 15:05:06,607 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-10 15:05:06,609 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:05:06,610 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 15:05:06,610 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-10 15:05:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 15:05:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-07-10 15:05:06,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:06,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 42 states. [2020-07-10 15:05:06,641 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 42 states. [2020-07-10 15:05:06,641 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 42 states. [2020-07-10 15:05:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:06,643 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-10 15:05:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-10 15:05:06,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:06,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:06,644 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 59 states. [2020-07-10 15:05:06,644 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 59 states. [2020-07-10 15:05:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:06,647 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-10 15:05:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-10 15:05:06,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:06,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:06,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:06,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:05:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-07-10 15:05:06,650 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2020-07-10 15:05:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:06,650 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-07-10 15:05:06,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 15:05:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-07-10 15:05:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:05:06,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:06,651 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-10 15:05:06,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:06,864 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:06,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1474620245, now seen corresponding path program 2 times [2020-07-10 15:05:06,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:06,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644180824] [2020-07-10 15:05:06,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:07,064 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-10 15:05:07,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-10 15:05:07,064 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-10 15:05:07,065 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-10 15:05:07,065 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-10 15:05:07,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-10 15:05:07,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-10 15:05:07,066 INFO L263 TraceCheckUtils]: 4: Hoare triple {2184#true} call #t~ret14 := main(); {2184#true} is VALID [2020-07-10 15:05:07,067 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-10 15:05:07,067 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-10 15:05:07,068 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-10 15:05:07,068 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-10 15:05:07,069 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-10 15:05:07,070 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-10 15:05:07,071 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-10 15:05:07,071 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-10 15:05:07,072 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-10 15:05:07,073 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-10 15:05:07,073 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-10 15:05:07,074 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-10 15:05:07,075 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-10 15:05:07,076 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-10 15:05:07,076 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-10 15:05:07,077 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-10 15:05:07,077 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-10 15:05:07,077 INFO L280 TraceCheckUtils]: 22: Hoare triple {2185#false} assume !(2 == #t~mem9);havoc #t~mem9; {2185#false} is VALID [2020-07-10 15:05:07,077 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-10 15:05:07,077 INFO L280 TraceCheckUtils]: 24: Hoare triple {2185#false} assume !(1 == #t~mem11);havoc #t~mem11; {2185#false} is VALID [2020-07-10 15:05:07,078 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-10 15:05:07,078 INFO L280 TraceCheckUtils]: 26: Hoare triple {2185#false} assume 3 != #t~mem13;havoc #t~mem13; {2185#false} is VALID [2020-07-10 15:05:07,078 INFO L280 TraceCheckUtils]: 27: Hoare triple {2185#false} assume !false; {2185#false} is VALID [2020-07-10 15:05:07,081 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-10 15:05:07,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644180824] [2020-07-10 15:05:07,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795919239] [2020-07-10 15:05:07,081 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-10 15:05:07,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:05:07,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:05:07,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-10 15:05:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:07,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:07,203 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-10 15:05:07,204 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,211 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,212 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-10 15:05:07,214 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:07,214 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-10 15:05:07,215 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-10 15:05:07,247 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,247 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-10 15:05:07,250 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,257 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,257 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-10 15:05:07,306 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-10 15:05:07,307 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,338 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,346 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-10 15:05:07,347 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,360 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,362 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-10 15:05:07,362 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-10 15:05:07,366 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:07,367 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-10 15:05:07,367 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-10 15:05:07,412 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|]} [2020-07-10 15:05:07,420 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-10 15:05:07,420 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,449 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,469 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,470 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-10 15:05:07,483 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-10 15:05:07,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:07,486 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,506 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-10 15:05:07,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, 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-10 15:05:07,514 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,522 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,522 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,523 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-10 15:05:07,536 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:07,536 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-10 15:05:07,536 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-10 15:05:07,577 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-10 15:05:07,580 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,588 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,592 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-10 15:05:07,593 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,597 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,598 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-10 15:05:07,598 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-10 15:05:07,601 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:07,601 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-10 15:05:07,602 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-10 15:05:07,612 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-10 15:05:07,617 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:07,619 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:07,619 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-10 15:05:07,619 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-10 15:05:07,622 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:07,622 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-10 15:05:07,622 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem9|) [2020-07-10 15:05:07,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {2184#true} call ULTIMATE.init(); {2184#true} is VALID [2020-07-10 15:05:07,647 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-10 15:05:07,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-10 15:05:07,648 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-10 15:05:07,648 INFO L263 TraceCheckUtils]: 4: Hoare triple {2184#true} call #t~ret14 := main(); {2184#true} is VALID [2020-07-10 15:05:07,649 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-10 15:05:07,650 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-10 15:05:07,650 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-10 15:05:07,651 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-10 15:05:07,651 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-10 15:05:07,652 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-10 15:05:07,653 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-10 15:05:07,653 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-10 15:05:07,655 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-10 15:05:07,656 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-10 15:05:07,657 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-10 15:05:07,658 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-10 15:05:07,660 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-10 15:05:07,661 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-10 15:05:07,661 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-10 15:05:07,662 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-10 15:05:07,662 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-10 15:05:07,662 INFO L280 TraceCheckUtils]: 22: Hoare triple {2185#false} assume !(2 == #t~mem9);havoc #t~mem9; {2185#false} is VALID [2020-07-10 15:05:07,662 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-10 15:05:07,662 INFO L280 TraceCheckUtils]: 24: Hoare triple {2185#false} assume !(1 == #t~mem11);havoc #t~mem11; {2185#false} is VALID [2020-07-10 15:05:07,663 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-10 15:05:07,663 INFO L280 TraceCheckUtils]: 26: Hoare triple {2185#false} assume 3 != #t~mem13;havoc #t~mem13; {2185#false} is VALID [2020-07-10 15:05:07,663 INFO L280 TraceCheckUtils]: 27: Hoare triple {2185#false} assume !false; {2185#false} is VALID [2020-07-10 15:05:07,665 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-10 15:05:07,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:07,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-10 15:05:07,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492438446] [2020-07-10 15:05:07,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-10 15:05:07,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:07,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:05:07,709 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-10 15:05:07,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:05:07,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:07,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:05:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:05:07,710 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 12 states. [2020-07-10 15:05:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:08,564 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-10 15:05:08,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:05:08,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-10 15:05:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:05:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2020-07-10 15:05:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:05:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2020-07-10 15:05:08,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2020-07-10 15:05:08,671 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-10 15:05:08,672 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:05:08,672 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 15:05:08,673 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-10 15:05:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 15:05:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2020-07-10 15:05:08,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:08,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 37 states. [2020-07-10 15:05:08,699 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 37 states. [2020-07-10 15:05:08,699 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 37 states. [2020-07-10 15:05:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:08,701 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:05:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-10 15:05:08,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:08,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:08,702 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 49 states. [2020-07-10 15:05:08,702 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 49 states. [2020-07-10 15:05:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:08,704 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:05:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-10 15:05:08,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:08,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:08,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:08,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 15:05:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-10 15:05:08,707 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2020-07-10 15:05:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:08,707 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-10 15:05:08,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 15:05:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-10 15:05:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:05:08,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:08,708 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-10 15:05:08,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:08,921 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash -149429434, now seen corresponding path program 2 times [2020-07-10 15:05:08,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:08,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501986036] [2020-07-10 15:05:08,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:09,228 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-10 15:05:09,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-10 15:05:09,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-10 15:05:09,230 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-10 15:05:09,230 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-10 15:05:09,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-10 15:05:09,231 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-10 15:05:09,231 INFO L263 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret14 := main(); {2509#true} is VALID [2020-07-10 15:05:09,232 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-10 15:05:09,233 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-10 15:05:09,238 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-10 15:05:09,239 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-10 15:05:09,240 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-10 15:05:09,240 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-10 15:05:09,242 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-10 15:05:09,244 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-10 15:05:09,251 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-10 15:05:09,257 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-10 15:05:09,262 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-10 15:05:09,266 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-10 15:05:09,268 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-10 15:05:09,269 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-10 15:05:09,270 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-10 15:05:09,271 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-10 15:05:09,272 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-10 15:05:09,273 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-10 15:05:09,273 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-10 15:05:09,274 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-10 15:05:09,275 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-10 15:05:09,275 INFO L280 TraceCheckUtils]: 26: Hoare triple {2523#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {2510#false} is VALID [2020-07-10 15:05:09,275 INFO L280 TraceCheckUtils]: 27: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2020-07-10 15:05:09,278 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-10 15:05:09,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501986036] [2020-07-10 15:05:09,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150185228] [2020-07-10 15:05:09,279 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-10 15:05:09,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:05:09,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:05:09,372 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-10 15:05:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:09,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:09,410 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-10 15:05:09,411 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,419 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,419 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-10 15:05:09,422 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:09,423 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-10 15:05:09,423 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-10 15:05:09,503 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,504 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-10 15:05:09,505 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,542 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-10 15:05:09,555 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-10 15:05:09,555 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,569 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,570 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-10 15:05:09,570 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-10 15:05:09,574 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:09,574 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-10 15:05:09,574 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-10 15:05:09,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:05:09,655 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-10 15:05:09,661 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,672 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,672 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-10 15:05:09,742 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,743 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-10 15:05:09,745 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,757 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,767 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-10 15:05:09,771 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,783 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,784 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-10 15:05:09,784 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-10 15:05:09,789 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:09,789 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-10 15:05:09,789 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-10 15:05:09,882 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-10 15:05:09,883 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-10 15:05:09,947 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-10 15:05:09,948 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-10 15:05:09,950 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:09,961 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:09,966 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-10 15:05:09,967 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-10 15:05:10,117 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-10 15:05:10,119 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:10,132 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:10,151 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-10 15:05:10,152 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-10 15:05:10,158 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:10,158 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-10 15:05:10,159 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-10 15:05:10,281 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-10 15:05:10,291 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:10,303 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:10,306 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-10 15:05:10,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-10 15:05:10,308 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:10,309 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-10 15:05:10,309 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-10 15:05:10,332 INFO L263 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2020-07-10 15:05:10,332 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-10 15:05:10,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-10 15:05:10,333 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-10 15:05:10,333 INFO L263 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret14 := main(); {2509#true} is VALID [2020-07-10 15:05:10,334 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-10 15:05:10,335 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-10 15:05:10,335 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-10 15:05:10,336 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-10 15:05:10,336 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-10 15:05:10,337 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-10 15:05:10,338 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-10 15:05:10,339 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-10 15:05:10,340 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-10 15:05:10,341 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-10 15:05:10,342 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-10 15:05:10,343 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-10 15:05:10,345 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-10 15:05:10,346 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-10 15:05:10,347 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-10 15:05:10,351 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-10 15:05:10,352 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-10 15:05:10,353 INFO L280 TraceCheckUtils]: 22: Hoare triple {2596#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {2510#false} is VALID [2020-07-10 15:05:10,353 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-10 15:05:10,353 INFO L280 TraceCheckUtils]: 24: Hoare triple {2510#false} assume !(1 == #t~mem11);havoc #t~mem11; {2510#false} is VALID [2020-07-10 15:05:10,353 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-10 15:05:10,353 INFO L280 TraceCheckUtils]: 26: Hoare triple {2510#false} assume 3 != #t~mem13;havoc #t~mem13; {2510#false} is VALID [2020-07-10 15:05:10,353 INFO L280 TraceCheckUtils]: 27: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2020-07-10 15:05:10,357 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-10 15:05:10,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:10,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-10 15:05:10,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495168037] [2020-07-10 15:05:10,358 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-10 15:05:10,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:10,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 15:05:10,426 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-10 15:05:10,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 15:05:10,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 15:05:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:05:10,428 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 19 states. [2020-07-10 15:05:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:16,423 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-10 15:05:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 15:05:16,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-10 15:05:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:05:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2020-07-10 15:05:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:05:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2020-07-10 15:05:16,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2020-07-10 15:05:16,560 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-10 15:05:16,562 INFO L225 Difference]: With dead ends: 73 [2020-07-10 15:05:16,562 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 15:05:16,565 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-10 15:05:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 15:05:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-07-10 15:05:16,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:16,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 55 states. [2020-07-10 15:05:16,599 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 55 states. [2020-07-10 15:05:16,599 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 55 states. [2020-07-10 15:05:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:16,605 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2020-07-10 15:05:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2020-07-10 15:05:16,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:16,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:16,606 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 65 states. [2020-07-10 15:05:16,606 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 65 states. [2020-07-10 15:05:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:16,608 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2020-07-10 15:05:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2020-07-10 15:05:16,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:16,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:16,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:16,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 15:05:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-07-10 15:05:16,611 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 28 [2020-07-10 15:05:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:16,611 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-07-10 15:05:16,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 15:05:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-07-10 15:05:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:05:16,613 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:16,613 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-10 15:05:16,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:16,825 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash 150272518, now seen corresponding path program 1 times [2020-07-10 15:05:16,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:16,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798737674] [2020-07-10 15:05:16,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,056 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-10 15:05:17,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {2917#true} assume true; {2917#true} is VALID [2020-07-10 15:05:17,057 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2917#true} {2917#true} #115#return; {2917#true} is VALID [2020-07-10 15:05:17,058 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-10 15:05:17,058 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-10 15:05:17,058 INFO L280 TraceCheckUtils]: 2: Hoare triple {2917#true} assume true; {2917#true} is VALID [2020-07-10 15:05:17,058 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2917#true} {2917#true} #115#return; {2917#true} is VALID [2020-07-10 15:05:17,059 INFO L263 TraceCheckUtils]: 4: Hoare triple {2917#true} call #t~ret14 := main(); {2917#true} is VALID [2020-07-10 15:05:17,060 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-10 15:05:17,061 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-10 15:05:17,062 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-10 15:05:17,063 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-10 15:05:17,064 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-10 15:05:17,065 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-10 15:05:17,066 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-10 15:05:17,067 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-10 15:05:17,068 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-10 15:05:17,069 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-10 15:05:17,070 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-10 15:05:17,071 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-10 15:05:17,072 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-10 15:05:17,073 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-10 15:05:17,074 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-10 15:05:17,075 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-10 15:05:17,076 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-10 15:05:17,076 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-10 15:05:17,077 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-10 15:05:17,078 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-10 15:05:17,078 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-10 15:05:17,079 INFO L280 TraceCheckUtils]: 26: Hoare triple {2931#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {2918#false} is VALID [2020-07-10 15:05:17,079 INFO L280 TraceCheckUtils]: 27: Hoare triple {2918#false} assume !false; {2918#false} is VALID [2020-07-10 15:05:17,082 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-10 15:05:17,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798737674] [2020-07-10 15:05:17,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532025458] [2020-07-10 15:05:17,082 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-10 15:05:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-10 15:05:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:17,193 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-10 15:05:17,193 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,198 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,199 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,199 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-10 15:05:17,201 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:17,201 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-10 15:05:17,202 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-10 15:05:17,253 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,253 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-10 15:05:17,258 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,295 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-10 15:05:17,309 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-10 15:05:17,309 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,322 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,322 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-10 15:05:17,323 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-10 15:05:17,328 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:17,328 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-10 15:05:17,328 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-10 15:05:17,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:05:17,404 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-10 15:05:17,410 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,419 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,419 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,419 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-10 15:05:17,508 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,509 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-10 15:05:17,511 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,522 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,530 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-10 15:05:17,531 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,556 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,557 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-10 15:05:17,557 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-10 15:05:17,562 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:17,562 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-10 15:05:17,562 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-10 15:05:17,637 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-10 15:05:17,637 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-10 15:05:17,684 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-10 15:05:17,684 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-10 15:05:17,687 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,699 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,705 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-10 15:05:17,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-10 15:05:17,845 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-10 15:05:17,852 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,865 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,881 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-10 15:05:17,881 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-10 15:05:17,887 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:17,887 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-10 15:05:17,887 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-10 15:05:18,116 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-10 15:05:18,117 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:18,125 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:18,128 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-10 15:05:18,128 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-10 15:05:18,130 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:18,131 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-10 15:05:18,131 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| 1) [2020-07-10 15:05:18,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {2917#true} call ULTIMATE.init(); {2917#true} is VALID [2020-07-10 15:05:18,148 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-10 15:05:18,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {2917#true} assume true; {2917#true} is VALID [2020-07-10 15:05:18,149 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2917#true} {2917#true} #115#return; {2917#true} is VALID [2020-07-10 15:05:18,149 INFO L263 TraceCheckUtils]: 4: Hoare triple {2917#true} call #t~ret14 := main(); {2917#true} is VALID [2020-07-10 15:05:18,150 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-10 15:05:18,151 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-10 15:05:18,152 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-10 15:05:18,152 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-10 15:05:18,154 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-10 15:05:18,155 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-10 15:05:18,156 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-10 15:05:18,157 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-10 15:05:18,158 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-10 15:05:18,159 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-10 15:05:18,161 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-10 15:05:18,162 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-10 15:05:18,164 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-10 15:05:18,165 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-10 15:05:18,167 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-10 15:05:18,171 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-10 15:05:18,172 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-10 15:05:18,173 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-10 15:05:18,173 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-10 15:05:18,174 INFO L280 TraceCheckUtils]: 24: Hoare triple {3010#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {2918#false} is VALID [2020-07-10 15:05:18,174 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-10 15:05:18,174 INFO L280 TraceCheckUtils]: 26: Hoare triple {2918#false} assume 3 != #t~mem13;havoc #t~mem13; {2918#false} is VALID [2020-07-10 15:05:18,174 INFO L280 TraceCheckUtils]: 27: Hoare triple {2918#false} assume !false; {2918#false} is VALID [2020-07-10 15:05:18,180 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-10 15:05:18,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:18,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-10 15:05:18,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859492160] [2020-07-10 15:05:18,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-10 15:05:18,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:18,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 15:05:18,251 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-10 15:05:18,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 15:05:18,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 15:05:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:05:18,253 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 19 states. [2020-07-10 15:05:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:20,174 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2020-07-10 15:05:20,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 15:05:20,174 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-10 15:05:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:05:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2020-07-10 15:05:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:05:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2020-07-10 15:05:20,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2020-07-10 15:05:20,325 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-10 15:05:20,327 INFO L225 Difference]: With dead ends: 93 [2020-07-10 15:05:20,328 INFO L226 Difference]: Without dead ends: 87 [2020-07-10 15:05:20,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2020-07-10 15:05:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-10 15:05:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2020-07-10 15:05:20,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:20,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 63 states. [2020-07-10 15:05:20,363 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 63 states. [2020-07-10 15:05:20,363 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 63 states. [2020-07-10 15:05:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:20,366 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-07-10 15:05:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2020-07-10 15:05:20,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:20,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:20,367 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 87 states. [2020-07-10 15:05:20,367 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 87 states. [2020-07-10 15:05:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:20,369 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-07-10 15:05:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2020-07-10 15:05:20,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:20,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:20,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:20,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-10 15:05:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2020-07-10 15:05:20,372 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 28 [2020-07-10 15:05:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:20,372 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2020-07-10 15:05:20,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 15:05:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-10 15:05:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:05:20,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:20,373 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-10 15:05:20,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:20,586 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash -794385695, now seen corresponding path program 3 times [2020-07-10 15:05:20,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:20,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307132878] [2020-07-10 15:05:20,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:20,932 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-10 15:05:20,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {3401#true} assume true; {3401#true} is VALID [2020-07-10 15:05:20,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3401#true} {3401#true} #115#return; {3401#true} is VALID [2020-07-10 15:05:20,934 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-10 15:05:20,934 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-10 15:05:20,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2020-07-10 15:05:20,935 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3401#true} #115#return; {3401#true} is VALID [2020-07-10 15:05:20,935 INFO L263 TraceCheckUtils]: 4: Hoare triple {3401#true} call #t~ret14 := main(); {3401#true} is VALID [2020-07-10 15:05:20,936 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-10 15:05:20,937 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-10 15:05:20,937 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-10 15:05:20,938 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-10 15:05:20,939 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-10 15:05:20,940 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-10 15:05:20,941 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-10 15:05:20,942 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-10 15:05:20,943 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-10 15:05:20,944 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-10 15:05:20,946 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-10 15:05:20,947 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-10 15:05:20,949 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-10 15:05:20,950 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-10 15:05:20,951 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-10 15:05:20,952 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-10 15:05:20,953 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-10 15:05:20,954 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-10 15:05:20,955 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-10 15:05:20,972 INFO L280 TraceCheckUtils]: 24: Hoare triple {3415#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {3402#false} is VALID [2020-07-10 15:05:20,972 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-10 15:05:20,973 INFO L280 TraceCheckUtils]: 26: Hoare triple {3402#false} assume !(1 == #t~mem11);havoc #t~mem11; {3402#false} is VALID [2020-07-10 15:05:20,973 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-10 15:05:20,973 INFO L280 TraceCheckUtils]: 28: Hoare triple {3402#false} assume 3 != #t~mem13;havoc #t~mem13; {3402#false} is VALID [2020-07-10 15:05:20,973 INFO L280 TraceCheckUtils]: 29: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2020-07-10 15:05:20,978 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-10 15:05:20,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307132878] [2020-07-10 15:05:20,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495213789] [2020-07-10 15:05:20,978 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-10 15:05:21,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:05:21,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:05:21,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2020-07-10 15:05:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:21,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:21,108 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-10 15:05:21,108 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,110 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,110 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,110 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-10 15:05:21,112 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:21,113 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_29|]. (= |#valid| (store |v_#valid_29| main_~a~0.base 1)) [2020-07-10 15:05:21,113 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-10 15:05:21,194 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,195 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-10 15:05:21,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:05:21,202 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,225 INFO L624 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2020-07-10 15:05:21,226 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,226 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2020-07-10 15:05:21,235 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:21,235 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-10 15:05:21,235 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-10 15:05:21,298 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-10 15:05:21,299 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,314 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,322 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-10 15:05:21,322 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,335 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,337 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-10 15:05:21,338 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2020-07-10 15:05:21,342 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:21,342 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-10 15:05:21,343 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-10 15:05:21,424 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,425 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-10 15:05:21,427 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:05:21,429 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:05:21,430 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,452 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,454 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_22|]} [2020-07-10 15:05:21,459 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-10 15:05:21,459 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,479 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,512 INFO L350 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-07-10 15:05:21,513 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-10 15:05:21,516 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,552 INFO L624 ElimStorePlain]: treesize reduction 10, result has 84.1 percent of original size [2020-07-10 15:05:21,562 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-10 15:05:21,563 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,579 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,580 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-10 15:05:21,580 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:38 [2020-07-10 15:05:21,615 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:21,615 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-10 15:05:21,615 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-10 15:05:21,719 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,719 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-10 15:05:21,730 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-10 15:05:21,730 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:05:21,734 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,788 INFO L624 ElimStorePlain]: treesize reduction 34, result has 83.0 percent of original size [2020-07-10 15:05:21,796 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-10 15:05:21,803 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,824 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:05:21,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, 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-10 15:05:21,841 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,856 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,858 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-10 15:05:21,859 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:176, output treesize:101 [2020-07-10 15:05:21,866 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:21,866 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-10 15:05:21,866 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-10 15:05:21,947 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|, |v_#memory_$Pointer$.offset_24|], 6=[|v_#memory_$Pointer$.base_30|]} [2020-07-10 15:05:21,955 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-10 15:05:21,956 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:21,977 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,999 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:21,999 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-10 15:05:22,002 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,006 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:22,040 INFO L624 ElimStorePlain]: treesize reduction 60, result has 74.4 percent of original size [2020-07-10 15:05:22,094 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:22,094 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-10 15:05:22,129 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,138 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,149 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,156 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,169 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,172 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,179 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-10 15:05:22,187 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,196 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,205 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,212 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,223 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,259 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,267 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,288 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,300 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,303 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,317 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,325 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,334 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,340 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,351 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,355 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,369 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,379 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,388 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,394 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,405 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,415 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,448 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,456 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,463 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,474 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,477 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,485 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-10 15:05:22,494 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,504 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,513 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,520 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,535 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,539 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,554 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,565 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,574 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,581 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,594 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,598 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,613 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,628 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,638 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,645 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,674 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,689 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,716 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:05:22,732 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,742 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-10 15:05:22,750 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:05:22,765 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:05:22,769 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:05:22,774 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-10 15:05:22,827 INFO L624 ElimStorePlain]: treesize reduction 108, result has 34.5 percent of original size [2020-07-10 15:05:22,832 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-10 15:05:22,832 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:265, output treesize:105 [2020-07-10 15:05:22,844 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:22,844 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-10 15:05:22,844 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-10 15:05:22,933 INFO L440 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-07-10 15:05:22,935 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-10 15:05:22,939 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:22,953 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:22,962 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:22,963 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-10 15:05:22,967 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-10 15:05:22,974 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-10 15:05:22,977 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-10 15:05:23,001 INFO L624 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2020-07-10 15:05:23,009 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-10 15:05:23,009 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:123, output treesize:19 [2020-07-10 15:05:23,013 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:23,013 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-10 15:05:23,013 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-10 15:05:23,076 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-10 15:05:23,078 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:23,083 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:23,084 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-10 15:05:23,084 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-10 15:05:23,087 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:23,087 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-10 15:05:23,087 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-10 15:05:23,091 INFO L263 TraceCheckUtils]: 0: Hoare triple {3401#true} call ULTIMATE.init(); {3401#true} is VALID [2020-07-10 15:05:23,092 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-10 15:05:23,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2020-07-10 15:05:23,092 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3401#true} #115#return; {3401#true} is VALID [2020-07-10 15:05:23,092 INFO L263 TraceCheckUtils]: 4: Hoare triple {3401#true} call #t~ret14 := main(); {3401#true} is VALID [2020-07-10 15:05:23,093 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-10 15:05:23,093 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-10 15:05:23,094 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-10 15:05:23,095 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-10 15:05:23,096 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-10 15:05:23,096 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-10 15:05:23,097 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-10 15:05:23,098 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-10 15:05:23,099 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-10 15:05:23,100 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-10 15:05:23,102 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-10 15:05:23,107 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-10 15:05:23,108 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-10 15:05:23,109 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-10 15:05:23,109 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-10 15:05:23,112 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-10 15:05:23,113 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-10 15:05:23,114 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-10 15:05:23,115 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-10 15:05:23,115 INFO L280 TraceCheckUtils]: 24: Hoare triple {3415#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {3402#false} is VALID [2020-07-10 15:05:23,116 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-10 15:05:23,116 INFO L280 TraceCheckUtils]: 26: Hoare triple {3402#false} assume !(1 == #t~mem11);havoc #t~mem11; {3402#false} is VALID [2020-07-10 15:05:23,116 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-10 15:05:23,116 INFO L280 TraceCheckUtils]: 28: Hoare triple {3402#false} assume 3 != #t~mem13;havoc #t~mem13; {3402#false} is VALID [2020-07-10 15:05:23,117 INFO L280 TraceCheckUtils]: 29: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2020-07-10 15:05:23,120 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-10 15:05:23,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:23,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2020-07-10 15:05:23,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088235169] [2020-07-10 15:05:23,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2020-07-10 15:05:23,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:23,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 15:05:23,205 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-10 15:05:23,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 15:05:23,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 15:05:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:05:23,206 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 21 states. [2020-07-10 15:05:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:25,841 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-07-10 15:05:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:05:25,841 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2020-07-10 15:05:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:05:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2020-07-10 15:05:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:05:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2020-07-10 15:05:25,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 81 transitions. [2020-07-10 15:05:25,993 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-10 15:05:25,994 INFO L225 Difference]: With dead ends: 90 [2020-07-10 15:05:25,995 INFO L226 Difference]: Without dead ends: 84 [2020-07-10 15:05:25,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2020-07-10 15:05:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-10 15:05:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2020-07-10 15:05:26,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:26,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 68 states. [2020-07-10 15:05:26,074 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 68 states. [2020-07-10 15:05:26,074 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 68 states. [2020-07-10 15:05:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:26,076 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-10 15:05:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-10 15:05:26,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:26,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:26,077 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 84 states. [2020-07-10 15:05:26,077 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 84 states. [2020-07-10 15:05:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:26,080 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-10 15:05:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-10 15:05:26,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:26,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:26,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:26,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-10 15:05:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2020-07-10 15:05:26,083 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 30 [2020-07-10 15:05:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:26,083 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2020-07-10 15:05:26,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 15:05:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2020-07-10 15:05:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:05:26,084 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:26,084 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-10 15:05:26,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-10 15:05:26,315 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1568321631, now seen corresponding path program 1 times [2020-07-10 15:05:26,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:26,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110166763] [2020-07-10 15:05:26,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:05:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:05:26,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:05:26,417 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:05:26,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:05:26,493 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:05:26,493 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-10 15:05:26,493 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-10 15:05:26,493 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:05:26,493 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:05:26,493 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:05:26,494 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-10 15:05:26,495 WARN L170 areAnnotationChecker]: L522-3 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L525-3 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L525-3 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L532-2 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L532-2 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L525-1 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L525-1 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L532-3 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-10 15:05:26,496 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L541-3 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L541-3 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L528-1 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L528-1 has no Hoare annotation [2020-07-10 15:05:26,497 WARN L170 areAnnotationChecker]: L528-3 has no Hoare annotation [2020-07-10 15:05:26,498 WARN L170 areAnnotationChecker]: L543-2 has no Hoare annotation [2020-07-10 15:05:26,498 WARN L170 areAnnotationChecker]: L543-2 has no Hoare annotation [2020-07-10 15:05:26,498 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-10 15:05:26,498 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-10 15:05:26,498 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-10 15:05:26,498 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L535-3 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L543-3 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-10 15:05:26,499 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-10 15:05:26,500 WARN L170 areAnnotationChecker]: L545-2 has no Hoare annotation [2020-07-10 15:05:26,500 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:05:26,500 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:05:26,500 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-10 15:05:26,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:05:26 BoogieIcfgContainer [2020-07-10 15:05:26,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:05:26,505 INFO L168 Benchmark]: Toolchain (without parser) took 33629.22 ms. Allocated memory was 140.0 MB in the beginning and 437.8 MB in the end (delta: 297.8 MB). Free memory was 103.9 MB in the beginning and 387.9 MB in the end (delta: -284.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:26,505 INFO L168 Benchmark]: CDTParser took 1.90 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:05:26,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.49 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.7 MB in the beginning and 170.6 MB in the end (delta: -66.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:26,508 INFO L168 Benchmark]: Boogie Preprocessor took 105.08 ms. Allocated memory is still 204.5 MB. Free memory was 170.6 MB in the beginning and 167.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:26,508 INFO L168 Benchmark]: RCFGBuilder took 827.80 ms. Allocated memory is still 204.5 MB. Free memory was 167.1 MB in the beginning and 111.2 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:26,508 INFO L168 Benchmark]: TraceAbstraction took 32057.74 ms. Allocated memory was 204.5 MB in the beginning and 437.8 MB in the end (delta: 233.3 MB). Free memory was 111.2 MB in the beginning and 387.9 MB in the end (delta: -276.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:05:26,511 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 1.90 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 632.49 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.7 MB in the beginning and 170.6 MB in the end (delta: -66.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.08 ms. Allocated memory is still 204.5 MB. Free memory was 170.6 MB in the beginning and 167.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.80 ms. Allocated memory is still 204.5 MB. Free memory was 167.1 MB in the beginning and 111.2 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32057.74 ms. Allocated memory was 204.5 MB in the beginning and 437.8 MB in the end (delta: 233.3 MB). Free memory was 111.2 MB in the beginning and 387.9 MB in the end (delta: -276.7 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))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L528] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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))={-1:0}, malloc(sizeof(struct node))={-2: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: 31.9s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 250 SDtfs, 592 SDslu, 1460 SDs, 0 SdLazy, 2434 SolverSat, 263 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s 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...