/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/list-simple/sll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 04:56:18,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 04:56:18,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 04:56:18,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 04:56:18,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 04:56:18,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 04:56:18,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 04:56:18,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 04:56:18,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 04:56:18,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 04:56:18,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 04:56:18,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 04:56:18,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 04:56:18,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 04:56:18,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 04:56:18,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 04:56:18,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 04:56:18,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 04:56:18,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 04:56:18,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 04:56:18,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 04:56:18,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 04:56:18,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 04:56:18,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 04:56:18,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 04:56:18,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 04:56:18,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 04:56:18,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 04:56:18,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 04:56:18,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 04:56:18,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 04:56:18,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 04:56:18,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 04:56:18,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 04:56:18,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 04:56:18,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 04:56:18,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 04:56:18,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 04:56:18,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 04:56:18,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 04:56:18,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 04:56:18,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 04:56:18,400 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 04:56:18,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 04:56:18,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 04:56:18,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 04:56:18,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 04:56:18,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 04:56:18,402 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 04:56:18,402 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 04:56:18,402 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 04:56:18,402 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 04:56:18,403 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 04:56:18,403 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 04:56:18,403 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 04:56:18,404 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 04:56:18,404 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 04:56:18,404 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 04:56:18,404 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 04:56:18,404 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 04:56:18,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 04:56:18,405 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 04:56:18,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 04:56:18,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 04:56:18,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 04:56:18,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 04:56:18,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 04:56:18,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 04:56:18,406 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 04:56:18,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 04:56:18,406 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 04:56:18,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 04:56:18,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 04:56:18,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 04:56:18,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:56:18,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 04:56:18,407 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 04:56:18,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 04:56:18,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 04:56:18,407 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 04:56:18,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 04:56:18,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 04:56:18,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 04:56:18,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-01 04:56:18,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 04:56:18,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 04:56:18,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 04:56:18,627 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 04:56:18,628 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 04:56:18,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-04-01 04:56:19,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 04:56:20,063 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 04:56:20,063 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-04-01 04:56:20,073 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecda2c27/0fe719d67ff94b44ba51d3d0b631abbf/FLAG81890dfd1 [2023-04-01 04:56:20,085 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecda2c27/0fe719d67ff94b44ba51d3d0b631abbf [2023-04-01 04:56:20,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 04:56:20,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 04:56:20,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 04:56:20,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 04:56:20,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 04:56:20,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1afafeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20, skipping insertion in model container [2023-04-01 04:56:20,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 04:56:20,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 04:56:20,394 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2023-04-01 04:56:20,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:56:20,413 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 04:56:20,468 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2023-04-01 04:56:20,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:56:20,496 INFO L208 MainTranslator]: Completed translation [2023-04-01 04:56:20,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20 WrapperNode [2023-04-01 04:56:20,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 04:56:20,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 04:56:20,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 04:56:20,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 04:56:20,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,564 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 04:56:20,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 04:56:20,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 04:56:20,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 04:56:20,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (1/1) ... [2023-04-01 04:56:20,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:56:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:20,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 04:56:20,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 04:56:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 04:56:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 04:56:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 04:56:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-01 04:56:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-01 04:56:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-01 04:56:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-01 04:56:20,641 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2023-04-01 04:56:20,641 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2023-04-01 04:56:20,641 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2023-04-01 04:56:20,641 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2023-04-01 04:56:20,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 04:56:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 04:56:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 04:56:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-01 04:56:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-01 04:56:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-01 04:56:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-01 04:56:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-01 04:56:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-01 04:56:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-01 04:56:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-01 04:56:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-01 04:56:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-01 04:56:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-01 04:56:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-01 04:56:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-01 04:56:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-01 04:56:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-01 04:56:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-01 04:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-01 04:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-01 04:56:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-01 04:56:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-01 04:56:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-01 04:56:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2023-04-01 04:56:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 04:56:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 04:56:20,893 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 04:56:20,900 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 04:56:20,965 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-01 04:56:21,096 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 04:56:21,142 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 04:56:21,143 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-01 04:56:21,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:56:21 BoogieIcfgContainer [2023-04-01 04:56:21,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 04:56:21,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 04:56:21,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 04:56:21,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 04:56:21,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 04:56:20" (1/3) ... [2023-04-01 04:56:21,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bfdcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:56:21, skipping insertion in model container [2023-04-01 04:56:21,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:56:20" (2/3) ... [2023-04-01 04:56:21,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bfdcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:56:21, skipping insertion in model container [2023-04-01 04:56:21,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:56:21" (3/3) ... [2023-04-01 04:56:21,156 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2023-04-01 04:56:21,171 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 04:56:21,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 04:56:21,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 04:56:21,217 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@457b651, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 04:56:21,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 04:56:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 04:56:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 04:56:21,228 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:21,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:21,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:21,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1896556068, now seen corresponding path program 1 times [2023-04-01 04:56:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:21,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82493394] [2023-04-01 04:56:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:56:21,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:21,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82493394] [2023-04-01 04:56:21,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82493394] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:56:21,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:56:21,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 04:56:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477927531] [2023-04-01 04:56:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:56:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 04:56:21,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 04:56:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 04:56:21,589 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:56:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:21,668 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2023-04-01 04:56:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:56:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-04-01 04:56:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:21,675 INFO L225 Difference]: With dead ends: 72 [2023-04-01 04:56:21,676 INFO L226 Difference]: Without dead ends: 34 [2023-04-01 04:56:21,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 04:56:21,681 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:21,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 126 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:56:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-01 04:56:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-04-01 04:56:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 04:56:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-04-01 04:56:21,716 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2023-04-01 04:56:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:21,716 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-04-01 04:56:21,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:56:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-04-01 04:56:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 04:56:21,717 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:21,718 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 04:56:21,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 04:56:21,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:21,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1342820788, now seen corresponding path program 1 times [2023-04-01 04:56:21,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:21,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479327673] [2023-04-01 04:56:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:56:21,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479327673] [2023-04-01 04:56:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479327673] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928185695] [2023-04-01 04:56:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:21,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:21,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:21,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:22,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 04:56:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:22,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 04:56:22,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:56:22,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:56:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928185695] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:56:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [341035613] [2023-04-01 04:56:22,532 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-04-01 04:56:22,533 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:56:22,536 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:56:22,540 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:56:22,541 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:56:22,628 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:56:22,940 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:56:23,468 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:56:23,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:56:23,496 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:56:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [341035613] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:56:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:56:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [6, 6, 6] total 27 [2023-04-01 04:56:24,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499140684] [2023-04-01 04:56:24,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:56:24,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 04:56:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:24,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 04:56:24,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-04-01 04:56:24,120 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 17 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 04:56:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:25,991 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-04-01 04:56:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-01 04:56:25,992 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-04-01 04:56:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:25,994 INFO L225 Difference]: With dead ends: 47 [2023-04-01 04:56:25,994 INFO L226 Difference]: Without dead ends: 38 [2023-04-01 04:56:25,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=262, Invalid=1630, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 04:56:25,997 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 71 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:25,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 04:56:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-01 04:56:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-04-01 04:56:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 04:56:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-04-01 04:56:26,016 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 26 [2023-04-01 04:56:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:26,017 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-04-01 04:56:26,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 04:56:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-04-01 04:56:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-01 04:56:26,019 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:26,019 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 04:56:26,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:26,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:26,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:26,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash -473825393, now seen corresponding path program 1 times [2023-04-01 04:56:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:26,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101060246] [2023-04-01 04:56:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 04:56:26,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101060246] [2023-04-01 04:56:26,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101060246] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407339658] [2023-04-01 04:56:26,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:26,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:26,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:26,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 04:56:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:26,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 04:56:26,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 04:56:26,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 04:56:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407339658] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:56:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1376509953] [2023-04-01 04:56:26,681 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-01 04:56:26,682 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:56:26,682 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:56:26,682 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:56:26,682 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:56:26,704 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:56:27,024 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-01 04:56:27,029 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:56:27,305 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:56:27,317 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 29 for LOIs [2023-04-01 04:56:27,326 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:56:27,329 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:56:28,467 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '758#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= main_~len~0 2) (= main_~i~0 0) (= 2 main_~expected~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:56:28,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:56:28,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:56:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-04-01 04:56:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494970102] [2023-04-01 04:56:28,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:56:28,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 04:56:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 04:56:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 04:56:28,471 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 12 states, 8 states have (on average 4.25) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 04:56:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:28,572 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-04-01 04:56:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 04:56:28,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 4.25) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 32 [2023-04-01 04:56:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:28,574 INFO L225 Difference]: With dead ends: 56 [2023-04-01 04:56:28,574 INFO L226 Difference]: Without dead ends: 38 [2023-04-01 04:56:28,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 04:56:28,576 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:28,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 199 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:56:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-01 04:56:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-04-01 04:56:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 04:56:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-04-01 04:56:28,586 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2023-04-01 04:56:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:28,587 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-04-01 04:56:28,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 4.25) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 04:56:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-04-01 04:56:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 04:56:28,589 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:28,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:28,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:28,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-01 04:56:28,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:28,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1013882593, now seen corresponding path program 2 times [2023-04-01 04:56:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222399596] [2023-04-01 04:56:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 04:56:28,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:28,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222399596] [2023-04-01 04:56:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222399596] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:28,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117917739] [2023-04-01 04:56:28,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 04:56:28,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:28,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:28,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 04:56:29,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 04:56:29,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:56:29,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 04:56:29,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 04:56:29,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 04:56:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117917739] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:56:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [860606024] [2023-04-01 04:56:29,164 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-01 04:56:29,164 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:56:29,165 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:56:29,165 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:56:29,165 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:56:29,178 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:56:29,426 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-01 04:56:29,430 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:56:29,701 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:56:29,713 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 31 for LOIs [2023-04-01 04:56:29,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:56:29,724 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:56:30,643 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1176#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= main_~len~0 2) (= main_~i~0 0) (= 2 main_~expected~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:56:30,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:56:30,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:56:30,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-04-01 04:56:30,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652256787] [2023-04-01 04:56:30,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:56:30,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 04:56:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 04:56:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2023-04-01 04:56:30,647 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 04:56:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:30,724 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-04-01 04:56:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:56:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 39 [2023-04-01 04:56:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:30,727 INFO L225 Difference]: With dead ends: 55 [2023-04-01 04:56:30,727 INFO L226 Difference]: Without dead ends: 46 [2023-04-01 04:56:30,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2023-04-01 04:56:30,732 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:30,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 53 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:56:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-04-01 04:56:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-04-01 04:56:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 04:56:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-04-01 04:56:30,742 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 39 [2023-04-01 04:56:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:30,743 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-04-01 04:56:30,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 04:56:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-04-01 04:56:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-04-01 04:56:30,743 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:30,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:30,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:30,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:30,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:30,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash 678594594, now seen corresponding path program 3 times [2023-04-01 04:56:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067125184] [2023-04-01 04:56:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:30,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 04:56:31,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067125184] [2023-04-01 04:56:31,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067125184] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178043528] [2023-04-01 04:56:31,092 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 04:56:31,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:31,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:31,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:31,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 04:56:31,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 04:56:31,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:56:31,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 04:56:31,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 04:56:31,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 04:56:31,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178043528] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:56:31,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 04:56:31,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2023-04-01 04:56:31,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204635971] [2023-04-01 04:56:31,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:56:31,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 04:56:31,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:31,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 04:56:31,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 04:56:31,281 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 04:56:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:31,350 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-04-01 04:56:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 04:56:31,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2023-04-01 04:56:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:31,353 INFO L225 Difference]: With dead ends: 62 [2023-04-01 04:56:31,353 INFO L226 Difference]: Without dead ends: 47 [2023-04-01 04:56:31,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 04:56:31,354 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:31,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:56:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-01 04:56:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2023-04-01 04:56:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 04:56:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-04-01 04:56:31,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 45 [2023-04-01 04:56:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:31,368 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-04-01 04:56:31,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 04:56:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-04-01 04:56:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-01 04:56:31,369 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:31,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:31,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 04:56:31,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:31,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:31,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:31,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1598996758, now seen corresponding path program 1 times [2023-04-01 04:56:31,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:31,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692102411] [2023-04-01 04:56:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:31,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:56:33,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692102411] [2023-04-01 04:56:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692102411] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167134116] [2023-04-01 04:56:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:33,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:33,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:33,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:33,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 04:56:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:33,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 107 conjunts are in the unsatisfiable core [2023-04-01 04:56:33,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:33,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-01 04:56:33,575 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 04:56:33,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-01 04:56:33,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 04:56:33,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 04:56:33,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-04-01 04:56:33,976 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_368 (Array Int Int))) (= (store |c_old(#memory_int)| (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)) v_ArrVal_368) |c_#memory_int|)) is different from true [2023-04-01 04:56:33,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-04-01 04:56:33,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-04-01 04:56:34,285 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 04:56:34,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-04-01 04:56:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-04-01 04:56:34,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167134116] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [680413871] [2023-04-01 04:56:34,670 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-01 04:56:34,670 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:56:34,671 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:56:34,671 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:56:34,671 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:56:34,692 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:56:34,962 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-01 04:56:34,967 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:56:35,212 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:56:35,227 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 29 for LOIs [2023-04-01 04:56:35,272 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:56:35,275 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:56:37,210 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1878#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= main_~len~0 2) (= main_~i~0 0) (= 2 main_~expected~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:56:37,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:56:37,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 04:56:37,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 47 [2023-04-01 04:56:37,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798634138] [2023-04-01 04:56:37,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 04:56:37,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-04-01 04:56:37,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-04-01 04:56:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=5241, Unknown=26, NotChecked=146, Total=5700 [2023-04-01 04:56:37,215 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 47 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 38 states have internal predecessors, (50), 9 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2023-04-01 04:56:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:38,897 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2023-04-01 04:56:38,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-04-01 04:56:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 38 states have internal predecessors, (50), 9 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) Word has length 46 [2023-04-01 04:56:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:38,903 INFO L225 Difference]: With dead ends: 78 [2023-04-01 04:56:38,903 INFO L226 Difference]: Without dead ends: 76 [2023-04-01 04:56:38,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=521, Invalid=9142, Unknown=43, NotChecked=194, Total=9900 [2023-04-01 04:56:38,906 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 115 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 49 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:38,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 339 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1561 Invalid, 5 Unknown, 95 Unchecked, 0.9s Time] [2023-04-01 04:56:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-04-01 04:56:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2023-04-01 04:56:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2023-04-01 04:56:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2023-04-01 04:56:38,936 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 46 [2023-04-01 04:56:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:38,937 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2023-04-01 04:56:38,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 38 states have internal predecessors, (50), 9 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2023-04-01 04:56:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2023-04-01 04:56:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 04:56:38,945 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:38,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:38,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:39,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:39,152 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:39,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash 946201276, now seen corresponding path program 2 times [2023-04-01 04:56:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:39,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84517806] [2023-04-01 04:56:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:39,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 04:56:39,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:39,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84517806] [2023-04-01 04:56:39,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84517806] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:39,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277535979] [2023-04-01 04:56:39,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 04:56:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:39,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:39,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 04:56:39,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-04-01 04:56:39,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:56:39,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 04:56:39,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 04:56:39,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 04:56:39,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277535979] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:56:39,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1323994628] [2023-04-01 04:56:39,533 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-01 04:56:39,533 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:56:39,534 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:56:39,534 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:56:39,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:56:39,552 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:56:39,778 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-01 04:56:39,782 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:56:40,004 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:56:40,014 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 29 for LOIs [2023-04-01 04:56:40,056 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:56:40,058 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:56:41,110 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2464#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= main_~len~0 2) (= main_~i~0 0) (= 2 main_~expected~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:56:41,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:56:41,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:56:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-04-01 04:56:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113154816] [2023-04-01 04:56:41,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:56:41,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 04:56:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:41,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 04:56:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2023-04-01 04:56:41,113 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-01 04:56:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:41,213 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2023-04-01 04:56:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:56:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2023-04-01 04:56:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:41,214 INFO L225 Difference]: With dead ends: 88 [2023-04-01 04:56:41,214 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 04:56:41,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2023-04-01 04:56:41,215 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:41,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 117 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:56:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 04:56:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2023-04-01 04:56:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2023-04-01 04:56:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2023-04-01 04:56:41,242 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 47 [2023-04-01 04:56:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:41,242 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2023-04-01 04:56:41,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-01 04:56:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2023-04-01 04:56:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 04:56:41,244 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:41,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:41,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:41,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:41,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:41,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash 810115362, now seen corresponding path program 3 times [2023-04-01 04:56:41,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:41,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906863270] [2023-04-01 04:56:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:41,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 04:56:41,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906863270] [2023-04-01 04:56:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906863270] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833883370] [2023-04-01 04:56:41,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 04:56:41,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:41,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:41,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:41,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 04:56:41,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 04:56:41,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:56:41,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 04:56:41,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 04:56:41,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 04:56:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833883370] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:56:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298851197] [2023-04-01 04:56:41,872 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-01 04:56:41,872 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:56:41,873 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:56:41,873 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:56:41,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:56:41,890 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:56:42,132 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-01 04:56:42,135 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:56:42,352 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:56:42,363 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 29 for LOIs [2023-04-01 04:56:42,404 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:56:42,406 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:56:43,438 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3014#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= main_~len~0 2) (= main_~i~0 0) (= 2 main_~expected~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:56:43,438 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:56:43,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:56:43,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-04-01 04:56:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169297631] [2023-04-01 04:56:43,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:56:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 04:56:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:43,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 04:56:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 04:56:43,440 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 04:56:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:43,539 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2023-04-01 04:56:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 04:56:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 47 [2023-04-01 04:56:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:43,540 INFO L225 Difference]: With dead ends: 96 [2023-04-01 04:56:43,540 INFO L226 Difference]: Without dead ends: 77 [2023-04-01 04:56:43,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 04:56:43,542 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:43,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:56:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-04-01 04:56:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2023-04-01 04:56:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-01 04:56:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2023-04-01 04:56:43,555 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 47 [2023-04-01 04:56:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:43,555 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2023-04-01 04:56:43,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 04:56:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2023-04-01 04:56:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 04:56:43,556 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:43,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:43,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-01 04:56:43,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:43,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:43,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1496222636, now seen corresponding path program 1 times [2023-04-01 04:56:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675921282] [2023-04-01 04:56:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-01 04:56:43,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675921282] [2023-04-01 04:56:43,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675921282] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517939153] [2023-04-01 04:56:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:43,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:43,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:43,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:43,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 04:56:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:44,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 04:56:44,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-01 04:56:44,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-01 04:56:44,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517939153] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:44,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-01 04:56:44,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2023-04-01 04:56:44,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521091938] [2023-04-01 04:56:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:56:44,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 04:56:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 04:56:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-01 04:56:44,116 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 04:56:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:44,168 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2023-04-01 04:56:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:56:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2023-04-01 04:56:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:44,170 INFO L225 Difference]: With dead ends: 85 [2023-04-01 04:56:44,170 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 04:56:44,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-01 04:56:44,171 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:44,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 87 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:56:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 04:56:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2023-04-01 04:56:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.3) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 04:56:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2023-04-01 04:56:44,184 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 47 [2023-04-01 04:56:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:44,184 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2023-04-01 04:56:44,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 04:56:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2023-04-01 04:56:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-01 04:56:44,185 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:44,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:44,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:44,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-01 04:56:44,398 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:44,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1442666175, now seen corresponding path program 4 times [2023-04-01 04:56:44,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:44,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172125100] [2023-04-01 04:56:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:44,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 04:56:44,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:44,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172125100] [2023-04-01 04:56:44,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172125100] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:44,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092780929] [2023-04-01 04:56:44,515 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 04:56:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:44,516 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:44,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 04:56:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:44,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 04:56:44,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 04:56:44,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 04:56:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092780929] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:56:44,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 04:56:44,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-04-01 04:56:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312463537] [2023-04-01 04:56:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:56:44,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 04:56:44,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 04:56:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-04-01 04:56:44,743 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-01 04:56:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:44,808 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-04-01 04:56:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 04:56:44,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 53 [2023-04-01 04:56:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:44,809 INFO L225 Difference]: With dead ends: 82 [2023-04-01 04:56:44,809 INFO L226 Difference]: Without dead ends: 47 [2023-04-01 04:56:44,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-04-01 04:56:44,810 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:44,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 73 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:56:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-01 04:56:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-04-01 04:56:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 04:56:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2023-04-01 04:56:44,824 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 53 [2023-04-01 04:56:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:44,824 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2023-04-01 04:56:44,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-01 04:56:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2023-04-01 04:56:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-01 04:56:44,825 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:44,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:44,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:45,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 04:56:45,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:45,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1896309786, now seen corresponding path program 1 times [2023-04-01 04:56:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:45,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599243201] [2023-04-01 04:56:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 04:56:45,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599243201] [2023-04-01 04:56:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599243201] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729836765] [2023-04-01 04:56:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:45,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:45,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:45,124 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:45,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 04:56:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:45,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 04:56:45,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 04:56:45,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 04:56:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729836765] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:56:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 04:56:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2023-04-01 04:56:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952092309] [2023-04-01 04:56:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:56:45,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 04:56:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:45,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 04:56:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 04:56:45,351 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-01 04:56:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:56:45,413 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2023-04-01 04:56:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 04:56:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2023-04-01 04:56:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:56:45,415 INFO L225 Difference]: With dead ends: 51 [2023-04-01 04:56:45,415 INFO L226 Difference]: Without dead ends: 47 [2023-04-01 04:56:45,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 04:56:45,416 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:56:45,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:56:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-01 04:56:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-04-01 04:56:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 04:56:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-04-01 04:56:45,427 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 53 [2023-04-01 04:56:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:56:45,427 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-04-01 04:56:45,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-01 04:56:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-04-01 04:56:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 04:56:45,428 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:56:45,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:56:45,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 04:56:45,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-01 04:56:45,636 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:56:45,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:56:45,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2122991912, now seen corresponding path program 1 times [2023-04-01 04:56:45,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:56:45,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597687418] [2023-04-01 04:56:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:45,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:56:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 04:56:47,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:56:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597687418] [2023-04-01 04:56:47,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597687418] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:56:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302404070] [2023-04-01 04:56:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:56:47,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:56:47,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:56:47,497 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:56:47,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 04:56:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:56:47,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 118 conjunts are in the unsatisfiable core [2023-04-01 04:56:47,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:56:47,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-01 04:56:47,866 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 04:56:47,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-01 04:56:47,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 04:56:48,164 WARN L861 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int) (v_ArrVal_963 Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset v_ArrVal_963))) (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|))) is different from true [2023-04-01 04:56:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:56:48,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-04-01 04:56:48,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-04-01 04:56:48,489 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 04:56:48,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-04-01 04:56:48,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-04-01 04:56:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-04-01 04:56:49,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:56:49,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 112 [2023-04-01 04:56:49,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2023-04-01 04:56:49,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2023-04-01 04:56:49,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 112 [2023-04-01 04:56:49,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:56:50,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2023-04-01 04:56:50,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2023-04-01 04:56:50,032 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_sll_update_at_#in~head.offset| 4))) (or (and (forall ((v_ArrVal_967 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_sll_update_at_~head.base v_ArrVal_967) |c_sll_update_at_#in~head.base|) .cse0) c_sll_update_at_~head.offset)) (< |c_sll_update_at_#in~data| (+ c_sll_update_at_~data 1)) (< c_sll_update_at_~data (+ 1 |c_sll_update_at_#in~data|)) (forall ((v_ArrVal_965 (Array Int Int))) (= c_sll_update_at_~head.base (select (select (store |c_#memory_$Pointer$.base| c_sll_update_at_~head.base v_ArrVal_965) |c_sll_update_at_#in~head.base|) .cse0)))) (= |c_sll_update_at_#in~head.base| (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) .cse0)))) is different from false [2023-04-01 04:56:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-04-01 04:56:55,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302404070] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:56:55,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [288210284] [2023-04-01 04:56:55,444 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-01 04:56:55,445 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:56:55,446 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:56:55,446 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:56:55,446 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:56:55,462 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:56:55,758 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 17 for LOIs [2023-04-01 04:56:55,778 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:56:55,990 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:56:56,001 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 29 for LOIs [2023-04-01 04:56:56,070 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:56:56,073 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:56:59,063 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4914#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= (+ main_~i~0 2) main_~expected~0) (<= main_~i~0 1) (= main_~len~0 2) (<= 0 main_~i~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:56:59,063 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:56:59,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:56:59,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 30] total 90 [2023-04-01 04:56:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489014985] [2023-04-01 04:56:59,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:56:59,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-04-01 04:56:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:56:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-04-01 04:56:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=11963, Unknown=23, NotChecked=442, Total=12882 [2023-04-01 04:56:59,067 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 90 states, 64 states have (on average 1.53125) internal successors, (98), 75 states have internal predecessors, (98), 17 states have call successors, (20), 9 states have call predecessors, (20), 21 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2023-04-01 04:57:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:03,031 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-04-01 04:57:03,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-04-01 04:57:03,032 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 64 states have (on average 1.53125) internal successors, (98), 75 states have internal predecessors, (98), 17 states have call successors, (20), 9 states have call predecessors, (20), 21 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) Word has length 54 [2023-04-01 04:57:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:03,033 INFO L225 Difference]: With dead ends: 54 [2023-04-01 04:57:03,033 INFO L226 Difference]: Without dead ends: 49 [2023-04-01 04:57:03,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 78 SyntacticMatches, 11 SemanticMatches, 140 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6192 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=841, Invalid=18601, Unknown=26, NotChecked=554, Total=20022 [2023-04-01 04:57:03,039 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 160 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 80 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:03,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 517 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2391 Invalid, 56 Unknown, 112 Unchecked, 2.2s Time] [2023-04-01 04:57:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-04-01 04:57:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-04-01 04:57:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 04:57:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-04-01 04:57:03,049 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 54 [2023-04-01 04:57:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:03,050 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-04-01 04:57:03,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 64 states have (on average 1.53125) internal successors, (98), 75 states have internal predecessors, (98), 17 states have call successors, (20), 9 states have call predecessors, (20), 21 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2023-04-01 04:57:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-04-01 04:57:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 04:57:03,051 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:57:03,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:57:03,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 04:57:03,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 04:57:03,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:57:03,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:57:03,258 INFO L85 PathProgramCache]: Analyzing trace with hash -560203226, now seen corresponding path program 2 times [2023-04-01 04:57:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:57:03,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114202624] [2023-04-01 04:57:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:57:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:57:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:57:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 04:57:03,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:57:03,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114202624] [2023-04-01 04:57:03,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114202624] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:57:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966162176] [2023-04-01 04:57:03,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 04:57:03,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:57:03,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:57:03,360 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 04:57:03,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 04:57:03,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 04:57:03,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:57:03,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 04:57:03,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:57:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 04:57:03,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:57:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 04:57:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966162176] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:57:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921417879] [2023-04-01 04:57:03,694 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-01 04:57:03,694 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:57:03,694 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:57:03,694 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:57:03,694 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:57:03,723 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:57:03,985 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 17 for LOIs [2023-04-01 04:57:04,002 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-01 04:57:04,208 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-01 04:57:04,220 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 29 for LOIs [2023-04-01 04:57:04,267 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:57:04,270 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:57:05,424 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5497#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= (+ main_~i~0 2) main_~expected~0) (<= main_~i~0 1) (= main_~len~0 2) (<= 0 main_~i~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:57:05,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:57:05,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:57:05,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-04-01 04:57:05,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983186580] [2023-04-01 04:57:05,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:57:05,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 04:57:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:57:05,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 04:57:05,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2023-04-01 04:57:05,430 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-01 04:57:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:57:05,531 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2023-04-01 04:57:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 04:57:05,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 55 [2023-04-01 04:57:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:57:05,532 INFO L225 Difference]: With dead ends: 48 [2023-04-01 04:57:05,532 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 04:57:05,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 133 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 04:57:05,536 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:57:05,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 76 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:57:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 04:57:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 04:57:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-01 04:57:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 04:57:05,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2023-04-01 04:57:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:57:05,537 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 04:57:05,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-01 04:57:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 04:57:05,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 04:57:05,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 04:57:05,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 04:57:05,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 04:57:05,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 04:57:08,097 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-01 04:57:08,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-01 04:57:08,097 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse1 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse2 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse4 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= |#NULL.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 |sll_update_at_#in~index|)) (let ((.cse5 (+ |sll_update_at_#in~head.offset| 4))) (and (<= 1 |sll_update_at_#in~index|) .cse0 .cse1 .cse2 .cse4 .cse3 (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse5) sll_update_at_~head.offset) (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse5) sll_update_at_~head.base))) (not (= |#NULL.base| 0)) (< |#StackHeapBarrier| 1) (and .cse0 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse2 .cse4 (<= sll_update_at_~index |sll_update_at_#in~index|) .cse3 (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (<= |sll_update_at_#in~index| sll_update_at_~index)))) [2023-04-01 04:57:08,098 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 606 612) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (< |#StackHeapBarrier| 1)) [2023-04-01 04:57:08,098 INFO L899 garLoopResultBuilder]: For program point sll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2023-04-01 04:57:08,098 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-04-01 04:57:08,098 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 571 573) the Hoare annotation is: true [2023-04-01 04:57:08,098 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2023-04-01 04:57:08,098 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-04-01 04:57:08,098 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 592 598) the Hoare annotation is: true [2023-04-01 04:57:08,098 INFO L899 garLoopResultBuilder]: For program point sll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2023-04-01 04:57:08,098 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (not (= |#NULL.offset| 0)) (and (<= 2 |sll_get_data_at_#in~index|) .cse0) (forall ((v_main_~s~0.base_BEFORE_CALL_57 Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_57) 4))) (or (not (= 3 (select (select |#memory_int| .cse1) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_57) 4)))) (= v_main_~s~0.base_BEFORE_CALL_57 .cse1)))) (forall ((v_main_~s~0.base_BEFORE_CALL_23 Int)) (let ((.cse2 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_23) 0))) (or (< 2 .cse2) (< .cse2 2)))) (let ((.cse3 (+ |sll_get_data_at_#in~head.offset| 4))) (and (<= 1 |sll_get_data_at_#in~index|) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse3)) .cse0 (= (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse3) sll_get_data_at_~head.offset))) (not (= |#NULL.base| 0)) (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= |sll_get_data_at_#in~index| sll_get_data_at_~index) (<= sll_get_data_at_~index |sll_get_data_at_#in~index|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) (< |#StackHeapBarrier| 1))) [2023-04-01 04:57:08,098 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 599 605) the Hoare annotation is: true [2023-04-01 04:57:08,098 INFO L899 garLoopResultBuilder]: For program point sll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2023-04-01 04:57:08,098 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 74 78) no Hoare annotation was computed. [2023-04-01 04:57:08,098 INFO L899 garLoopResultBuilder]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2023-04-01 04:57:08,098 INFO L899 garLoopResultBuilder]: For program point sll_createEXIT(lines 583 591) no Hoare annotation was computed. [2023-04-01 04:57:08,099 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse15 (select |#memory_int| 1))) (let ((.cse2 (= 1 sll_create_~data)) (.cse3 (< 0 sll_create_~len)) (.cse4 (<= sll_create_~len 2)) (.cse5 (= 2 (select |#length| 1))) (.cse1 (= |sll_create_#in~len| 2)) (.cse6 (= (select |#valid| 1) 1)) (.cse7 (= 19 (select |#length| 2))) (.cse8 (= (select |#valid| 0) 0)) (.cse9 (= (select |#valid| 2) 1)) (.cse0 (= |#NULL.offset| 0)) (.cse10 (= (select .cse15 0) 48)) (.cse11 (<= (+ sll_create_~head~0.base 1) |#StackHeapBarrier|)) (.cse12 (= (select .cse15 1) 0)) (.cse13 (= sll_create_~head~0.offset 0)) (.cse14 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not .cse0) (not .cse1) (and .cse2 .cse3 (= |#memory_int| |old(#memory_int)|) .cse4 .cse5 .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse6 .cse7 .cse8 .cse9 .cse0 (= 2 sll_create_~len) .cse10 .cse11 (= |old(#valid)| |#valid|) .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse5 .cse1 (forall ((v_node_create_~temp~0.base_78 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_78) 0)) (= (select |old(#valid)| v_node_create_~temp~0.base_78) 0))) .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) 4) 0) (= (select |#valid| sll_create_~head~0.base) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse14 0) 48)) (not (= |sll_create_#in~data| 1)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse14 1) 0)) (not (= 19 (select |old(#length)| 2)))))) [2023-04-01 04:57:08,099 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 583 591) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |sll_create_#in~len| 2)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= |sll_create_#in~data| 1)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (= 19 (select |old(#length)| 2))))) [2023-04-01 04:57:08,099 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-04-01 04:57:08,099 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse15 (select |#memory_int| 1))) (let ((.cse0 (= 1 sll_create_~data)) (.cse1 (<= sll_create_~len 2)) (.cse2 (= 2 (select |#length| 1))) (.cse3 (forall ((v_node_create_~temp~0.base_78 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_78) 0)) (= (select |old(#valid)| v_node_create_~temp~0.base_78) 0)))) (.cse4 (= (select |#valid| 1) 1)) (.cse5 (= 19 (select |#length| 2))) (.cse6 (= (select |#valid| 0) 0)) (.cse7 (= (select |#valid| 2) 1)) (.cse8 (= (select .cse15 0) 48)) (.cse9 (<= (+ sll_create_~head~0.base 1) |#StackHeapBarrier|)) (.cse10 (= (select .cse15 1) 0)) (.cse11 (= sll_create_~head~0.offset 0)) (.cse12 (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) 4) 0)) (.cse13 (= (select |#valid| sll_create_~head~0.base) 1)) (.cse14 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 sll_create_~len) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |sll_create_#in~len| 2)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (and .cse0 (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 2 sll_create_~len) .cse9 (= |old(#valid)| |#valid|) .cse11) (not (= (select .cse14 0) 48)) (and .cse0 (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |sll_create_#in~data| 1)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse14 1) 0)) (not (= 19 (select |old(#length)| 2)))))) [2023-04-01 04:57:08,099 INFO L902 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: true [2023-04-01 04:57:08,099 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-04-01 04:57:08,099 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-04-01 04:57:08,099 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |node_create_#in~data| 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (= 19 (select |old(#length)| 2))))) [2023-04-01 04:57:08,099 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-04-01 04:57:08,100 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-01 04:57:08,100 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 04:57:08,100 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2023-04-01 04:57:08,100 INFO L899 garLoopResultBuilder]: For program point L628(line 628) no Hoare annotation was computed. [2023-04-01 04:57:08,100 INFO L895 garLoopResultBuilder]: At program point L624(line 624) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| main_~s~0.base) 0))) (let ((.cse0 (<= .cse9 2)) (.cse1 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 4)) 0) 3)) (.cse2 (forall ((v_node_create_~temp~0.base_78 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_78) 0)) (= (select |old(#valid)| v_node_create_~temp~0.base_78) 0)))) (.cse3 (= main_~len~0 2)) (.cse4 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4) 0)) (.cse5 (= 3 main_~new_data~0)) (.cse6 (<= 2 .cse9)) (.cse7 (= main_~s~0.offset 0)) (.cse8 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~i~0 0) (= 2 main_~expected~0) .cse5 .cse6 .cse7) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse8 0) 48)) (and .cse0 (= 3 main_~expected~0) .cse1 .cse2 (= main_~i~0 1) .cse3 .cse4 .cse5 .cse6 .cse7) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse8 1) 0)) (not (= 19 (select |old(#length)| 2)))))) [2023-04-01 04:57:08,100 INFO L899 garLoopResultBuilder]: For program point L624-1(line 624) no Hoare annotation was computed. [2023-04-01 04:57:08,100 INFO L899 garLoopResultBuilder]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2023-04-01 04:57:08,100 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2023-04-01 04:57:08,100 INFO L895 garLoopResultBuilder]: At program point L620(line 620) the Hoare annotation is: (let ((.cse1 (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) 4)))) (.cse2 (forall ((v_node_create_~temp~0.base_78 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_78) 0)) (= (select |old(#valid)| v_node_create_~temp~0.base_78) 0)))) (.cse3 (= main_~len~0 2)) (.cse4 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4) 0)) (.cse5 (= main_~s~0.offset 0)) (.cse6 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse0 (select (select |#memory_int| main_~s~0.base) 0))) (and (<= .cse0 2) .cse1 .cse2 (= main_~i~0 1) .cse3 .cse4 (= 3 main_~new_data~0) (<= 2 .cse0) .cse5)) (and .cse1 .cse2 .cse3 .cse4 (= main_~i~0 0) (= 2 main_~new_data~0) .cse5) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse6 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse6 1) 0)) (not (= 19 (select |old(#length)| 2))))) [2023-04-01 04:57:08,100 INFO L899 garLoopResultBuilder]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2023-04-01 04:57:08,101 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| main_~s~0.base) 0))) (let ((.cse8 (select |old(#memory_int)| 1)) (.cse0 (<= .cse9 2)) (.cse4 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) 4)) 0) 3)) (.cse5 (forall ((v_node_create_~temp~0.base_78 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_78) 0)) (= (select |old(#valid)| v_node_create_~temp~0.base_78) 0)))) (.cse1 (= main_~len~0 2)) (.cse6 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4) 0)) (.cse7 (= 3 main_~new_data~0)) (.cse2 (<= 2 .cse9)) (.cse3 (= main_~s~0.offset 0))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and .cse0 (<= 2 main_~i~0) .cse1 .cse2 .cse3) (not (= |#NULL.base| 0)) (and .cse0 .cse4 .cse5 .cse1 .cse6 (= main_~i~0 0) .cse7 .cse2 .cse3) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse8 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse8 1) 0)) (and .cse0 .cse4 .cse5 (= main_~i~0 1) .cse1 .cse6 .cse7 .cse2 .cse3) (not (= 19 (select |old(#length)| 2)))))) [2023-04-01 04:57:08,101 INFO L895 garLoopResultBuilder]: At program point L622-4(lines 622 627) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (= main_~len~0 2) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= 19 (select |old(#length)| 2))))) [2023-04-01 04:57:08,101 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 613 632) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (= 19 (select |old(#length)| 2))))) [2023-04-01 04:57:08,101 INFO L895 garLoopResultBuilder]: At program point L616(line 616) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (and (= main_~data~0 1) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= main_~len~0 2) (= |old(#valid)| |#valid|)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= 19 (select |old(#length)| 2))))) [2023-04-01 04:57:08,101 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4)) (.cse10 (select (select |#memory_int| main_~s~0.base) 0))) (let ((.cse0 (<= .cse10 2)) (.cse5 (<= 2 .cse10)) (.cse1 (not (= main_~s~0.base .cse7))) (.cse2 (forall ((v_node_create_~temp~0.base_78 Int)) (or (not (= (select |#valid| v_node_create_~temp~0.base_78) 0)) (= (select |old(#valid)| v_node_create_~temp~0.base_78) 0)))) (.cse3 (= main_~len~0 2)) (.cse4 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4) 0)) (.cse6 (= main_~s~0.offset 0)) (.cse8 (select |old(#memory_int)| 1))) (or (and .cse0 .cse1 .cse2 (= main_~i~0 1) .cse3 .cse4 (= 2 main_~new_data~0) .cse5 .cse6) (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (and .cse0 (<= 2 main_~i~0) (= (select (select |#memory_int| .cse7) 0) 3) .cse2 .cse3 .cse4 (= 3 main_~new_data~0) .cse5 .cse6) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse8 0) 48)) (not (= (select |old(#valid)| 0) 0)) (let ((.cse9 (select |#memory_int| 1))) (and (= main_~data~0 1) .cse1 (= 2 (select |#length| 1)) .cse2 .cse3 .cse4 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= main_~i~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse9 0) 48) (= (select .cse9 1) 0) .cse6)) (<= |#StackHeapBarrier| 0) (not (= (select .cse8 1) 0)) (not (= 19 (select |old(#length)| 2)))))) [2023-04-01 04:57:08,101 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2023-04-01 04:57:08,102 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-04-01 04:57:08,102 INFO L895 garLoopResultBuilder]: At program point ERROR(lines 613 632) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= 19 (select |old(#length)| 2))))) [2023-04-01 04:57:08,102 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 79 83) no Hoare annotation was computed. [2023-04-01 04:57:08,102 INFO L899 garLoopResultBuilder]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2023-04-01 04:57:08,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 04:57:08,102 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-01 04:57:08,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 04:57:08,102 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 04:57:08,105 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1] [2023-04-01 04:57:08,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 04:57:08,114 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,125 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,125 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,125 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,126 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,126 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,127 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,128 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,129 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,129 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,130 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,130 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,132 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,132 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,134 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,134 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,142 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,142 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,143 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,143 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,143 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,143 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 04:57:08 BoogieIcfgContainer [2023-04-01 04:57:08,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 04:57:08,149 INFO L158 Benchmark]: Toolchain (without parser) took 48060.69ms. Allocated memory was 273.7MB in the beginning and 644.9MB in the end (delta: 371.2MB). Free memory was 217.4MB in the beginning and 438.7MB in the end (delta: -221.2MB). Peak memory consumption was 370.7MB. Max. memory is 8.0GB. [2023-04-01 04:57:08,149 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 04:57:08,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.12ms. Allocated memory is still 273.7MB. Free memory was 217.4MB in the beginning and 200.1MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-04-01 04:57:08,149 INFO L158 Benchmark]: Boogie Preprocessor took 79.38ms. Allocated memory is still 273.7MB. Free memory was 200.1MB in the beginning and 197.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-01 04:57:08,150 INFO L158 Benchmark]: RCFGBuilder took 570.12ms. Allocated memory is still 273.7MB. Free memory was 197.5MB in the beginning and 171.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-04-01 04:57:08,150 INFO L158 Benchmark]: TraceAbstraction took 46997.47ms. Allocated memory was 273.7MB in the beginning and 644.9MB in the end (delta: 371.2MB). Free memory was 170.2MB in the beginning and 438.7MB in the end (delta: -268.4MB). Peak memory consumption was 323.5MB. Max. memory is 8.0GB. [2023-04-01 04:57:08,151 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 408.12ms. Allocated memory is still 273.7MB. Free memory was 217.4MB in the beginning and 200.1MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.38ms. Allocated memory is still 273.7MB. Free memory was 200.1MB in the beginning and 197.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 570.12ms. Allocated memory is still 273.7MB. Free memory was 197.5MB in the beginning and 171.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 46997.47ms. Allocated memory was 273.7MB in the beginning and 644.9MB in the end (delta: 371.2MB). Free memory was 170.2MB in the beginning and 438.7MB in the end (delta: -268.4MB). Peak memory consumption was 323.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 61 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 1927 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 207 IncrementalHoareTripleChecker+Unchecked, 1631 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5084 IncrementalHoareTripleChecker+Invalid, 5555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 296 mSDtfsCounter, 5084 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1461 GetRequests, 931 SyntacticMatches, 42 SemanticMatches, 488 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11594 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=9, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 68 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 68 PreInvPairs, 97 NumberOfFragments, 1994 HoareAnnotationTreeSize, 68 FomulaSimplifications, 2842 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 24 FomulaSimplificationsInter, 4418 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 1107 NumberOfCodeBlocks, 1082 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1421 ConstructedInterpolants, 21 QuantifiedInterpolants, 5537 SizeOfPredicates, 58 NumberOfNonLiveVariables, 3864 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 474/606 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 1.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 20, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 24, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 18, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 14, TOOLS_POST_RETURN_TIME: 0.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 56, TOOLS_QUANTIFIERELIM_TIME: 0.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 80, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 9, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 20, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 0.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 14, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 172, DAG_COMPRESSION_RETAINED_NODES: 78, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 607]: Loop Invariant [2023-04-01 04:57:08,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((!(#NULL == 0) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index))) || (((((((1 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$[head][head + 4] == head) && #memory_$Pointer$[head][head + 4] == head)) || !(#NULL == 0)) || unknown-#StackHeapBarrier-unknown < 1) || (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && head == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && index <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head) && \old(index) <= index) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2023-04-01 04:57:08,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,172 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,172 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((((((((((1 == data && len <= 2) && 2 == unknown-#length-unknown[1]) && (forall v_node_create_~temp~0.base_78 : int :: !(\valid[v_node_create_~temp~0.base_78] == 0) || \old(\valid)[v_node_create_~temp~0.base_78] == 0)) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && 1 <= len) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && head + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][1] == 0) && head == 0) && #memory_$Pointer$[head][4] == 0) && \valid[head] == 1)) || !(\old(len) == 2)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || ((((((((1 == data && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 == len) && head + 1 <= unknown-#StackHeapBarrier-unknown) && \old(\valid) == \valid) && head == 0)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || ((((((((((((((1 == data && !(head == #memory_$Pointer$[head][4])) && len <= 2) && 2 == unknown-#length-unknown[1]) && (forall v_node_create_~temp~0.base_78 : int :: !(\valid[v_node_create_~temp~0.base_78] == 0) || \old(\valid)[v_node_create_~temp~0.base_78] == 0)) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && head + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][1] == 0) && head == 0) && #memory_$Pointer$[head][4] == 0) && \valid[head] == 1)) || !(\old(data) == 1)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(19 == \old(unknown-#length-unknown)[2]) - InvariantResult [Line: 618]: Loop Invariant [2023-04-01 04:57:08,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,182 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((unknown-#memory_int-unknown[s][0] <= 2 && !(s == #memory_$Pointer$[s][4])) && (forall v_node_create_~temp~0.base_78 : int :: !(\valid[v_node_create_~temp~0.base_78] == 0) || \old(\valid)[v_node_create_~temp~0.base_78] == 0)) && i == 1) && len == 2) && #memory_$Pointer$[s][4] == 0) && 2 == new_data) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0) || !(\old(\valid)[2] == 1)) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || ((((((((unknown-#memory_int-unknown[s][0] <= 2 && 2 <= i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][0] == 3) && (forall v_node_create_~temp~0.base_78 : int :: !(\valid[v_node_create_~temp~0.base_78] == 0) || \old(\valid)[v_node_create_~temp~0.base_78] == 0)) && len == 2) && #memory_$Pointer$[s][4] == 0) && 3 == new_data) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || (((((((((((((data == 1 && !(s == #memory_$Pointer$[s][4])) && 2 == unknown-#length-unknown[1]) && (forall v_node_create_~temp~0.base_78 : int :: !(\valid[v_node_create_~temp~0.base_78] == 0) || \old(\valid)[v_node_create_~temp~0.base_78] == 0)) && len == 2) && #memory_$Pointer$[s][4] == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && i == 0) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && s == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(19 == \old(unknown-#length-unknown)[2]) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(19 == \old(unknown-#length-unknown)[2]) - InvariantResult [Line: 600]: Loop Invariant [2023-04-01 04:57:08,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_57,QUANTIFIED] [2023-04-01 04:57:08,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_23,QUANTIFIED] [2023-04-01 04:57:08,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(#NULL == 0) || (2 <= \old(index) && index + 1 <= \old(index))) || (forall v_main_~s~0.base_BEFORE_CALL_57 : int :: !(3 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_57][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_57][4]]) || v_main_~s~0.base_BEFORE_CALL_57 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_57][4])) || (forall v_main_~s~0.base_BEFORE_CALL_23 : int :: 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_23][0] || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_23][0] < 2)) || (((1 <= \old(index) && head == #memory_$Pointer$[head][head + 4]) && index + 1 <= \old(index)) && #memory_$Pointer$[head][head + 4] == head)) || !(#NULL == 0)) || (((head == head && \old(index) <= index) && index <= \old(index)) && head == head)) || unknown-#StackHeapBarrier-unknown < 1 - InvariantResult [Line: 622]: Loop Invariant [2023-04-01 04:57:08,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,198 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,198 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-01 04:57:08,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-01 04:57:08,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_node_create_~temp~0.base_78,QUANTIFIED] [2023-04-01 04:57:08,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((unknown-#memory_int-unknown[s][0] <= 2 && 2 <= i) && len == 2) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0)) || !(#NULL == 0)) || ((((((((unknown-#memory_int-unknown[s][0] <= 2 && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][0] == 3) && (forall v_node_create_~temp~0.base_78 : int :: !(\valid[v_node_create_~temp~0.base_78] == 0) || \old(\valid)[v_node_create_~temp~0.base_78] == 0)) && len == 2) && #memory_$Pointer$[s][4] == 0) && i == 0) && 3 == new_data) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || ((((((((unknown-#memory_int-unknown[s][0] <= 2 && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][0] == 3) && (forall v_node_create_~temp~0.base_78 : int :: !(\valid[v_node_create_~temp~0.base_78] == 0) || \old(\valid)[v_node_create_~temp~0.base_78] == 0)) && i == 1) && len == 2) && #memory_$Pointer$[s][4] == 0) && 3 == new_data) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0)) || !(19 == \old(unknown-#length-unknown)[2]) RESULT: Ultimate proved your program to be correct! [2023-04-01 04:57:08,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...