/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-properties/list_search-1.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-8fc6572
[2020-07-11 01:03:06,747 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-11 01:03:06,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-11 01:03:06,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-11 01:03:06,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-11 01:03:06,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-11 01:03:06,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-11 01:03:06,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-11 01:03:06,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-11 01:03:06,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-11 01:03:06,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-11 01:03:06,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-11 01:03:06,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-11 01:03:06,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-11 01:03:06,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-11 01:03:06,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-11 01:03:06,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-11 01:03:06,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-11 01:03:06,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-11 01:03:06,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-11 01:03:06,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-11 01:03:06,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-11 01:03:06,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-11 01:03:06,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-11 01:03:06,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-11 01:03:06,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-11 01:03:06,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-11 01:03:06,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-11 01:03:06,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-11 01:03:06,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-11 01:03:06,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-11 01:03:06,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-11 01:03:06,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-11 01:03:06,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-11 01:03:06,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-11 01:03:06,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-11 01:03:06,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-11 01:03:06,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-11 01:03:06,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-11 01:03:06,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-11 01:03:06,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-11 01:03:06,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-07-11 01:03:06,833 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-11 01:03:06,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-11 01:03:06,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-11 01:03:06,834 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-11 01:03:06,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-11 01:03:06,835 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-11 01:03:06,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-11 01:03:06,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-11 01:03:06,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-11 01:03:06,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-11 01:03:06,836 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-11 01:03:06,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-11 01:03:06,836 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-11 01:03:06,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-11 01:03:06,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-11 01:03:06,837 INFO L138 SettingsManager]: * Size of a code block=SingleStatement
[2020-07-11 01:03:06,837 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-11 01:03:06,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-11 01:03:06,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-11 01:03:06,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-11 01:03:06,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-11 01:03:06,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-11 01:03:06,839 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true
[2020-07-11 01:03:07,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-11 01:03:07,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-11 01:03:07,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-11 01:03:07,177 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-11 01:03:07,177 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-11 01:03:07,178 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-1.i
[2020-07-11 01:03:07,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d083d4a/d80238b74fb942b09d54661cc019668f/FLAGa683e2725
[2020-07-11 01:03:07,826 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-11 01:03:07,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i
[2020-07-11 01:03:07,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d083d4a/d80238b74fb942b09d54661cc019668f/FLAGa683e2725
[2020-07-11 01:03:08,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d083d4a/d80238b74fb942b09d54661cc019668f
[2020-07-11 01:03:08,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-11 01:03:08,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-11 01:03:08,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-11 01:03:08,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-11 01:03:08,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-11 01:03:08,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a3cdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08, skipping insertion in model container
[2020-07-11 01:03:08,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-11 01:03:08,149 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-11 01:03:08,556 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-11 01:03:08,574 INFO L203 MainTranslator]: Completed pre-run
[2020-07-11 01:03:08,668 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-11 01:03:08,741 INFO L208 MainTranslator]: Completed translation
[2020-07-11 01:03:08,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08 WrapperNode
[2020-07-11 01:03:08,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-11 01:03:08,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-11 01:03:08,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-11 01:03:08,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-11 01:03:08,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (1/1) ...
[2020-07-11 01:03:08,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-11 01:03:08,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-11 01:03:08,840 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-11 01:03:08,840 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-11 01:03:08,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (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-11 01:03:08,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-11 01:03:08,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-11 01:03:08,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-11 01:03:08,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32
[2020-07-11 01:03:08,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64
[2020-07-11 01:03:08,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity
[2020-07-11 01:03:08,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity
[2020-07-11 01:03:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity
[2020-07-11 01:03:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list
[2020-07-11 01:03:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list
[2020-07-11 01:03:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-11 01:03:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-11 01:03:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-11 01:03:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max
[2020-07-11 01:03:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure atof
[2020-07-11 01:03:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure atoi
[2020-07-11 01:03:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure atol
[2020-07-11 01:03:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure atoll
[2020-07-11 01:03:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtod
[2020-07-11 01:03:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtof
[2020-07-11 01:03:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtold
[2020-07-11 01:03:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtol
[2020-07-11 01:03:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul
[2020-07-11 01:03:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq
[2020-07-11 01:03:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq
[2020-07-11 01:03:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll
[2020-07-11 01:03:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull
[2020-07-11 01:03:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure l64a
[2020-07-11 01:03:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure a64l
[2020-07-11 01:03:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32
[2020-07-11 01:03:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64
[2020-07-11 01:03:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity
[2020-07-11 01:03:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity
[2020-07-11 01:03:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity
[2020-07-11 01:03:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure select
[2020-07-11 01:03:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure pselect
[2020-07-11 01:03:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major
[2020-07-11 01:03:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor
[2020-07-11 01:03:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev
[2020-07-11 01:03:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure random
[2020-07-11 01:03:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure srandom
[2020-07-11 01:03:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure initstate
[2020-07-11 01:03:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure setstate
[2020-07-11 01:03:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure random_r
[2020-07-11 01:03:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r
[2020-07-11 01:03:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r
[2020-07-11 01:03:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r
[2020-07-11 01:03:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure rand
[2020-07-11 01:03:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure srand
[2020-07-11 01:03:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r
[2020-07-11 01:03:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure drand48
[2020-07-11 01:03:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure erand48
[2020-07-11 01:03:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48
[2020-07-11 01:03:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48
[2020-07-11 01:03:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48
[2020-07-11 01:03:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48
[2020-07-11 01:03:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure srand48
[2020-07-11 01:03:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure seed48
[2020-07-11 01:03:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48
[2020-07-11 01:03:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r
[2020-07-11 01:03:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r
[2020-07-11 01:03:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r
[2020-07-11 01:03:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r
[2020-07-11 01:03:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r
[2020-07-11 01:03:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r
[2020-07-11 01:03:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r
[2020-07-11 01:03:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r
[2020-07-11 01:03:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r
[2020-07-11 01:03:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure malloc
[2020-07-11 01:03:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure calloc
[2020-07-11 01:03:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure realloc
[2020-07-11 01:03:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure free
[2020-07-11 01:03:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure alloca
[2020-07-11 01:03:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure valloc
[2020-07-11 01:03:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign
[2020-07-11 01:03:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc
[2020-07-11 01:03:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-07-11 01:03:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure atexit
[2020-07-11 01:03:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit
[2020-07-11 01:03:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit
[2020-07-11 01:03:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure exit
[2020-07-11 01:03:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit
[2020-07-11 01:03:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit
[2020-07-11 01:03:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure getenv
[2020-07-11 01:03:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure putenv
[2020-07-11 01:03:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure setenv
[2020-07-11 01:03:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv
[2020-07-11 01:03:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv
[2020-07-11 01:03:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp
[2020-07-11 01:03:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp
[2020-07-11 01:03:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps
[2020-07-11 01:03:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp
[2020-07-11 01:03:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure system
[2020-07-11 01:03:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure realpath
[2020-07-11 01:03:08,945 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch
[2020-07-11 01:03:08,945 INFO L130 BoogieDeclarations]: Found specification of procedure qsort
[2020-07-11 01:03:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure abs
[2020-07-11 01:03:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure labs
[2020-07-11 01:03:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure llabs
[2020-07-11 01:03:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure div
[2020-07-11 01:03:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv
[2020-07-11 01:03:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv
[2020-07-11 01:03:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt
[2020-07-11 01:03:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt
[2020-07-11 01:03:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt
[2020-07-11 01:03:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt
[2020-07-11 01:03:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt
[2020-07-11 01:03:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt
[2020-07-11 01:03:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r
[2020-07-11 01:03:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r
[2020-07-11 01:03:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r
[2020-07-11 01:03:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r
[2020-07-11 01:03:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure mblen
[2020-07-11 01:03:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc
[2020-07-11 01:03:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb
[2020-07-11 01:03:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs
[2020-07-11 01:03:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs
[2020-07-11 01:03:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch
[2020-07-11 01:03:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt
[2020-07-11 01:03:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg
[2020-07-11 01:03:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure search_list
[2020-07-11 01:03:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2020-07-11 01:03:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2020-07-11 01:03:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list
[2020-07-11 01:03:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-07-11 01:03:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-07-11 01:03:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2020-07-11 01:03:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-11 01:03:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-11 01:03:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-11 01:03:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-11 01:03:09,595 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-11 01:03:09,596 INFO L295 CfgBuilder]: Removed 2 assume(true) statements.
[2020-07-11 01:03:09,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:03:09 BoogieIcfgContainer
[2020-07-11 01:03:09,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-11 01:03:09,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-11 01:03:09,602 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-11 01:03:09,606 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-11 01:03:09,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:03:08" (1/3) ...
[2020-07-11 01:03:09,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e586af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:03:09, skipping insertion in model container
[2020-07-11 01:03:09,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:08" (2/3) ...
[2020-07-11 01:03:09,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e586af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:03:09, skipping insertion in model container
[2020-07-11 01:03:09,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:03:09" (3/3) ...
[2020-07-11 01:03:09,610 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i
[2020-07-11 01:03:09,622 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-11 01:03:09,631 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-11 01:03:09,646 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-11 01:03:09,671 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-11 01:03:09,671 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-11 01:03:09,671 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-07-11 01:03:09,671 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-11 01:03:09,672 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-11 01:03:09,672 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-11 01:03:09,672 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-11 01:03:09,672 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-11 01:03:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states.
[2020-07-11 01:03:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2020-07-11 01:03:09,703 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-11 01:03:09,704 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:03:09,705 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 01:03:09,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 01:03:09,710 INFO L82 PathProgramCache]: Analyzing trace with hash 42223880, now seen corresponding path program 1 times
[2020-07-11 01:03:09,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 01:03:09,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113682796]
[2020-07-11 01:03:09,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 01:03:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:10,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {139#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID
[2020-07-11 01:03:10,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID
[2020-07-11 01:03:10,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID
[2020-07-11 01:03:10,098 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~head~0.base, ~head~0.offset := 0, 0; {79#true} is VALID
[2020-07-11 01:03:10,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} assume true; {79#true} is VALID
[2020-07-11 01:03:10,100 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID
[2020-07-11 01:03:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:10,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {141#(not (= |insert_list_#t~malloc5.base| 0))} is VALID
[2020-07-11 01:03:10,212 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,213 INFO L280 TraceCheckUtils]: 4: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,214 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0; {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {142#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#(not (= 0 ~head~0.base))} #res := 0; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {98#(not (= 0 ~head~0.base))} assume true; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,219 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {98#(not (= 0 ~head~0.base))} {79#true} #126#return; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:10,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~k := #in~k; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,291 INFO L280 TraceCheckUtils]: 4: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,294 INFO L280 TraceCheckUtils]: 5: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {144#(= 0 |old(~head~0.base)|)} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,297 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,298 INFO L280 TraceCheckUtils]: 8: Hoare triple {144#(= 0 |old(~head~0.base)|)} #res := 0; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {144#(= 0 |old(~head~0.base)|)} assume true; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,301 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {144#(= 0 |old(~head~0.base)|)} {98#(not (= 0 ~head~0.base))} #128#return; {80#false} is VALID
[2020-07-11 01:03:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:10,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID
[2020-07-11 01:03:10,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID
[2020-07-11 01:03:10,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID
[2020-07-11 01:03:10,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID
[2020-07-11 01:03:10,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID
[2020-07-11 01:03:10,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} #res := 0; {79#true} is VALID
[2020-07-11 01:03:10,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} assume true; {79#true} is VALID
[2020-07-11 01:03:10,359 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {79#true} {80#false} #130#return; {80#false} is VALID
[2020-07-11 01:03:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:10,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID
[2020-07-11 01:03:10,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID
[2020-07-11 01:03:10,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID
[2020-07-11 01:03:10,405 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID
[2020-07-11 01:03:10,405 INFO L280 TraceCheckUtils]: 6: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID
[2020-07-11 01:03:10,405 INFO L280 TraceCheckUtils]: 7: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,406 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} #res := 0; {79#true} is VALID
[2020-07-11 01:03:10,406 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} assume true; {79#true} is VALID
[2020-07-11 01:03:10,406 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {79#true} {80#false} #132#return; {80#false} is VALID
[2020-07-11 01:03:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:10,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {79#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,430 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {79#true} is VALID
[2020-07-11 01:03:10,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume !true; {80#false} is VALID
[2020-07-11 01:03:10,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#false} #res.base, #res.offset := ~l.base, ~l.offset; {80#false} is VALID
[2020-07-11 01:03:10,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {80#false} assume true; {80#false} is VALID
[2020-07-11 01:03:10,436 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {80#false} {80#false} #134#return; {80#false} is VALID
[2020-07-11 01:03:10,437 INFO L263 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {139#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-11 01:03:10,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID
[2020-07-11 01:03:10,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID
[2020-07-11 01:03:10,438 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID
[2020-07-11 01:03:10,438 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} ~head~0.base, ~head~0.offset := 0, 0; {79#true} is VALID
[2020-07-11 01:03:10,438 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume true; {79#true} is VALID
[2020-07-11 01:03:10,439 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID
[2020-07-11 01:03:10,439 INFO L263 TraceCheckUtils]: 7: Hoare triple {79#true} call #t~ret13 := main(); {79#true} is VALID
[2020-07-11 01:03:10,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} havoc ~i~0; {79#true} is VALID
[2020-07-11 01:03:10,439 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} havoc ~mylist~0.base, ~mylist~0.offset; {79#true} is VALID
[2020-07-11 01:03:10,440 INFO L280 TraceCheckUtils]: 10: Hoare triple {79#true} havoc ~temp~0.base, ~temp~0.offset; {79#true} is VALID
[2020-07-11 01:03:10,443 INFO L263 TraceCheckUtils]: 11: Hoare triple {79#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:10,444 INFO L280 TraceCheckUtils]: 12: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,444 INFO L280 TraceCheckUtils]: 13: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,445 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {141#(not (= |insert_list_#t~malloc5.base| 0))} is VALID
[2020-07-11 01:03:10,445 INFO L280 TraceCheckUtils]: 15: Hoare triple {141#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,446 INFO L280 TraceCheckUtils]: 16: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {142#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0; {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,447 INFO L280 TraceCheckUtils]: 18: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {142#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:10,448 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,448 INFO L280 TraceCheckUtils]: 20: Hoare triple {98#(not (= 0 ~head~0.base))} #res := 0; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,449 INFO L280 TraceCheckUtils]: 21: Hoare triple {98#(not (= 0 ~head~0.base))} assume true; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,450 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {98#(not (= 0 ~head~0.base))} {79#true} #126#return; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,451 INFO L280 TraceCheckUtils]: 23: Hoare triple {98#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,452 INFO L280 TraceCheckUtils]: 24: Hoare triple {98#(not (= 0 ~head~0.base))} havoc #t~ret6; {98#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:10,455 INFO L263 TraceCheckUtils]: 25: Hoare triple {98#(not (= 0 ~head~0.base))} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:10,456 INFO L280 TraceCheckUtils]: 26: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,456 INFO L280 TraceCheckUtils]: 27: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~k := #in~k; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,457 INFO L280 TraceCheckUtils]: 28: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,458 INFO L280 TraceCheckUtils]: 29: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,459 INFO L280 TraceCheckUtils]: 30: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-11 01:03:10,460 INFO L280 TraceCheckUtils]: 31: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,461 INFO L280 TraceCheckUtils]: 32: Hoare triple {144#(= 0 |old(~head~0.base)|)} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,461 INFO L280 TraceCheckUtils]: 33: Hoare triple {144#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,462 INFO L280 TraceCheckUtils]: 34: Hoare triple {144#(= 0 |old(~head~0.base)|)} #res := 0; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,463 INFO L280 TraceCheckUtils]: 35: Hoare triple {144#(= 0 |old(~head~0.base)|)} assume true; {144#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-11 01:03:10,465 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {144#(= 0 |old(~head~0.base)|)} {98#(not (= 0 ~head~0.base))} #128#return; {80#false} is VALID
[2020-07-11 01:03:10,465 INFO L280 TraceCheckUtils]: 37: Hoare triple {80#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {80#false} is VALID
[2020-07-11 01:03:10,466 INFO L280 TraceCheckUtils]: 38: Hoare triple {80#false} havoc #t~ret7; {80#false} is VALID
[2020-07-11 01:03:10,466 INFO L263 TraceCheckUtils]: 39: Hoare triple {80#false} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:10,466 INFO L280 TraceCheckUtils]: 40: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,467 INFO L280 TraceCheckUtils]: 41: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,467 INFO L280 TraceCheckUtils]: 42: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID
[2020-07-11 01:03:10,467 INFO L280 TraceCheckUtils]: 43: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID
[2020-07-11 01:03:10,468 INFO L280 TraceCheckUtils]: 44: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID
[2020-07-11 01:03:10,468 INFO L280 TraceCheckUtils]: 45: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID
[2020-07-11 01:03:10,468 INFO L280 TraceCheckUtils]: 46: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID
[2020-07-11 01:03:10,469 INFO L280 TraceCheckUtils]: 47: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,469 INFO L280 TraceCheckUtils]: 48: Hoare triple {79#true} #res := 0; {79#true} is VALID
[2020-07-11 01:03:10,469 INFO L280 TraceCheckUtils]: 49: Hoare triple {79#true} assume true; {79#true} is VALID
[2020-07-11 01:03:10,470 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {79#true} {80#false} #130#return; {80#false} is VALID
[2020-07-11 01:03:10,470 INFO L280 TraceCheckUtils]: 51: Hoare triple {80#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {80#false} is VALID
[2020-07-11 01:03:10,470 INFO L280 TraceCheckUtils]: 52: Hoare triple {80#false} havoc #t~ret8; {80#false} is VALID
[2020-07-11 01:03:10,470 INFO L263 TraceCheckUtils]: 53: Hoare triple {80#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:10,471 INFO L280 TraceCheckUtils]: 54: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,471 INFO L280 TraceCheckUtils]: 55: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,471 INFO L280 TraceCheckUtils]: 56: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID
[2020-07-11 01:03:10,472 INFO L280 TraceCheckUtils]: 57: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID
[2020-07-11 01:03:10,472 INFO L280 TraceCheckUtils]: 58: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID
[2020-07-11 01:03:10,472 INFO L280 TraceCheckUtils]: 59: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID
[2020-07-11 01:03:10,473 INFO L280 TraceCheckUtils]: 60: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID
[2020-07-11 01:03:10,473 INFO L280 TraceCheckUtils]: 61: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,473 INFO L280 TraceCheckUtils]: 62: Hoare triple {79#true} #res := 0; {79#true} is VALID
[2020-07-11 01:03:10,473 INFO L280 TraceCheckUtils]: 63: Hoare triple {79#true} assume true; {79#true} is VALID
[2020-07-11 01:03:10,474 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {79#true} {80#false} #132#return; {80#false} is VALID
[2020-07-11 01:03:10,474 INFO L280 TraceCheckUtils]: 65: Hoare triple {80#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {80#false} is VALID
[2020-07-11 01:03:10,474 INFO L280 TraceCheckUtils]: 66: Hoare triple {80#false} havoc #t~ret9; {80#false} is VALID
[2020-07-11 01:03:10,475 INFO L263 TraceCheckUtils]: 67: Hoare triple {80#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {79#true} is VALID
[2020-07-11 01:03:10,475 INFO L280 TraceCheckUtils]: 68: Hoare triple {79#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID
[2020-07-11 01:03:10,475 INFO L280 TraceCheckUtils]: 69: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID
[2020-07-11 01:03:10,476 INFO L280 TraceCheckUtils]: 70: Hoare triple {79#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {79#true} is VALID
[2020-07-11 01:03:10,477 INFO L280 TraceCheckUtils]: 71: Hoare triple {79#true} assume !true; {80#false} is VALID
[2020-07-11 01:03:10,478 INFO L280 TraceCheckUtils]: 72: Hoare triple {80#false} #res.base, #res.offset := ~l.base, ~l.offset; {80#false} is VALID
[2020-07-11 01:03:10,478 INFO L280 TraceCheckUtils]: 73: Hoare triple {80#false} assume true; {80#false} is VALID
[2020-07-11 01:03:10,478 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {80#false} {80#false} #134#return; {80#false} is VALID
[2020-07-11 01:03:10,479 INFO L280 TraceCheckUtils]: 75: Hoare triple {80#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset; {80#false} is VALID
[2020-07-11 01:03:10,479 INFO L280 TraceCheckUtils]: 76: Hoare triple {80#false} havoc #t~ret10.base, #t~ret10.offset; {80#false} is VALID
[2020-07-11 01:03:10,479 INFO L280 TraceCheckUtils]: 77: Hoare triple {80#false} SUMMARY for call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); srcloc: L550 {80#false} is VALID
[2020-07-11 01:03:10,480 INFO L263 TraceCheckUtils]: 78: Hoare triple {80#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {80#false} is VALID
[2020-07-11 01:03:10,480 INFO L280 TraceCheckUtils]: 79: Hoare triple {80#false} ~cond := #in~cond; {80#false} is VALID
[2020-07-11 01:03:10,480 INFO L280 TraceCheckUtils]: 80: Hoare triple {80#false} assume 0 == ~cond; {80#false} is VALID
[2020-07-11 01:03:10,480 INFO L280 TraceCheckUtils]: 81: Hoare triple {80#false} assume !false; {80#false} is VALID
[2020-07-11 01:03:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2020-07-11 01:03:10,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113682796]
[2020-07-11 01:03:10,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-07-11 01:03:10,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2020-07-11 01:03:10,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238479330]
[2020-07-11 01:03:10,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82
[2020-07-11 01:03:10,508 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-11 01:03:10,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-11 01:03:10,629 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-11 01:03:10,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-11 01:03:10,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 01:03:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-11 01:03:10,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2020-07-11 01:03:10,643 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 9 states.
[2020-07-11 01:03:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 01:03:12,786 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions.
[2020-07-11 01:03:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2020-07-11 01:03:12,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82
[2020-07-11 01:03:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 01:03:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-11 01:03:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 225 transitions.
[2020-07-11 01:03:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-11 01:03:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 225 transitions.
[2020-07-11 01:03:12,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 225 transitions.
[2020-07-11 01:03:13,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-11 01:03:13,159 INFO L225 Difference]: With dead ends: 187
[2020-07-11 01:03:13,159 INFO L226 Difference]: Without dead ends: 92
[2020-07-11 01:03:13,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380
[2020-07-11 01:03:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2020-07-11 01:03:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73.
[2020-07-11 01:03:13,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 01:03:13,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 73 states.
[2020-07-11 01:03:13,398 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 73 states.
[2020-07-11 01:03:13,398 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 73 states.
[2020-07-11 01:03:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 01:03:13,419 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions.
[2020-07-11 01:03:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions.
[2020-07-11 01:03:13,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 01:03:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 01:03:13,422 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 92 states.
[2020-07-11 01:03:13,422 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 92 states.
[2020-07-11 01:03:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 01:03:13,430 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions.
[2020-07-11 01:03:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions.
[2020-07-11 01:03:13,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 01:03:13,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 01:03:13,433 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-11 01:03:13,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 01:03:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states.
[2020-07-11 01:03:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions.
[2020-07-11 01:03:13,439 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 82
[2020-07-11 01:03:13,440 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-11 01:03:13,440 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions.
[2020-07-11 01:03:13,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-11 01:03:13,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 78 transitions.
[2020-07-11 01:03:13,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-11 01:03:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions.
[2020-07-11 01:03:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2020-07-11 01:03:13,573 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-11 01:03:13,574 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:03:13,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-11 01:03:13,574 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 01:03:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 01:03:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1050718625, now seen corresponding path program 1 times
[2020-07-11 01:03:13,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 01:03:13,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1979377557]
[2020-07-11 01:03:13,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 01:03:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:13,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {944#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {877#true} is VALID
[2020-07-11 01:03:13,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} #valid := #valid[0 := 0]; {877#true} is VALID
[2020-07-11 01:03:13,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} assume 0 < #StackHeapBarrier; {877#true} is VALID
[2020-07-11 01:03:13,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~head~0.base, ~head~0.offset := 0, 0; {877#true} is VALID
[2020-07-11 01:03:13,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,737 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {877#true} {877#true} #138#return; {877#true} is VALID
[2020-07-11 01:03:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:13,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID
[2020-07-11 01:03:13,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID
[2020-07-11 01:03:13,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID
[2020-07-11 01:03:13,773 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {877#true} is VALID
[2020-07-11 01:03:13,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {877#true} is VALID
[2020-07-11 01:03:13,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} #res := 0; {877#true} is VALID
[2020-07-11 01:03:13,774 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,774 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #126#return; {877#true} is VALID
[2020-07-11 01:03:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:13,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID
[2020-07-11 01:03:13,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID
[2020-07-11 01:03:13,785 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID
[2020-07-11 01:03:13,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID
[2020-07-11 01:03:13,786 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID
[2020-07-11 01:03:13,787 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID
[2020-07-11 01:03:13,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,787 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} #res := 0; {877#true} is VALID
[2020-07-11 01:03:13,787 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,788 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {877#true} {877#true} #128#return; {877#true} is VALID
[2020-07-11 01:03:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:13,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID
[2020-07-11 01:03:13,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID
[2020-07-11 01:03:13,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID
[2020-07-11 01:03:13,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID
[2020-07-11 01:03:13,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID
[2020-07-11 01:03:13,803 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID
[2020-07-11 01:03:13,803 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,804 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} #res := 0; {877#true} is VALID
[2020-07-11 01:03:13,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,804 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {877#true} {877#true} #130#return; {877#true} is VALID
[2020-07-11 01:03:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:13,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {946#(not (= |insert_list_#t~malloc5.base| 0))} is VALID
[2020-07-11 01:03:13,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {946#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,881 INFO L280 TraceCheckUtils]: 4: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,882 INFO L280 TraceCheckUtils]: 5: Hoare triple {947#(not (= 0 insert_list_~l.base))} assume !(~head~0.base == 0 && ~head~0.offset == 0); {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,882 INFO L280 TraceCheckUtils]: 6: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {947#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {932#(not (= 0 ~head~0.base))} #res := 0; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {932#(not (= 0 ~head~0.base))} assume true; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,889 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {932#(not (= 0 ~head~0.base))} {877#true} #132#return; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:13,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {877#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {948#(= search_list_~l.base ~head~0.base)} is VALID
[2020-07-11 01:03:13,947 INFO L280 TraceCheckUtils]: 3: Hoare triple {948#(= search_list_~l.base ~head~0.base)} #t~short3 := ~l.base != 0 || ~l.offset != 0; {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} is VALID
[2020-07-11 01:03:13,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,949 INFO L280 TraceCheckUtils]: 5: Hoare triple {950#(= 0 ~head~0.base)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~mem2; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,950 INFO L280 TraceCheckUtils]: 7: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~short3; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {950#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,951 INFO L280 TraceCheckUtils]: 9: Hoare triple {950#(= 0 ~head~0.base)} assume true; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,953 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {950#(= 0 ~head~0.base)} {932#(not (= 0 ~head~0.base))} #134#return; {878#false} is VALID
[2020-07-11 01:03:13,954 INFO L263 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {944#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-11 01:03:13,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {944#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {877#true} is VALID
[2020-07-11 01:03:13,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} #valid := #valid[0 := 0]; {877#true} is VALID
[2020-07-11 01:03:13,955 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} assume 0 < #StackHeapBarrier; {877#true} is VALID
[2020-07-11 01:03:13,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} ~head~0.base, ~head~0.offset := 0, 0; {877#true} is VALID
[2020-07-11 01:03:13,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,956 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {877#true} {877#true} #138#return; {877#true} is VALID
[2020-07-11 01:03:13,956 INFO L263 TraceCheckUtils]: 7: Hoare triple {877#true} call #t~ret13 := main(); {877#true} is VALID
[2020-07-11 01:03:13,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} havoc ~i~0; {877#true} is VALID
[2020-07-11 01:03:13,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} havoc ~mylist~0.base, ~mylist~0.offset; {877#true} is VALID
[2020-07-11 01:03:13,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#true} havoc ~temp~0.base, ~temp~0.offset; {877#true} is VALID
[2020-07-11 01:03:13,959 INFO L263 TraceCheckUtils]: 11: Hoare triple {877#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:13,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID
[2020-07-11 01:03:13,960 INFO L280 TraceCheckUtils]: 15: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID
[2020-07-11 01:03:13,960 INFO L280 TraceCheckUtils]: 16: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID
[2020-07-11 01:03:13,961 INFO L280 TraceCheckUtils]: 17: Hoare triple {877#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {877#true} is VALID
[2020-07-11 01:03:13,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {877#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {877#true} is VALID
[2020-07-11 01:03:13,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,962 INFO L280 TraceCheckUtils]: 20: Hoare triple {877#true} #res := 0; {877#true} is VALID
[2020-07-11 01:03:13,962 INFO L280 TraceCheckUtils]: 21: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,962 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {877#true} {877#true} #126#return; {877#true} is VALID
[2020-07-11 01:03:13,963 INFO L280 TraceCheckUtils]: 23: Hoare triple {877#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {877#true} is VALID
[2020-07-11 01:03:13,963 INFO L280 TraceCheckUtils]: 24: Hoare triple {877#true} havoc #t~ret6; {877#true} is VALID
[2020-07-11 01:03:13,965 INFO L263 TraceCheckUtils]: 25: Hoare triple {877#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:13,965 INFO L280 TraceCheckUtils]: 26: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,966 INFO L280 TraceCheckUtils]: 27: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,966 INFO L280 TraceCheckUtils]: 28: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID
[2020-07-11 01:03:13,966 INFO L280 TraceCheckUtils]: 29: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID
[2020-07-11 01:03:13,966 INFO L280 TraceCheckUtils]: 30: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID
[2020-07-11 01:03:13,967 INFO L280 TraceCheckUtils]: 31: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID
[2020-07-11 01:03:13,967 INFO L280 TraceCheckUtils]: 32: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID
[2020-07-11 01:03:13,968 INFO L280 TraceCheckUtils]: 33: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID
[2020-07-11 01:03:13,968 INFO L280 TraceCheckUtils]: 34: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,968 INFO L280 TraceCheckUtils]: 35: Hoare triple {877#true} #res := 0; {877#true} is VALID
[2020-07-11 01:03:13,969 INFO L280 TraceCheckUtils]: 36: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,969 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {877#true} {877#true} #128#return; {877#true} is VALID
[2020-07-11 01:03:13,969 INFO L280 TraceCheckUtils]: 38: Hoare triple {877#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {877#true} is VALID
[2020-07-11 01:03:13,969 INFO L280 TraceCheckUtils]: 39: Hoare triple {877#true} havoc #t~ret7; {877#true} is VALID
[2020-07-11 01:03:13,971 INFO L263 TraceCheckUtils]: 40: Hoare triple {877#true} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:13,972 INFO L280 TraceCheckUtils]: 41: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,972 INFO L280 TraceCheckUtils]: 42: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,973 INFO L280 TraceCheckUtils]: 43: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID
[2020-07-11 01:03:13,973 INFO L280 TraceCheckUtils]: 44: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID
[2020-07-11 01:03:13,973 INFO L280 TraceCheckUtils]: 45: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID
[2020-07-11 01:03:13,974 INFO L280 TraceCheckUtils]: 46: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID
[2020-07-11 01:03:13,974 INFO L280 TraceCheckUtils]: 47: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID
[2020-07-11 01:03:13,974 INFO L280 TraceCheckUtils]: 48: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID
[2020-07-11 01:03:13,974 INFO L280 TraceCheckUtils]: 49: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,975 INFO L280 TraceCheckUtils]: 50: Hoare triple {877#true} #res := 0; {877#true} is VALID
[2020-07-11 01:03:13,975 INFO L280 TraceCheckUtils]: 51: Hoare triple {877#true} assume true; {877#true} is VALID
[2020-07-11 01:03:13,975 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {877#true} {877#true} #130#return; {877#true} is VALID
[2020-07-11 01:03:13,976 INFO L280 TraceCheckUtils]: 53: Hoare triple {877#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {877#true} is VALID
[2020-07-11 01:03:13,976 INFO L280 TraceCheckUtils]: 54: Hoare triple {877#true} havoc #t~ret8; {877#true} is VALID
[2020-07-11 01:03:13,978 INFO L263 TraceCheckUtils]: 55: Hoare triple {877#true} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-11 01:03:13,978 INFO L280 TraceCheckUtils]: 56: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,979 INFO L280 TraceCheckUtils]: 57: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,980 INFO L280 TraceCheckUtils]: 58: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {946#(not (= |insert_list_#t~malloc5.base| 0))} is VALID
[2020-07-11 01:03:13,981 INFO L280 TraceCheckUtils]: 59: Hoare triple {946#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,982 INFO L280 TraceCheckUtils]: 60: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,982 INFO L280 TraceCheckUtils]: 61: Hoare triple {947#(not (= 0 insert_list_~l.base))} assume !(~head~0.base == 0 && ~head~0.offset == 0); {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,983 INFO L280 TraceCheckUtils]: 62: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,984 INFO L280 TraceCheckUtils]: 63: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {947#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-11 01:03:13,985 INFO L280 TraceCheckUtils]: 64: Hoare triple {947#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,986 INFO L280 TraceCheckUtils]: 65: Hoare triple {932#(not (= 0 ~head~0.base))} #res := 0; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,986 INFO L280 TraceCheckUtils]: 66: Hoare triple {932#(not (= 0 ~head~0.base))} assume true; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,988 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {932#(not (= 0 ~head~0.base))} {877#true} #132#return; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,989 INFO L280 TraceCheckUtils]: 68: Hoare triple {932#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,990 INFO L280 TraceCheckUtils]: 69: Hoare triple {932#(not (= 0 ~head~0.base))} havoc #t~ret9; {932#(not (= 0 ~head~0.base))} is VALID
[2020-07-11 01:03:13,990 INFO L263 TraceCheckUtils]: 70: Hoare triple {932#(not (= 0 ~head~0.base))} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {877#true} is VALID
[2020-07-11 01:03:13,990 INFO L280 TraceCheckUtils]: 71: Hoare triple {877#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID
[2020-07-11 01:03:13,991 INFO L280 TraceCheckUtils]: 72: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID
[2020-07-11 01:03:13,992 INFO L280 TraceCheckUtils]: 73: Hoare triple {877#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {948#(= search_list_~l.base ~head~0.base)} is VALID
[2020-07-11 01:03:13,993 INFO L280 TraceCheckUtils]: 74: Hoare triple {948#(= search_list_~l.base ~head~0.base)} #t~short3 := ~l.base != 0 || ~l.offset != 0; {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} is VALID
[2020-07-11 01:03:13,994 INFO L280 TraceCheckUtils]: 75: Hoare triple {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,995 INFO L280 TraceCheckUtils]: 76: Hoare triple {950#(= 0 ~head~0.base)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,995 INFO L280 TraceCheckUtils]: 77: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~mem2; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,996 INFO L280 TraceCheckUtils]: 78: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~short3; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,997 INFO L280 TraceCheckUtils]: 79: Hoare triple {950#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:13,998 INFO L280 TraceCheckUtils]: 80: Hoare triple {950#(= 0 ~head~0.base)} assume true; {950#(= 0 ~head~0.base)} is VALID
[2020-07-11 01:03:14,000 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {950#(= 0 ~head~0.base)} {932#(not (= 0 ~head~0.base))} #134#return; {878#false} is VALID
[2020-07-11 01:03:14,000 INFO L280 TraceCheckUtils]: 82: Hoare triple {878#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset; {878#false} is VALID
[2020-07-11 01:03:14,001 INFO L280 TraceCheckUtils]: 83: Hoare triple {878#false} havoc #t~ret10.base, #t~ret10.offset; {878#false} is VALID
[2020-07-11 01:03:14,001 INFO L280 TraceCheckUtils]: 84: Hoare triple {878#false} SUMMARY for call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); srcloc: L550 {878#false} is VALID
[2020-07-11 01:03:14,001 INFO L263 TraceCheckUtils]: 85: Hoare triple {878#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {878#false} is VALID
[2020-07-11 01:03:14,002 INFO L280 TraceCheckUtils]: 86: Hoare triple {878#false} ~cond := #in~cond; {878#false} is VALID
[2020-07-11 01:03:14,002 INFO L280 TraceCheckUtils]: 87: Hoare triple {878#false} assume 0 == ~cond; {878#false} is VALID
[2020-07-11 01:03:14,002 INFO L280 TraceCheckUtils]: 88: Hoare triple {878#false} assume !false; {878#false} is VALID
[2020-07-11 01:03:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2020-07-11 01:03:14,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1979377557]
[2020-07-11 01:03:14,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 01:03:14,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-07-11 01:03:14,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871216669]
[2020-07-11 01:03:14,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89
[2020-07-11 01:03:14,019 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-11 01:03:14,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states.
[2020-07-11 01:03:14,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-11 01:03:14,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-07-11 01:03:14,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 01:03:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-07-11 01:03:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2020-07-11 01:03:14,113 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 10 states.
[2020-07-11 01:03:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 01:03:15,928 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions.
[2020-07-11 01:03:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-07-11 01:03:15,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89
[2020-07-11 01:03:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 01:03:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-11 01:03:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions.
[2020-07-11 01:03:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-11 01:03:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions.
[2020-07-11 01:03:15,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 117 transitions.
[2020-07-11 01:03:16,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-11 01:03:16,140 INFO L225 Difference]: With dead ends: 113
[2020-07-11 01:03:16,140 INFO L226 Difference]: Without dead ends: 90
[2020-07-11 01:03:16,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380
[2020-07-11 01:03:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2020-07-11 01:03:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75.
[2020-07-11 01:03:16,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 01:03:16,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 75 states.
[2020-07-11 01:03:16,348 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 75 states.
[2020-07-11 01:03:16,348 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 75 states.
[2020-07-11 01:03:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 01:03:16,353 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions.
[2020-07-11 01:03:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions.
[2020-07-11 01:03:16,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 01:03:16,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 01:03:16,355 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 90 states.
[2020-07-11 01:03:16,355 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 90 states.
[2020-07-11 01:03:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 01:03:16,360 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions.
[2020-07-11 01:03:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions.
[2020-07-11 01:03:16,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 01:03:16,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 01:03:16,362 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-11 01:03:16,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 01:03:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2020-07-11 01:03:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions.
[2020-07-11 01:03:16,366 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 89
[2020-07-11 01:03:16,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-11 01:03:16,366 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions.
[2020-07-11 01:03:16,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-07-11 01:03:16,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 80 transitions.
[2020-07-11 01:03:16,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-11 01:03:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions.
[2020-07-11 01:03:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2020-07-11 01:03:16,501 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-11 01:03:16,501 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:03:16,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-11 01:03:16,502 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 01:03:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 01:03:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1346991358, now seen corresponding path program 1 times
[2020-07-11 01:03:16,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 01:03:16,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900086432]
[2020-07-11 01:03:16,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 01:03:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 01:03:16,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-11 01:03:16,562 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.AssertionError
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:415)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:297)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:279)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:135)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:236)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:213)
at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:874)
at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:391)
at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:385)
at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:332)
at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:332)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.<init>(NestedInterpolantsBuilder.java:166)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:337)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:239)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.<init>(InterpolatingTraceCheckCraig.java:108)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:75)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:127)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55)
[2020-07-11 01:03:16,569 INFO L168 Benchmark]: Toolchain (without parser) took 8472.89 ms. Allocated memory was 135.3 MB in the beginning and 336.6 MB in the end (delta: 201.3 MB). Free memory was 98.2 MB in the beginning and 97.3 MB in the end (delta: 838.9 kB). Peak memory consumption was 202.2 MB. Max. memory is 7.1 GB.
[2020-07-11 01:03:16,570 INFO L168 Benchmark]: CDTParser took 0.99 ms. Allocated memory is still 135.3 MB. Free memory was 117.5 MB in the beginning and 117.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-11 01:03:16,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.79 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 98.0 MB in the beginning and 165.9 MB in the end (delta: -67.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB.
[2020-07-11 01:03:16,572 INFO L168 Benchmark]: Boogie Preprocessor took 97.17 ms. Allocated memory is still 200.8 MB. Free memory was 165.9 MB in the beginning and 162.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB.
[2020-07-11 01:03:16,572 INFO L168 Benchmark]: RCFGBuilder took 760.57 ms. Allocated memory is still 200.8 MB. Free memory was 162.4 MB in the beginning and 100.2 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB.
[2020-07-11 01:03:16,573 INFO L168 Benchmark]: TraceAbstraction took 6963.70 ms. Allocated memory was 200.8 MB in the beginning and 336.6 MB in the end (delta: 135.8 MB). Free memory was 99.5 MB in the beginning and 97.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 138.0 MB. Max. memory is 7.1 GB.
[2020-07-11 01:03:16,578 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.99 ms. Allocated memory is still 135.3 MB. Free memory was 117.5 MB in the beginning and 117.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 644.79 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 98.0 MB in the beginning and 165.9 MB in the end (delta: -67.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 97.17 ms. Allocated memory is still 200.8 MB. Free memory was 165.9 MB in the beginning and 162.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 760.57 ms. Allocated memory is still 200.8 MB. Free memory was 162.4 MB in the beginning and 100.2 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 6963.70 ms. Allocated memory was 200.8 MB in the beginning and 336.6 MB in the end (delta: 135.8 MB). Free memory was 99.5 MB in the beginning and 97.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 138.0 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: AssertionError: null
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Received shutdown request...