./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:26:34,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:26:34,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:26:34,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:26:34,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:26:34,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:26:34,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:26:34,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:26:34,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:26:34,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:26:34,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:26:34,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:26:34,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:26:34,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:26:34,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:26:34,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:26:34,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:26:34,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:26:34,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:26:34,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:26:34,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:26:34,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:26:34,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:26:34,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:26:34,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:26:34,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:26:34,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:26:34,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:26:34,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:26:34,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:26:34,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:26:34,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:26:34,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:26:34,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:26:34,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:26:34,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:26:34,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:26:34,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:26:34,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:26:34,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:26:34,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:26:34,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 21:26:34,212 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:26:34,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:26:34,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:26:34,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:26:34,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:26:34,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:26:34,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:26:34,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:26:34,215 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:26:34,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:26:34,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:26:34,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:26:34,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:26:34,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:26:34,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:26:34,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:26:34,216 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:26:34,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:26:34,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:26:34,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:26:34,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:26:34,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:26:34,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:26:34,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:26:34,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:26:34,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:26:34,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:26:34,218 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:26:34,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:26:34,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:26:34,218 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:26:34,218 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2021-11-16 21:26:34,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:26:34,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:26:34,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:26:34,405 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:26:34,406 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:26:34,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2021-11-16 21:26:34,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c234eecba/d4eacffd8c2e4b2f8b2d03bb439abfd1/FLAG1c7941523 [2021-11-16 21:26:34,955 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:26:34,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2021-11-16 21:26:34,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c234eecba/d4eacffd8c2e4b2f8b2d03bb439abfd1/FLAG1c7941523 [2021-11-16 21:26:35,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c234eecba/d4eacffd8c2e4b2f8b2d03bb439abfd1 [2021-11-16 21:26:35,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:26:35,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:26:35,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:26:35,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:26:35,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:26:35,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:26:35" (1/1) ... [2021-11-16 21:26:35,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718fc30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:35, skipping insertion in model container [2021-11-16 21:26:35,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:26:35" (1/1) ... [2021-11-16 21:26:35,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:26:35,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:26:35,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2021-11-16 21:26:35,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2021-11-16 21:26:35,778 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:26:35,781 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:26:36,321 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,321 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,323 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,323 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,324 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,334 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,335 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,336 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,336 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,337 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,337 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,338 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,338 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,536 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:26:36,537 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:26:36,538 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:26:36,539 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:26:36,540 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:26:36,541 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:26:36,541 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:26:36,541 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:26:36,542 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:26:36,542 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:26:36,636 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:26:36,666 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:26:36,677 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:26:36,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2021-11-16 21:26:36,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2021-11-16 21:26:36,694 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:26:36,694 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:26:36,721 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,721 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,722 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,723 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,723 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,730 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,731 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,732 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,732 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,733 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,733 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,733 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,733 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:26:36,750 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:26:36,750 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:26:36,751 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:26:36,751 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:26:36,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:26:36,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:26:36,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:26:36,755 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:26:36,756 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:26:36,756 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:26:36,768 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:26:36,795 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:26:36,897 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:26:36,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36 WrapperNode [2021-11-16 21:26:36,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:26:36,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:26:36,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:26:36,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:26:36,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:36,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:36,991 INFO L137 Inliner]: procedures = 681, calls = 1041, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2021-11-16 21:26:36,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:26:36,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:26:36,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:26:36,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:26:37,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:26:37,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:26:37,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:26:37,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:26:37,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (1/1) ... [2021-11-16 21:26:37,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:26:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:26:37,059 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) [2021-11-16 21:26:37,079 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 [2021-11-16 21:26:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:26:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:26:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:26:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2021-11-16 21:26:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2021-11-16 21:26:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:26:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:26:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:26:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:26:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:26:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:26:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:26:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:26:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:26:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2021-11-16 21:26:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2021-11-16 21:26:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:26:37,294 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:26:37,295 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:26:37,431 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:26:37,435 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:26:37,436 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 21:26:37,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:26:37 BoogieIcfgContainer [2021-11-16 21:26:37,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:26:37,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:26:37,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:26:37,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:26:37,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:26:35" (1/3) ... [2021-11-16 21:26:37,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625ec441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:26:37, skipping insertion in model container [2021-11-16 21:26:37,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:26:36" (2/3) ... [2021-11-16 21:26:37,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625ec441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:26:37, skipping insertion in model container [2021-11-16 21:26:37,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:26:37" (3/3) ... [2021-11-16 21:26:37,443 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2021-11-16 21:26:37,446 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:26:37,446 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:26:37,483 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:26:37,488 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:26:37,490 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:26:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-16 21:26:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-16 21:26:37,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:37,515 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:37,516 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1117195627, now seen corresponding path program 1 times [2021-11-16 21:26:37,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:37,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220533195] [2021-11-16 21:26:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:37,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 21:26:37,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:37,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220533195] [2021-11-16 21:26:37,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220533195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:37,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:37,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-16 21:26:37,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522114496] [2021-11-16 21:26:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:37,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 21:26:37,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:37,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 21:26:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:26:37,879 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-16 21:26:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:37,901 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2021-11-16 21:26:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 21:26:37,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-11-16 21:26:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:37,913 INFO L225 Difference]: With dead ends: 94 [2021-11-16 21:26:37,913 INFO L226 Difference]: Without dead ends: 45 [2021-11-16 21:26:37,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:26:37,918 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:37,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:26:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-16 21:26:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-16 21:26:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-16 21:26:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2021-11-16 21:26:37,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2021-11-16 21:26:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:37,948 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2021-11-16 21:26:37,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-16 21:26:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2021-11-16 21:26:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-16 21:26:37,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:37,950 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:37,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 21:26:37,951 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 96127273, now seen corresponding path program 1 times [2021-11-16 21:26:37,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:37,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391638623] [2021-11-16 21:26:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:37,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:38,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-16 21:26:38,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:38,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391638623] [2021-11-16 21:26:38,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391638623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:38,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:38,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:26:38,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698350576] [2021-11-16 21:26:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:38,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:26:38,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:26:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:26:38,419 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-16 21:26:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:38,635 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2021-11-16 21:26:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:26:38,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-11-16 21:26:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:38,640 INFO L225 Difference]: With dead ends: 56 [2021-11-16 21:26:38,640 INFO L226 Difference]: Without dead ends: 54 [2021-11-16 21:26:38,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:26:38,642 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:38,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 271 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:26:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-16 21:26:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2021-11-16 21:26:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 21:26:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2021-11-16 21:26:38,661 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2021-11-16 21:26:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:38,662 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2021-11-16 21:26:38,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-16 21:26:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2021-11-16 21:26:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-16 21:26:38,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:38,664 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:38,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 21:26:38,664 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:38,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash -713219353, now seen corresponding path program 1 times [2021-11-16 21:26:38,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:38,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735715504] [2021-11-16 21:26:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:38,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:38,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-16 21:26:39,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:39,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735715504] [2021-11-16 21:26:39,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735715504] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:26:39,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962604945] [2021-11-16 21:26:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:39,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:26:39,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:26:39,014 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) [2021-11-16 21:26:39,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 21:26:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:39,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-16 21:26:39,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:26:39,189 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-16 21:26:39,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2021-11-16 21:26:39,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 31 [2021-11-16 21:26:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-16 21:26:39,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:26:39,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962604945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:39,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:26:39,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2021-11-16 21:26:39,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260463965] [2021-11-16 21:26:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:39,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:26:39,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:26:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:26:39,800 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-16 21:26:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:39,806 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2021-11-16 21:26:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:26:39,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-11-16 21:26:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:39,807 INFO L225 Difference]: With dead ends: 106 [2021-11-16 21:26:39,807 INFO L226 Difference]: Without dead ends: 68 [2021-11-16 21:26:39,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:26:39,808 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:39,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 47 Unchecked, 0.0s Time] [2021-11-16 21:26:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-16 21:26:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-11-16 21:26:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 21:26:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2021-11-16 21:26:39,815 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 28 [2021-11-16 21:26:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:39,815 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2021-11-16 21:26:39,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-16 21:26:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2021-11-16 21:26:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-16 21:26:39,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:39,816 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:39,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:26:40,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:26:40,029 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1106246363, now seen corresponding path program 1 times [2021-11-16 21:26:40,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:40,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14048332] [2021-11-16 21:26:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:40,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-16 21:26:40,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:40,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14048332] [2021-11-16 21:26:40,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14048332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:40,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:40,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:26:40,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498667694] [2021-11-16 21:26:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:40,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:26:40,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:26:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:26:40,142 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-16 21:26:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:40,166 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2021-11-16 21:26:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:26:40,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-11-16 21:26:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:40,169 INFO L225 Difference]: With dead ends: 134 [2021-11-16 21:26:40,169 INFO L226 Difference]: Without dead ends: 64 [2021-11-16 21:26:40,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:26:40,172 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:40,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 143 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:26:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-16 21:26:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2021-11-16 21:26:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-16 21:26:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-11-16 21:26:40,187 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 28 [2021-11-16 21:26:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:40,187 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-11-16 21:26:40,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-16 21:26:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-11-16 21:26:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-16 21:26:40,189 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:40,190 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-11-16 21:26:40,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 21:26:40,190 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash 695086179, now seen corresponding path program 1 times [2021-11-16 21:26:40,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:40,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821883019] [2021-11-16 21:26:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:40,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 21:26:40,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:40,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821883019] [2021-11-16 21:26:40,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821883019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:40,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:40,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 21:26:40,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000229867] [2021-11-16 21:26:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:40,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:26:40,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:26:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:26:40,465 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-16 21:26:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:40,638 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-11-16 21:26:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:26:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-11-16 21:26:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:40,640 INFO L225 Difference]: With dead ends: 70 [2021-11-16 21:26:40,640 INFO L226 Difference]: Without dead ends: 68 [2021-11-16 21:26:40,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:26:40,641 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:40,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 329 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:26:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-16 21:26:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-11-16 21:26:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 21:26:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-11-16 21:26:40,646 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 42 [2021-11-16 21:26:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:40,646 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-11-16 21:26:40,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-16 21:26:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2021-11-16 21:26:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-16 21:26:40,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:40,647 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-11-16 21:26:40,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 21:26:40,647 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -114260447, now seen corresponding path program 1 times [2021-11-16 21:26:40,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:40,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365566499] [2021-11-16 21:26:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:40,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 21:26:40,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:40,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365566499] [2021-11-16 21:26:40,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365566499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:40,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:40,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:26:40,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573824777] [2021-11-16 21:26:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:40,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:26:40,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:26:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:26:40,797 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-16 21:26:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:40,927 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2021-11-16 21:26:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:26:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-11-16 21:26:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:40,929 INFO L225 Difference]: With dead ends: 108 [2021-11-16 21:26:40,929 INFO L226 Difference]: Without dead ends: 73 [2021-11-16 21:26:40,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:26:40,931 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:40,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 170 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:26:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-16 21:26:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-11-16 21:26:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-16 21:26:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2021-11-16 21:26:40,946 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 42 [2021-11-16 21:26:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:40,946 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2021-11-16 21:26:40,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-16 21:26:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2021-11-16 21:26:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-16 21:26:40,949 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:40,949 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-11-16 21:26:40,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 21:26:40,949 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash -507287457, now seen corresponding path program 1 times [2021-11-16 21:26:40,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:40,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057862973] [2021-11-16 21:26:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:40,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:41,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-16 21:26:41,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:41,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057862973] [2021-11-16 21:26:41,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057862973] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:26:41,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507112223] [2021-11-16 21:26:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:41,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:26:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:26:41,197 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) [2021-11-16 21:26:41,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 21:26:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:41,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-16 21:26:41,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:26:41,294 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-16 21:26:41,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2021-11-16 21:26:41,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 31 [2021-11-16 21:26:41,791 INFO L354 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2021-11-16 21:26:41,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 76 [2021-11-16 21:26:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 21:26:41,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:26:41,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507112223] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:41,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:26:41,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 16 [2021-11-16 21:26:41,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925960923] [2021-11-16 21:26:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:41,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:26:41,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:41,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:26:41,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:26:41,880 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-16 21:26:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:41,900 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2021-11-16 21:26:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:26:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-11-16 21:26:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:41,902 INFO L225 Difference]: With dead ends: 119 [2021-11-16 21:26:41,902 INFO L226 Difference]: Without dead ends: 74 [2021-11-16 21:26:41,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:26:41,903 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:41,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 240 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2021-11-16 21:26:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-16 21:26:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2021-11-16 21:26:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-16 21:26:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2021-11-16 21:26:41,919 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 42 [2021-11-16 21:26:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:41,919 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-11-16 21:26:41,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-16 21:26:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2021-11-16 21:26:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-16 21:26:41,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:41,920 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:41,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-16 21:26:42,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-16 21:26:42,123 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash 709260864, now seen corresponding path program 1 times [2021-11-16 21:26:42,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:42,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382188215] [2021-11-16 21:26:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:42,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:26:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-16 21:26:42,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:42,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382188215] [2021-11-16 21:26:42,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382188215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:42,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:42,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:26:42,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79119066] [2021-11-16 21:26:42,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:42,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:26:42,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:26:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:26:42,244 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 21:26:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:42,301 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2021-11-16 21:26:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:26:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2021-11-16 21:26:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:42,302 INFO L225 Difference]: With dead ends: 74 [2021-11-16 21:26:42,302 INFO L226 Difference]: Without dead ends: 72 [2021-11-16 21:26:42,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:26:42,303 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:42,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 219 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:26:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-16 21:26:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-16 21:26:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 52 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-16 21:26:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-11-16 21:26:42,307 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 48 [2021-11-16 21:26:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:42,307 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-11-16 21:26:42,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 21:26:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-11-16 21:26:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-16 21:26:42,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:42,308 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:42,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 21:26:42,308 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -593356994, now seen corresponding path program 1 times [2021-11-16 21:26:42,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:42,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818026935] [2021-11-16 21:26:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:42,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:26:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:26:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:26:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-16 21:26:42,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:42,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818026935] [2021-11-16 21:26:42,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818026935] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:42,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:42,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 21:26:42,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489867638] [2021-11-16 21:26:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:42,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:26:42,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:26:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:26:42,533 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 21:26:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:42,719 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2021-11-16 21:26:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:26:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2021-11-16 21:26:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:42,720 INFO L225 Difference]: With dead ends: 83 [2021-11-16 21:26:42,720 INFO L226 Difference]: Without dead ends: 81 [2021-11-16 21:26:42,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:26:42,721 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:42,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 309 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:26:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-16 21:26:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-11-16 21:26:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 12 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 21:26:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2021-11-16 21:26:42,725 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 63 [2021-11-16 21:26:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:42,726 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2021-11-16 21:26:42,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-16 21:26:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2021-11-16 21:26:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-16 21:26:42,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:42,726 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:42,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 21:26:42,727 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1402703620, now seen corresponding path program 1 times [2021-11-16 21:26:42,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:42,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101081867] [2021-11-16 21:26:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:42,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:26:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:26:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:26:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-16 21:26:43,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:43,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101081867] [2021-11-16 21:26:43,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101081867] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:26:43,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703533097] [2021-11-16 21:26:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:43,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:26:43,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:26:43,015 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) [2021-11-16 21:26:43,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 21:26:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:43,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-16 21:26:43,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:26:43,107 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-16 21:26:43,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 29 [2021-11-16 21:26:43,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 37 [2021-11-16 21:26:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-16 21:26:44,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:26:44,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703533097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:44,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:26:44,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2021-11-16 21:26:44,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721508408] [2021-11-16 21:26:44,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:44,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:26:44,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:44,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:26:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:26:44,210 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-16 21:26:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:44,214 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2021-11-16 21:26:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:26:44,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2021-11-16 21:26:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:44,215 INFO L225 Difference]: With dead ends: 121 [2021-11-16 21:26:44,215 INFO L226 Difference]: Without dead ends: 89 [2021-11-16 21:26:44,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 14 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:26:44,216 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:44,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 65 Unchecked, 0.0s Time] [2021-11-16 21:26:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-16 21:26:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2021-11-16 21:26:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.103448275862069) internal successors, (64), 61 states have internal predecessors, (64), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-16 21:26:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-11-16 21:26:44,221 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 63 [2021-11-16 21:26:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:44,221 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-11-16 21:26:44,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-16 21:26:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-11-16 21:26:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-16 21:26:44,222 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:44,222 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:44,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 21:26:44,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:26:44,435 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1795730630, now seen corresponding path program 1 times [2021-11-16 21:26:44,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:44,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33707873] [2021-11-16 21:26:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:44,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:26:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:26:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:26:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-16 21:26:44,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:44,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33707873] [2021-11-16 21:26:44,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33707873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:44,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:44,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:26:44,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039827900] [2021-11-16 21:26:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:44,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:26:44,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:44,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:26:44,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:26:44,524 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-16 21:26:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:44,535 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-11-16 21:26:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:26:44,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2021-11-16 21:26:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:44,536 INFO L225 Difference]: With dead ends: 110 [2021-11-16 21:26:44,536 INFO L226 Difference]: Without dead ends: 78 [2021-11-16 21:26:44,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:26:44,537 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:44,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 147 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:26:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-16 21:26:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-16 21:26:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 56 states have internal predecessors, (58), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-16 21:26:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-11-16 21:26:44,541 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 63 [2021-11-16 21:26:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:44,542 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-11-16 21:26:44,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-16 21:26:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-11-16 21:26:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-16 21:26:44,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:44,543 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:44,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 21:26:44,559 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash 180273006, now seen corresponding path program 1 times [2021-11-16 21:26:44,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:44,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763991907] [2021-11-16 21:26:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:44,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:26:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:26:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:26:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 21:26:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:26:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-16 21:26:44,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:44,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763991907] [2021-11-16 21:26:44,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763991907] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:26:44,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:26:44,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-16 21:26:44,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592048972] [2021-11-16 21:26:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:26:44,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 21:26:44,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:26:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 21:26:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:26:44,929 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-16 21:26:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:26:45,326 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2021-11-16 21:26:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 21:26:45,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 77 [2021-11-16 21:26:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:26:45,327 INFO L225 Difference]: With dead ends: 89 [2021-11-16 21:26:45,327 INFO L226 Difference]: Without dead ends: 87 [2021-11-16 21:26:45,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-11-16 21:26:45,328 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:26:45,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 352 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:26:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-16 21:26:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2021-11-16 21:26:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 62 states have internal predecessors, (63), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-16 21:26:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-11-16 21:26:45,335 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 77 [2021-11-16 21:26:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:26:45,335 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-11-16 21:26:45,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-16 21:26:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2021-11-16 21:26:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-16 21:26:45,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:26:45,339 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:26:45,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-16 21:26:45,340 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:26:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:26:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -629073620, now seen corresponding path program 1 times [2021-11-16 21:26:45,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:26:45,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755001268] [2021-11-16 21:26:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:45,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:26:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:26:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:26:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:26:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:26:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:26:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:26:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:26:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:26:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 21:26:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:26:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:26:45,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:26:45,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755001268] [2021-11-16 21:26:45,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755001268] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:26:45,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970621833] [2021-11-16 21:26:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:26:45,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:26:45,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:26:45,571 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) [2021-11-16 21:26:45,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 21:26:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:26:45,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-16 21:26:45,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:26:46,483 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2021-11-16 21:26:47,180 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_2| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_2|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_2|) 0)))) is different from true [2021-11-16 21:26:47,889 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2021-11-16 21:26:48,605 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0)))) is different from true [2021-11-16 21:26:49,291 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0)))) is different from true [2021-11-16 21:27:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2021-11-16 21:27:00,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:27:00,819 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-16 21:27:00,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-16 21:27:00,824 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-11-16 21:27:00,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-11-16 21:27:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-16 21:27:00,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970621833] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:27:00,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:27:00,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 13] total 26 [2021-11-16 21:27:00,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581041750] [2021-11-16 21:27:00,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:27:00,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-16 21:27:00,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:27:00,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-16 21:27:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=358, Unknown=9, NotChecked=210, Total=650 [2021-11-16 21:27:00,871 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 21:27:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:27:03,998 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-11-16 21:27:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-16 21:27:03,999 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 77 [2021-11-16 21:27:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:27:03,999 INFO L225 Difference]: With dead ends: 101 [2021-11-16 21:27:03,999 INFO L226 Difference]: Without dead ends: 89 [2021-11-16 21:27:04,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 155 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=145, Invalid=618, Unknown=13, NotChecked=280, Total=1056 [2021-11-16 21:27:04,000 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:27:04,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 350 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 0 Unknown, 447 Unchecked, 0.1s Time] [2021-11-16 21:27:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-16 21:27:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-11-16 21:27:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 64 states have internal predecessors, (65), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-16 21:27:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-11-16 21:27:04,005 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 77 [2021-11-16 21:27:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:27:04,005 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-11-16 21:27:04,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 21:27:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-11-16 21:27:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-16 21:27:04,006 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:27:04,006 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:27:04,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:27:04,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:27:04,207 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:27:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:27:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1022100630, now seen corresponding path program 1 times [2021-11-16 21:27:04,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:27:04,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128703422] [2021-11-16 21:27:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:27:04,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:27:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:27:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:27:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:27:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:27:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:27:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:27:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:27:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:27:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 21:27:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:27:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-16 21:27:04,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:27:04,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128703422] [2021-11-16 21:27:04,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128703422] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:27:04,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214335684] [2021-11-16 21:27:04,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:27:04,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:27:04,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:27:04,410 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) [2021-11-16 21:27:04,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 21:27:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:04,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-16 21:27:04,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:27:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:27:04,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:27:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-16 21:27:05,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214335684] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:27:05,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:27:05,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 12 [2021-11-16 21:27:05,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053409252] [2021-11-16 21:27:05,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:27:05,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 21:27:05,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:27:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 21:27:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-16 21:27:05,033 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-16 21:27:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:27:05,161 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2021-11-16 21:27:05,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:27:05,161 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2021-11-16 21:27:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:27:05,162 INFO L225 Difference]: With dead ends: 104 [2021-11-16 21:27:05,162 INFO L226 Difference]: Without dead ends: 80 [2021-11-16 21:27:05,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:27:05,163 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:27:05,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 335 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:27:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-16 21:27:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-11-16 21:27:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 57 states have internal predecessors, (57), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-16 21:27:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2021-11-16 21:27:05,168 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2021-11-16 21:27:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:27:05,168 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2021-11-16 21:27:05,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-16 21:27:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2021-11-16 21:27:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-16 21:27:05,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:27:05,169 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:27:05,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:27:05,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-16 21:27:05,384 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:27:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:27:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1529037313, now seen corresponding path program 1 times [2021-11-16 21:27:05,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:27:05,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113880904] [2021-11-16 21:27:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:27:05,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:27:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:27:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-16 21:27:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:27:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:27:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 21:27:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:27:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:27:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:27:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 21:27:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:27:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 21:27:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:27:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-16 21:27:05,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:27:05,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113880904] [2021-11-16 21:27:05,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113880904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:27:05,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:27:05,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 21:27:05,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259920260] [2021-11-16 21:27:05,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:27:05,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:27:05,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:27:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:27:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:27:05,626 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-16 21:27:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:27:05,794 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2021-11-16 21:27:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:27:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 83 [2021-11-16 21:27:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:27:05,795 INFO L225 Difference]: With dead ends: 80 [2021-11-16 21:27:05,795 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 21:27:05,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:27:05,796 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:27:05,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 325 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:27:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 21:27:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 21:27:05,797 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) [2021-11-16 21:27:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 21:27:05,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2021-11-16 21:27:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:27:05,797 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 21:27:05,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-16 21:27:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 21:27:05,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 21:27:05,799 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 21:27:05,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-16 21:27:05,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 21:27:06,741 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2021-11-16 21:27:06,741 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2021-11-16 21:27:06,741 INFO L858 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2021-11-16 21:27:06,741 INFO L858 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2021-11-16 21:27:06,741 INFO L858 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2021-11-16 21:27:06,741 INFO L858 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2021-11-16 21:27:06,741 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2021-11-16 21:27:06,741 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2021-11-16 21:27:06,742 INFO L858 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2021-11-16 21:27:06,742 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2021-11-16 21:27:06,742 INFO L858 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2021-11-16 21:27:06,742 INFO L858 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2021-11-16 21:27:06,742 INFO L858 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2021-11-16 21:27:06,742 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2021-11-16 21:27:06,742 INFO L858 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2021-11-16 21:27:06,742 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 21:27:06,743 INFO L854 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-11-16 21:27:06,743 INFO L861 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2021-11-16 21:27:06,743 INFO L858 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2021-11-16 21:27:06,743 INFO L854 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-11-16 21:27:06,743 INFO L854 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-11-16 21:27:06,743 INFO L854 garLoopResultBuilder]: At program point L4854(lines 4848 4855) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= (select (select |#memory_$Pointer$.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0))) [2021-11-16 21:27:06,744 INFO L854 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select .cse0 8)) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)))) (= (select .cse3 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1| 1))) [2021-11-16 21:27:06,744 INFO L858 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2021-11-16 21:27:06,744 INFO L854 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select .cse0 8)) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)))) (= (select .cse3 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2021-11-16 21:27:06,744 INFO L854 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-11-16 21:27:06,744 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 21:27:06,744 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 21:27:06,744 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 21:27:06,745 INFO L858 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2021-11-16 21:27:06,745 INFO L854 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-11-16 21:27:06,745 INFO L854 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse2 (select .cse0 8)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)))) (= (select .cse4 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select .cse4 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)))) [2021-11-16 21:27:06,745 INFO L854 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select .cse0 8)) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)))) (= (select .cse3 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2021-11-16 21:27:06,745 INFO L854 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select .cse0 8)) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.base|) (= (select .cse3 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2021-11-16 21:27:06,745 INFO L858 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2021-11-16 21:27:06,745 INFO L858 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2021-11-16 21:27:06,746 INFO L854 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)))) (= (select .cse3 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2021-11-16 21:27:06,746 INFO L858 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2021-11-16 21:27:06,746 INFO L858 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2021-11-16 21:27:06,746 INFO L854 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)))) (= (select .cse3 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2021-11-16 21:27:06,746 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:27:06,746 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-16 21:27:06,746 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-16 21:27:06,746 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:27:06,747 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-16 21:27:06,747 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-16 21:27:06,747 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-16 21:27:06,747 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:27:06,747 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:27:06,747 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-16 21:27:06,749 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:27:06,750 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:27:06,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:27:06 BoogieIcfgContainer [2021-11-16 21:27:06,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:27:06,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:27:06,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:27:06,775 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:27:06,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:26:37" (3/4) ... [2021-11-16 21:27:06,777 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 21:27:06,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2021-11-16 21:27:06,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2021-11-16 21:27:06,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-16 21:27:06,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-16 21:27:06,785 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-11-16 21:27:06,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-16 21:27:06,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-16 21:27:06,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 21:27:06,801 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((rval == before && node == node) && before == \result) && #memory_$Pointer$[#memory_$Pointer$[\result][\result]][8] == \result) && node == node) && #memory_$Pointer$[rval][rval] == node) && !(node == 0)) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][8]][0]) && #memory_$Pointer$[#memory_$Pointer$[\result][\result]][8] == \result) && #memory_$Pointer$[node][8] == 0) && before == \result) && before == rval) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 [2021-11-16 21:27:06,819 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 21:27:06,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:27:06,820 INFO L158 Benchmark]: Toolchain (without parser) took 31342.74ms. Allocated memory was 98.6MB in the beginning and 272.6MB in the end (delta: 174.1MB). Free memory was 57.3MB in the beginning and 86.7MB in the end (delta: -29.4MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. [2021-11-16 21:27:06,820 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:27:06,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1420.28ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.1MB in the beginning and 57.6MB in the end (delta: -500.0kB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2021-11-16 21:27:06,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.48ms. Allocated memory is still 119.5MB. Free memory was 57.6MB in the beginning and 52.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 21:27:06,820 INFO L158 Benchmark]: Boogie Preprocessor took 30.04ms. Allocated memory is still 119.5MB. Free memory was 52.3MB in the beginning and 50.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-16 21:27:06,821 INFO L158 Benchmark]: RCFGBuilder took 412.94ms. Allocated memory is still 119.5MB. Free memory was 50.2MB in the beginning and 66.1MB in the end (delta: -15.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2021-11-16 21:27:06,821 INFO L158 Benchmark]: TraceAbstraction took 29336.54ms. Allocated memory was 119.5MB in the beginning and 272.6MB in the end (delta: 153.1MB). Free memory was 65.4MB in the beginning and 90.9MB in the end (delta: -25.5MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2021-11-16 21:27:06,821 INFO L158 Benchmark]: Witness Printer took 44.31ms. Allocated memory is still 272.6MB. Free memory was 90.9MB in the beginning and 86.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-16 21:27:06,822 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.16ms. Allocated memory is still 98.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1420.28ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.1MB in the beginning and 57.6MB in the end (delta: -500.0kB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.48ms. Allocated memory is still 119.5MB. Free memory was 57.6MB in the beginning and 52.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.04ms. Allocated memory is still 119.5MB. Free memory was 52.3MB in the beginning and 50.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.94ms. Allocated memory is still 119.5MB. Free memory was 50.2MB in the beginning and 66.1MB in the end (delta: -15.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29336.54ms. Allocated memory was 119.5MB in the beginning and 272.6MB in the end (delta: 153.1MB). Free memory was 65.4MB in the beginning and 90.9MB in the end (delta: -25.5MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * Witness Printer took 44.31ms. Allocated memory is still 272.6MB. Free memory was 90.9MB in the beginning and 86.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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$.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 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$.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$.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 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 * 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: 223]: 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 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.3s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 296 mSDsluCounter, 3583 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 583 IncrementalHoareTripleChecker+Unchecked, 2810 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1417 IncrementalHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 773 mSDtfsCounter, 1417 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 584 SyntacticMatches, 35 SemanticMatches, 185 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=13, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 25 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 86 PreInvPairs, 99 NumberOfFragments, 1188 HoareAnnotationTreeSize, 86 FomulaSimplifications, 203 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3409 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1208 ConstructedInterpolants, 127 QuantifiedInterpolants, 10408 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1267 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 673/740 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant [2021-11-16 21:27:06,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:27:06,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:27:06,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((rval == before && node == node) && before == \result) && #memory_$Pointer$[#memory_$Pointer$[\result][\result]][8] == \result) && node == node) && #memory_$Pointer$[rval][rval] == node) && !(node == 0)) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][8]][0]) && #memory_$Pointer$[#memory_$Pointer$[\result][\result]][8] == \result) && #memory_$Pointer$[node][8] == 0) && before == \result) && before == rval) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 RESULT: Ultimate proved your program to be correct! [2021-11-16 21:27:06,878 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE