/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list_search-1.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-8fc6572
[2020-07-10 15:05:04,148 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-10 15:05:04,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 15:05:04,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 15:05:04,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 15:05:04,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 15:05:04,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 15:05:04,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 15:05:04,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 15:05:04,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 15:05:04,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 15:05:04,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 15:05:04,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 15:05:04,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 15:05:04,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 15:05:04,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 15:05:04,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 15:05:04,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 15:05:04,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 15:05:04,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 15:05:04,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 15:05:04,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 15:05:04,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 15:05:04,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 15:05:04,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 15:05:04,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 15:05:04,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 15:05:04,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 15:05:04,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 15:05:04,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 15:05:04,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 15:05:04,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 15:05:04,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 15:05:04,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 15:05:04,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 15:05:04,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 15:05:04,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 15:05:04,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 15:05:04,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 15:05:04,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 15:05:04,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 15:05:04,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-07-10 15:05:04,273 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-10 15:05:04,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 15:05:04,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-10 15:05:04,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-07-10 15:05:04,277 INFO L138 SettingsManager]: * Use SBE=true
[2020-07-10 15:05:04,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 15:05:04,280 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-10 15:05:04,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-10 15:05:04,281 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-10 15:05:04,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-10 15:05:04,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 15:05:04,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 15:05:04,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 15:05:04,282 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-10 15:05:04,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-10 15:05:04,282 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-10 15:05:04,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-10 15:05:04,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 15:05:04,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-07-10 15:05:04,283 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-10 15:05:04,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-10 15:05:04,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 15:05:04,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 15:05:04,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-07-10 15:05:04,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-10 15:05:04,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-07-10 15:05:04,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-10 15:05:04,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 15:05:04,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-07-10 15:05:04,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-07-10 15:05:04,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 15:05:04,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 15:05:04,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 15:05:04,590 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-10 15:05:04,590 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-10 15:05:04,591 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-10 15:05:04,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0f37029/f2a9d0ff47d54623936e89af0192c620/FLAGf7f5e44f7
[2020-07-10 15:05:05,221 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-10 15:05:05,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i
[2020-07-10 15:05:05,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0f37029/f2a9d0ff47d54623936e89af0192c620/FLAGf7f5e44f7
[2020-07-10 15:05:05,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0f37029/f2a9d0ff47d54623936e89af0192c620
[2020-07-10 15:05:05,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 15:05:05,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 15:05:05,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 15:05:05,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 15:05:05,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 15:05:05,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:05" (1/1) ...
[2020-07-10 15:05:05,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af7a474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:05, skipping insertion in model container
[2020-07-10 15:05:05,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:05" (1/1) ...
[2020-07-10 15:05:05,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-10 15:05:05,580 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-10 15:05:06,037 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:05:06,051 INFO L203 MainTranslator]: Completed pre-run
[2020-07-10 15:05:06,135 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:05:06,212 INFO L208 MainTranslator]: Completed translation
[2020-07-10 15:05:06,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06 WrapperNode
[2020-07-10 15:05:06,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 15:05:06,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 15:05:06,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 15:05:06,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 15:05:06,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
[2020-07-10 15:05:06,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
[2020-07-10 15:05:06,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
[2020-07-10 15:05:06,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
[2020-07-10 15:05:06,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
[2020-07-10 15:05:06,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
[2020-07-10 15:05:06,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
[2020-07-10 15:05:06,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 15:05:06,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 15:05:06,279 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 15:05:06,279 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-10 15:05:06,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 15:05:06,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 15:05:06,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 15:05:06,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-10 15:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32
[2020-07-10 15:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64
[2020-07-10 15:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity
[2020-07-10 15:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity
[2020-07-10 15:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity
[2020-07-10 15:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list
[2020-07-10 15:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list
[2020-07-10 15:05:06,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 15:05:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 15:05:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-10 15:05:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max
[2020-07-10 15:05:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure atof
[2020-07-10 15:05:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure atoi
[2020-07-10 15:05:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure atol
[2020-07-10 15:05:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure atoll
[2020-07-10 15:05:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtod
[2020-07-10 15:05:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtof
[2020-07-10 15:05:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtold
[2020-07-10 15:05:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtol
[2020-07-10 15:05:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul
[2020-07-10 15:05:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq
[2020-07-10 15:05:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq
[2020-07-10 15:05:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll
[2020-07-10 15:05:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull
[2020-07-10 15:05:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure l64a
[2020-07-10 15:05:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure a64l
[2020-07-10 15:05:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32
[2020-07-10 15:05:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64
[2020-07-10 15:05:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity
[2020-07-10 15:05:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity
[2020-07-10 15:05:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity
[2020-07-10 15:05:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure select
[2020-07-10 15:05:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure pselect
[2020-07-10 15:05:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major
[2020-07-10 15:05:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor
[2020-07-10 15:05:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev
[2020-07-10 15:05:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure random
[2020-07-10 15:05:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure srandom
[2020-07-10 15:05:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure initstate
[2020-07-10 15:05:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure setstate
[2020-07-10 15:05:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure random_r
[2020-07-10 15:05:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r
[2020-07-10 15:05:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r
[2020-07-10 15:05:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r
[2020-07-10 15:05:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure rand
[2020-07-10 15:05:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure srand
[2020-07-10 15:05:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r
[2020-07-10 15:05:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure drand48
[2020-07-10 15:05:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure erand48
[2020-07-10 15:05:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48
[2020-07-10 15:05:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48
[2020-07-10 15:05:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48
[2020-07-10 15:05:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48
[2020-07-10 15:05:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure srand48
[2020-07-10 15:05:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure seed48
[2020-07-10 15:05:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48
[2020-07-10 15:05:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r
[2020-07-10 15:05:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r
[2020-07-10 15:05:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r
[2020-07-10 15:05:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r
[2020-07-10 15:05:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r
[2020-07-10 15:05:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r
[2020-07-10 15:05:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r
[2020-07-10 15:05:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r
[2020-07-10 15:05:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r
[2020-07-10 15:05:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure malloc
[2020-07-10 15:05:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure calloc
[2020-07-10 15:05:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure realloc
[2020-07-10 15:05:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure free
[2020-07-10 15:05:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure alloca
[2020-07-10 15:05:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure valloc
[2020-07-10 15:05:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign
[2020-07-10 15:05:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc
[2020-07-10 15:05:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-07-10 15:05:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure atexit
[2020-07-10 15:05:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit
[2020-07-10 15:05:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit
[2020-07-10 15:05:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure exit
[2020-07-10 15:05:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit
[2020-07-10 15:05:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit
[2020-07-10 15:05:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure getenv
[2020-07-10 15:05:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure putenv
[2020-07-10 15:05:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure setenv
[2020-07-10 15:05:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv
[2020-07-10 15:05:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv
[2020-07-10 15:05:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp
[2020-07-10 15:05:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp
[2020-07-10 15:05:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps
[2020-07-10 15:05:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp
[2020-07-10 15:05:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure system
[2020-07-10 15:05:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure realpath
[2020-07-10 15:05:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch
[2020-07-10 15:05:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure qsort
[2020-07-10 15:05:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure abs
[2020-07-10 15:05:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure labs
[2020-07-10 15:05:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure llabs
[2020-07-10 15:05:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure div
[2020-07-10 15:05:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv
[2020-07-10 15:05:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv
[2020-07-10 15:05:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt
[2020-07-10 15:05:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt
[2020-07-10 15:05:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt
[2020-07-10 15:05:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt
[2020-07-10 15:05:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt
[2020-07-10 15:05:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt
[2020-07-10 15:05:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r
[2020-07-10 15:05:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r
[2020-07-10 15:05:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r
[2020-07-10 15:05:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r
[2020-07-10 15:05:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure mblen
[2020-07-10 15:05:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc
[2020-07-10 15:05:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb
[2020-07-10 15:05:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs
[2020-07-10 15:05:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs
[2020-07-10 15:05:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch
[2020-07-10 15:05:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt
[2020-07-10 15:05:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg
[2020-07-10 15:05:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure search_list
[2020-07-10 15:05:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2020-07-10 15:05:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2020-07-10 15:05:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list
[2020-07-10 15:05:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-07-10 15:05:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-07-10 15:05:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2020-07-10 15:05:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-10 15:05:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-10 15:05:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 15:05:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 15:05:06,983 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 15:05:06,984 INFO L295 CfgBuilder]: Removed 2 assume(true) statements.
[2020-07-10 15:05:06,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:06 BoogieIcfgContainer
[2020-07-10 15:05:06,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 15:05:06,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 15:05:06,989 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 15:05:06,992 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-10 15:05:06,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:05:05" (1/3) ...
[2020-07-10 15:05:06,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecc135a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:06, skipping insertion in model container
[2020-07-10 15:05:06,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:06" (2/3) ...
[2020-07-10 15:05:06,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecc135a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:06, skipping insertion in model container
[2020-07-10 15:05:06,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:06" (3/3) ...
[2020-07-10 15:05:06,996 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i
[2020-07-10 15:05:07,007 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-07-10 15:05:07,015 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 15:05:07,028 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 15:05:07,047 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-10 15:05:07,047 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-10 15:05:07,047 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-07-10 15:05:07,047 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 15:05:07,048 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 15:05:07,048 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-10 15:05:07,048 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 15:05:07,048 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 15:05:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states.
[2020-07-10 15:05:07,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2020-07-10 15:05:07,074 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:05:07,075 INFO L422 BasicCegarLoop]: trace histogram [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]
[2020-07-10 15:05:07,076 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:05:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:05:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash -125905961, now seen corresponding path program 1 times
[2020-07-10 15:05:07,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:05:07,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994507065]
[2020-07-10 15:05:07,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:05:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {75#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID
[2020-07-10 15:05:07,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,455 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #96#return; {44#true} is VALID
[2020-07-10 15:05:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:07,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:07,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {54#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:07,545 INFO L280 TraceCheckUtils]: 3: Hoare triple {54#(not (= 0 ~head~0.base))} assume true; {54#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:07,547 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {54#(not (= 0 ~head~0.base))} {44#true} #84#return; {54#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {78#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-10 15:05:07,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {79#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:07,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {79#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:07,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#(= 0 |old(~head~0.base)|)} assume true; {79#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:07,611 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {79#(= 0 |old(~head~0.base)|)} {54#(not (= 0 ~head~0.base))} #86#return; {45#false} is VALID
[2020-07-10 15:05:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:07,630 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,631 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#true} {45#false} #88#return; {45#false} is VALID
[2020-07-10 15:05:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:07,649 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,650 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#true} {45#false} #90#return; {45#false} is VALID
[2020-07-10 15:05:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID
[2020-07-10 15:05:07,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume !true; {45#false} is VALID
[2020-07-10 15:05:07,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#false} #res.base, #res.offset := ~l.base, ~l.offset; {45#false} is VALID
[2020-07-10 15:05:07,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#false} assume true; {45#false} is VALID
[2020-07-10 15:05:07,660 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {45#false} {45#false} #92#return; {45#false} is VALID
[2020-07-10 15:05:07,661 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {75#(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-10 15:05:07,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID
[2020-07-10 15:05:07,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,662 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #96#return; {44#true} is VALID
[2020-07-10 15:05:07,663 INFO L263 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret13 := main(); {44#true} is VALID
[2020-07-10 15:05:07,663 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {44#true} is VALID
[2020-07-10 15:05:07,665 INFO L263 TraceCheckUtils]: 6: Hoare triple {44#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {76#(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-10 15:05:07,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:07,667 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {77#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:07,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {54#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:07,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#(not (= 0 ~head~0.base))} assume true; {54#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:07,673 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {54#(not (= 0 ~head~0.base))} {44#true} #84#return; {54#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:07,675 INFO L280 TraceCheckUtils]: 12: Hoare triple {54#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {54#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:07,677 INFO L263 TraceCheckUtils]: 13: Hoare triple {54#(not (= 0 ~head~0.base))} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {76#(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-10 15:05:07,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {78#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-10 15:05:07,680 INFO L280 TraceCheckUtils]: 15: Hoare triple {78#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {79#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:07,681 INFO L280 TraceCheckUtils]: 16: Hoare triple {79#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {79#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:07,682 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#(= 0 |old(~head~0.base)|)} assume true; {79#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:07,683 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {79#(= 0 |old(~head~0.base)|)} {54#(not (= 0 ~head~0.base))} #86#return; {45#false} is VALID
[2020-07-10 15:05:07,684 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {45#false} is VALID
[2020-07-10 15:05:07,684 INFO L263 TraceCheckUtils]: 20: Hoare triple {45#false} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {76#(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-10 15:05:07,684 INFO L280 TraceCheckUtils]: 21: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,685 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,685 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:07,685 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,686 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {44#true} {45#false} #88#return; {45#false} is VALID
[2020-07-10 15:05:07,686 INFO L280 TraceCheckUtils]: 26: Hoare triple {45#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {45#false} is VALID
[2020-07-10 15:05:07,686 INFO L263 TraceCheckUtils]: 27: Hoare triple {45#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {76#(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-10 15:05:07,687 INFO L280 TraceCheckUtils]: 28: Hoare triple {76#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,687 INFO L280 TraceCheckUtils]: 29: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,687 INFO L280 TraceCheckUtils]: 30: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:07,687 INFO L280 TraceCheckUtils]: 31: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,688 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {44#true} {45#false} #90#return; {45#false} is VALID
[2020-07-10 15:05:07,688 INFO L280 TraceCheckUtils]: 33: Hoare triple {45#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {45#false} is VALID
[2020-07-10 15:05:07,688 INFO L263 TraceCheckUtils]: 34: Hoare triple {45#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {44#true} is VALID
[2020-07-10 15:05:07,689 INFO L280 TraceCheckUtils]: 35: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID
[2020-07-10 15:05:07,690 INFO L280 TraceCheckUtils]: 36: Hoare triple {44#true} assume !true; {45#false} is VALID
[2020-07-10 15:05:07,690 INFO L280 TraceCheckUtils]: 37: Hoare triple {45#false} #res.base, #res.offset := ~l.base, ~l.offset; {45#false} is VALID
[2020-07-10 15:05:07,690 INFO L280 TraceCheckUtils]: 38: Hoare triple {45#false} assume true; {45#false} is VALID
[2020-07-10 15:05:07,691 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {45#false} {45#false} #92#return; {45#false} is VALID
[2020-07-10 15:05:07,691 INFO L280 TraceCheckUtils]: 40: Hoare triple {45#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {45#false} is VALID
[2020-07-10 15:05:07,691 INFO L263 TraceCheckUtils]: 41: Hoare triple {45#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {45#false} is VALID
[2020-07-10 15:05:07,692 INFO L280 TraceCheckUtils]: 42: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID
[2020-07-10 15:05:07,692 INFO L280 TraceCheckUtils]: 43: Hoare triple {45#false} assume 0 == ~cond; {45#false} is VALID
[2020-07-10 15:05:07,692 INFO L280 TraceCheckUtils]: 44: Hoare triple {45#false} assume !false; {45#false} is VALID
[2020-07-10 15:05:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2020-07-10 15:05:07,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994507065]
[2020-07-10 15:05:07,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743127124]
[2020-07-10 15:05:07,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 15:05:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,872 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjunts are in the unsatisfiable core
[2020-07-10 15:05:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:07,915 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-10 15:05:07,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID
[2020-07-10 15:05:07,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID
[2020-07-10 15:05:07,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,989 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #96#return; {44#true} is VALID
[2020-07-10 15:05:07,991 INFO L263 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret13 := main(); {44#true} is VALID
[2020-07-10 15:05:07,991 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {44#true} is VALID
[2020-07-10 15:05:07,992 INFO L263 TraceCheckUtils]: 6: Hoare triple {44#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {44#true} is VALID
[2020-07-10 15:05:07,992 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,992 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:07,993 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,993 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#true} {44#true} #84#return; {44#true} is VALID
[2020-07-10 15:05:07,993 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {44#true} is VALID
[2020-07-10 15:05:07,994 INFO L263 TraceCheckUtils]: 13: Hoare triple {44#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {44#true} is VALID
[2020-07-10 15:05:07,994 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,998 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:07,999 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:07,999 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:07,999 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {44#true} {44#true} #86#return; {44#true} is VALID
[2020-07-10 15:05:08,000 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {44#true} is VALID
[2020-07-10 15:05:08,000 INFO L263 TraceCheckUtils]: 20: Hoare triple {44#true} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {44#true} is VALID
[2020-07-10 15:05:08,000 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:08,000 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:08,001 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:08,001 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:08,003 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {44#true} {44#true} #88#return; {44#true} is VALID
[2020-07-10 15:05:08,003 INFO L280 TraceCheckUtils]: 26: Hoare triple {44#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {44#true} is VALID
[2020-07-10 15:05:08,003 INFO L263 TraceCheckUtils]: 27: Hoare triple {44#true} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {44#true} is VALID
[2020-07-10 15:05:08,004 INFO L280 TraceCheckUtils]: 28: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:08,007 INFO L280 TraceCheckUtils]: 29: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID
[2020-07-10 15:05:08,007 INFO L280 TraceCheckUtils]: 30: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID
[2020-07-10 15:05:08,008 INFO L280 TraceCheckUtils]: 31: Hoare triple {44#true} assume true; {44#true} is VALID
[2020-07-10 15:05:08,008 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {44#true} {44#true} #90#return; {44#true} is VALID
[2020-07-10 15:05:08,008 INFO L280 TraceCheckUtils]: 33: Hoare triple {44#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {44#true} is VALID
[2020-07-10 15:05:08,009 INFO L263 TraceCheckUtils]: 34: Hoare triple {44#true} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {44#true} is VALID
[2020-07-10 15:05:08,009 INFO L280 TraceCheckUtils]: 35: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID
[2020-07-10 15:05:08,011 INFO L280 TraceCheckUtils]: 36: Hoare triple {44#true} assume !true; {45#false} is VALID
[2020-07-10 15:05:08,011 INFO L280 TraceCheckUtils]: 37: Hoare triple {45#false} #res.base, #res.offset := ~l.base, ~l.offset; {45#false} is VALID
[2020-07-10 15:05:08,011 INFO L280 TraceCheckUtils]: 38: Hoare triple {45#false} assume true; {45#false} is VALID
[2020-07-10 15:05:08,012 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {45#false} {44#true} #92#return; {45#false} is VALID
[2020-07-10 15:05:08,012 INFO L280 TraceCheckUtils]: 40: Hoare triple {45#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {45#false} is VALID
[2020-07-10 15:05:08,012 INFO L263 TraceCheckUtils]: 41: Hoare triple {45#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {45#false} is VALID
[2020-07-10 15:05:08,013 INFO L280 TraceCheckUtils]: 42: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID
[2020-07-10 15:05:08,013 INFO L280 TraceCheckUtils]: 43: Hoare triple {45#false} assume 0 == ~cond; {45#false} is VALID
[2020-07-10 15:05:08,013 INFO L280 TraceCheckUtils]: 44: Hoare triple {45#false} assume !false; {45#false} is VALID
[2020-07-10 15:05:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2020-07-10 15:05:08,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2020-07-10 15:05:08,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8
[2020-07-10 15:05:08,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735743213]
[2020-07-10 15:05:08,024 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45
[2020-07-10 15:05:08,027 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:05:08,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states.
[2020-07-10 15:05:08,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:05:08,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states
[2020-07-10 15:05:08,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:05:08,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2020-07-10 15:05:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-07-10 15:05:08,119 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states.
[2020-07-10 15:05:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:05:08,247 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions.
[2020-07-10 15:05:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2020-07-10 15:05:08,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45
[2020-07-10 15:05:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:05:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2020-07-10 15:05:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions.
[2020-07-10 15:05:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2020-07-10 15:05:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions.
[2020-07-10 15:05:08,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions.
[2020-07-10 15:05:08,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:05:08,461 INFO L225 Difference]: With dead ends: 58
[2020-07-10 15:05:08,461 INFO L226 Difference]: Without dead ends: 33
[2020-07-10 15:05:08,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-07-10 15:05:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2020-07-10 15:05:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2020-07-10 15:05:08,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:05:08,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states.
[2020-07-10 15:05:08,538 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states.
[2020-07-10 15:05:08,538 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states.
[2020-07-10 15:05:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:05:08,552 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions.
[2020-07-10 15:05:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions.
[2020-07-10 15:05:08,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:05:08,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:05:08,554 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states.
[2020-07-10 15:05:08,554 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states.
[2020-07-10 15:05:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:05:08,574 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions.
[2020-07-10 15:05:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions.
[2020-07-10 15:05:08,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:05:08,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:05:08,579 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:05:08,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:05:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2020-07-10 15:05:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions.
[2020-07-10 15:05:08,590 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 45
[2020-07-10 15:05:08,590 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:05:08,591 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions.
[2020-07-10 15:05:08,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2020-07-10 15:05:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions.
[2020-07-10 15:05:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2020-07-10 15:05:08,594 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:05:08,595 INFO L422 BasicCegarLoop]: trace histogram [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]
[2020-07-10 15:05:08,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2020-07-10 15:05:08,809 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:05:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:05:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1842115760, now seen corresponding path program 1 times
[2020-07-10 15:05:08,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:05:08,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335092606]
[2020-07-10 15:05:08,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:05:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:08,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {403#true} is VALID
[2020-07-10 15:05:08,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:08,953 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {403#true} {403#true} #96#return; {403#true} is VALID
[2020-07-10 15:05:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:09,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:09,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {438#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:09,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,014 INFO L280 TraceCheckUtils]: 3: Hoare triple {413#(not (= 0 ~head~0.base))} assume true; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,015 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {413#(not (= 0 ~head~0.base))} {403#true} #84#return; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:09,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-10 15:05:09,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {440#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {440#(= 0 |old(~head~0.base)|)} assume true; {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,057 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {440#(= 0 |old(~head~0.base)|)} {413#(not (= 0 ~head~0.base))} #86#return; {404#false} is VALID
[2020-07-10 15:05:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:09,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID
[2020-07-10 15:05:09,073 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,073 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {403#true} {404#false} #88#return; {404#false} is VALID
[2020-07-10 15:05:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:09,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID
[2020-07-10 15:05:09,085 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,085 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {403#true} {404#false} #90#return; {404#false} is VALID
[2020-07-10 15:05:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:09,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {403#true} is VALID
[2020-07-10 15:05:09,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} #t~short3 := ~l.base != 0 || ~l.offset != 0; {403#true} is VALID
[2020-07-10 15:05:09,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} assume #t~short3;call #t~mem2 := read~int(~l.base, ~l.offset, 4);#t~short3 := #t~mem2 != ~k; {403#true} is VALID
[2020-07-10 15:05:09,094 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#true} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {403#true} is VALID
[2020-07-10 15:05:09,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {403#true} #res.base, #res.offset := ~l.base, ~l.offset; {403#true} is VALID
[2020-07-10 15:05:09,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,095 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {403#true} {404#false} #92#return; {404#false} is VALID
[2020-07-10 15:05:09,096 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {436#(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-10 15:05:09,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {403#true} is VALID
[2020-07-10 15:05:09,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,097 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #96#return; {403#true} is VALID
[2020-07-10 15:05:09,098 INFO L263 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret13 := main(); {403#true} is VALID
[2020-07-10 15:05:09,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {403#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {403#true} is VALID
[2020-07-10 15:05:09,099 INFO L263 TraceCheckUtils]: 6: Hoare triple {403#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {437#(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-10 15:05:09,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:09,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {438#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:09,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {438#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,103 INFO L280 TraceCheckUtils]: 10: Hoare triple {413#(not (= 0 ~head~0.base))} assume true; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,104 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {413#(not (= 0 ~head~0.base))} {403#true} #84#return; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,105 INFO L280 TraceCheckUtils]: 12: Hoare triple {413#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,106 INFO L263 TraceCheckUtils]: 13: Hoare triple {413#(not (= 0 ~head~0.base))} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {437#(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-10 15:05:09,108 INFO L280 TraceCheckUtils]: 14: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-10 15:05:09,109 INFO L280 TraceCheckUtils]: 15: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {440#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,110 INFO L280 TraceCheckUtils]: 17: Hoare triple {440#(= 0 |old(~head~0.base)|)} assume true; {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,111 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {440#(= 0 |old(~head~0.base)|)} {413#(not (= 0 ~head~0.base))} #86#return; {404#false} is VALID
[2020-07-10 15:05:09,111 INFO L280 TraceCheckUtils]: 19: Hoare triple {404#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {404#false} is VALID
[2020-07-10 15:05:09,112 INFO L263 TraceCheckUtils]: 20: Hoare triple {404#false} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {437#(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-10 15:05:09,112 INFO L280 TraceCheckUtils]: 21: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,112 INFO L280 TraceCheckUtils]: 22: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,112 INFO L280 TraceCheckUtils]: 23: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID
[2020-07-10 15:05:09,113 INFO L280 TraceCheckUtils]: 24: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,113 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {403#true} {404#false} #88#return; {404#false} is VALID
[2020-07-10 15:05:09,113 INFO L280 TraceCheckUtils]: 26: Hoare triple {404#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {404#false} is VALID
[2020-07-10 15:05:09,114 INFO L263 TraceCheckUtils]: 27: Hoare triple {404#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {437#(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-10 15:05:09,114 INFO L280 TraceCheckUtils]: 28: Hoare triple {437#(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;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,114 INFO L280 TraceCheckUtils]: 29: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,114 INFO L280 TraceCheckUtils]: 30: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID
[2020-07-10 15:05:09,115 INFO L280 TraceCheckUtils]: 31: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,115 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {403#true} {404#false} #90#return; {404#false} is VALID
[2020-07-10 15:05:09,115 INFO L280 TraceCheckUtils]: 33: Hoare triple {404#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {404#false} is VALID
[2020-07-10 15:05:09,116 INFO L263 TraceCheckUtils]: 34: Hoare triple {404#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {403#true} is VALID
[2020-07-10 15:05:09,116 INFO L280 TraceCheckUtils]: 35: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {403#true} is VALID
[2020-07-10 15:05:09,116 INFO L280 TraceCheckUtils]: 36: Hoare triple {403#true} #t~short3 := ~l.base != 0 || ~l.offset != 0; {403#true} is VALID
[2020-07-10 15:05:09,116 INFO L280 TraceCheckUtils]: 37: Hoare triple {403#true} assume #t~short3;call #t~mem2 := read~int(~l.base, ~l.offset, 4);#t~short3 := #t~mem2 != ~k; {403#true} is VALID
[2020-07-10 15:05:09,117 INFO L280 TraceCheckUtils]: 38: Hoare triple {403#true} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {403#true} is VALID
[2020-07-10 15:05:09,117 INFO L280 TraceCheckUtils]: 39: Hoare triple {403#true} #res.base, #res.offset := ~l.base, ~l.offset; {403#true} is VALID
[2020-07-10 15:05:09,117 INFO L280 TraceCheckUtils]: 40: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,117 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {403#true} {404#false} #92#return; {404#false} is VALID
[2020-07-10 15:05:09,118 INFO L280 TraceCheckUtils]: 42: Hoare triple {404#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {404#false} is VALID
[2020-07-10 15:05:09,118 INFO L263 TraceCheckUtils]: 43: Hoare triple {404#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {404#false} is VALID
[2020-07-10 15:05:09,118 INFO L280 TraceCheckUtils]: 44: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID
[2020-07-10 15:05:09,118 INFO L280 TraceCheckUtils]: 45: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID
[2020-07-10 15:05:09,119 INFO L280 TraceCheckUtils]: 46: Hoare triple {404#false} assume !false; {404#false} is VALID
[2020-07-10 15:05:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2020-07-10 15:05:09,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335092606]
[2020-07-10 15:05:09,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448704894]
[2020-07-10 15:05:09,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 15:05:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:09,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjunts are in the unsatisfiable core
[2020-07-10 15:05:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:09,274 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-10 15:05:09,370 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID
[2020-07-10 15:05:09,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~head~0.base, ~head~0.offset := 0, 0; {403#true} is VALID
[2020-07-10 15:05:09,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,371 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #96#return; {403#true} is VALID
[2020-07-10 15:05:09,371 INFO L263 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret13 := main(); {403#true} is VALID
[2020-07-10 15:05:09,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {403#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {403#true} is VALID
[2020-07-10 15:05:09,371 INFO L263 TraceCheckUtils]: 6: Hoare triple {403#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {403#true} is VALID
[2020-07-10 15:05:09,372 INFO L280 TraceCheckUtils]: 7: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {403#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {403#true} is VALID
[2020-07-10 15:05:09,372 INFO L280 TraceCheckUtils]: 9: Hoare triple {403#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {403#true} is VALID
[2020-07-10 15:05:09,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {403#true} assume true; {403#true} is VALID
[2020-07-10 15:05:09,372 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {403#true} {403#true} #84#return; {403#true} is VALID
[2020-07-10 15:05:09,373 INFO L280 TraceCheckUtils]: 12: Hoare triple {403#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {403#true} is VALID
[2020-07-10 15:05:09,373 INFO L263 TraceCheckUtils]: 13: Hoare triple {403#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {403#true} is VALID
[2020-07-10 15:05:09,376 INFO L280 TraceCheckUtils]: 14: Hoare triple {403#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:09,379 INFO L280 TraceCheckUtils]: 15: Hoare triple {438#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {438#(not (= 0 insert_list_~l.base))} is VALID
[2020-07-10 15:05:09,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {438#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {413#(not (= 0 ~head~0.base))} assume true; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,385 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {413#(not (= 0 ~head~0.base))} {403#true} #86#return; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,385 INFO L280 TraceCheckUtils]: 19: Hoare triple {413#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {413#(not (= 0 ~head~0.base))} is VALID
[2020-07-10 15:05:09,386 INFO L263 TraceCheckUtils]: 20: Hoare triple {413#(not (= 0 ~head~0.base))} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-10 15:05:09,387 INFO L280 TraceCheckUtils]: 21: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {439#(= |old(~head~0.base)| ~head~0.base)} is VALID
[2020-07-10 15:05:09,389 INFO L280 TraceCheckUtils]: 22: Hoare triple {439#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,389 INFO L280 TraceCheckUtils]: 23: Hoare triple {440#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,390 INFO L280 TraceCheckUtils]: 24: Hoare triple {440#(= 0 |old(~head~0.base)|)} assume true; {440#(= 0 |old(~head~0.base)|)} is VALID
[2020-07-10 15:05:09,391 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {440#(= 0 |old(~head~0.base)|)} {413#(not (= 0 ~head~0.base))} #88#return; {404#false} is VALID
[2020-07-10 15:05:09,391 INFO L280 TraceCheckUtils]: 26: Hoare triple {404#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;havoc #t~ret8; {404#false} is VALID
[2020-07-10 15:05:09,392 INFO L263 TraceCheckUtils]: 27: Hoare triple {404#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {404#false} is VALID
[2020-07-10 15:05:09,392 INFO L280 TraceCheckUtils]: 28: Hoare triple {404#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(~k, ~l.base, ~l.offset, 4); {404#false} is VALID
[2020-07-10 15:05:09,393 INFO L280 TraceCheckUtils]: 29: Hoare triple {404#false} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {404#false} is VALID
[2020-07-10 15:05:09,393 INFO L280 TraceCheckUtils]: 30: Hoare triple {404#false} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {404#false} is VALID
[2020-07-10 15:05:09,393 INFO L280 TraceCheckUtils]: 31: Hoare triple {404#false} assume true; {404#false} is VALID
[2020-07-10 15:05:09,394 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {404#false} {404#false} #90#return; {404#false} is VALID
[2020-07-10 15:05:09,394 INFO L280 TraceCheckUtils]: 33: Hoare triple {404#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;havoc #t~ret9; {404#false} is VALID
[2020-07-10 15:05:09,394 INFO L263 TraceCheckUtils]: 34: Hoare triple {404#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {404#false} is VALID
[2020-07-10 15:05:09,395 INFO L280 TraceCheckUtils]: 35: Hoare triple {404#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {404#false} is VALID
[2020-07-10 15:05:09,395 INFO L280 TraceCheckUtils]: 36: Hoare triple {404#false} #t~short3 := ~l.base != 0 || ~l.offset != 0; {404#false} is VALID
[2020-07-10 15:05:09,395 INFO L280 TraceCheckUtils]: 37: Hoare triple {404#false} assume #t~short3;call #t~mem2 := read~int(~l.base, ~l.offset, 4);#t~short3 := #t~mem2 != ~k; {404#false} is VALID
[2020-07-10 15:05:09,395 INFO L280 TraceCheckUtils]: 38: Hoare triple {404#false} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {404#false} is VALID
[2020-07-10 15:05:09,396 INFO L280 TraceCheckUtils]: 39: Hoare triple {404#false} #res.base, #res.offset := ~l.base, ~l.offset; {404#false} is VALID
[2020-07-10 15:05:09,396 INFO L280 TraceCheckUtils]: 40: Hoare triple {404#false} assume true; {404#false} is VALID
[2020-07-10 15:05:09,396 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {404#false} {404#false} #92#return; {404#false} is VALID
[2020-07-10 15:05:09,396 INFO L280 TraceCheckUtils]: 42: Hoare triple {404#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset;call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); {404#false} is VALID
[2020-07-10 15:05:09,397 INFO L263 TraceCheckUtils]: 43: Hoare triple {404#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {404#false} is VALID
[2020-07-10 15:05:09,397 INFO L280 TraceCheckUtils]: 44: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID
[2020-07-10 15:05:09,397 INFO L280 TraceCheckUtils]: 45: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID
[2020-07-10 15:05:09,397 INFO L280 TraceCheckUtils]: 46: Hoare triple {404#false} assume !false; {404#false} is VALID
[2020-07-10 15:05:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2020-07-10 15:05:09,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-10 15:05:09,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8
[2020-07-10 15:05:09,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988908341]
[2020-07-10 15:05:09,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47
[2020-07-10 15:05:09,406 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:05:09,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states.
[2020-07-10 15:05:09,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:05:09,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-07-10 15:05:09,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:05:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-07-10 15:05:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-07-10 15:05:09,513 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 8 states.
[2020-07-10 15:05:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:05:10,459 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions.
[2020-07-10 15:05:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2020-07-10 15:05:10,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47
[2020-07-10 15:05:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:05:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-10 15:05:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions.
[2020-07-10 15:05:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-10 15:05:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions.
[2020-07-10 15:05:10,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 92 transitions.
[2020-07-10 15:05:10,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:05:10,636 INFO L225 Difference]: With dead ends: 73
[2020-07-10 15:05:10,636 INFO L226 Difference]: Without dead ends: 49
[2020-07-10 15:05:10,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240
[2020-07-10 15:05:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2020-07-10 15:05:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38.
[2020-07-10 15:05:10,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:05:10,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 38 states.
[2020-07-10 15:05:10,688 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 38 states.
[2020-07-10 15:05:10,689 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 38 states.
[2020-07-10 15:05:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:05:10,694 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions.
[2020-07-10 15:05:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions.
[2020-07-10 15:05:10,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:05:10,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:05:10,698 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 49 states.
[2020-07-10 15:05:10,698 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 49 states.
[2020-07-10 15:05:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:05:10,706 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions.
[2020-07-10 15:05:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions.
[2020-07-10 15:05:10,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:05:10,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:05:10,708 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:05:10,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:05:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2020-07-10 15:05:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions.
[2020-07-10 15:05:10,715 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 47
[2020-07-10 15:05:10,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:05:10,715 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions.
[2020-07-10 15:05:10,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-07-10 15:05:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions.
[2020-07-10 15:05:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2020-07-10 15:05:10,716 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:05:10,717 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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]
[2020-07-10 15:05:10,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 15:05:10,926 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:05:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:05:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash 874015054, now seen corresponding path program 1 times
[2020-07-10 15:05:10,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:05:10,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171345160]
[2020-07-10 15:05:10,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:05:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:05:11,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-10 15:05:11,019 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.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1)
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-10 15:05:11,026 INFO L168 Benchmark]: Toolchain (without parser) took 5509.62 ms. Allocated memory was 138.4 MB in the beginning and 281.0 MB in the end (delta: 142.6 MB). Free memory was 102.0 MB in the beginning and 176.4 MB in the end (delta: -74.4 MB). Peak memory consumption was 68.2 MB. Max. memory is 7.1 GB.
[2020-07-10 15:05:11,027 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
[2020-07-10 15:05:11,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.09 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 101.8 MB in the beginning and 170.3 MB in the end (delta: -68.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB.
[2020-07-10 15:05:11,030 INFO L168 Benchmark]: Boogie Preprocessor took 65.17 ms. Allocated memory is still 205.0 MB. Free memory was 170.3 MB in the beginning and 166.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB.
[2020-07-10 15:05:11,032 INFO L168 Benchmark]: RCFGBuilder took 708.75 ms. Allocated memory is still 205.0 MB. Free memory was 166.9 MB in the beginning and 111.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB.
[2020-07-10 15:05:11,041 INFO L168 Benchmark]: TraceAbstraction took 4033.33 ms. Allocated memory was 205.0 MB in the beginning and 281.0 MB in the end (delta: 76.0 MB). Free memory was 111.4 MB in the beginning and 176.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB.
[2020-07-10 15:05:11,050 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.53 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 697.09 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 101.8 MB in the beginning and 170.3 MB in the end (delta: -68.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 65.17 ms. Allocated memory is still 205.0 MB. Free memory was 170.3 MB in the beginning and 166.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 708.75 ms. Allocated memory is still 205.0 MB. Free memory was 166.9 MB in the beginning and 111.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 4033.33 ms. Allocated memory was 205.0 MB in the beginning and 281.0 MB in the end (delta: 76.0 MB). Free memory was 111.4 MB in the beginning and 176.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 11.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...