./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_back_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 f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:09:35,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:09:35,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:09:35,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:09:35,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:09:35,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:09:35,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:09:35,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:09:35,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:09:35,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:09:35,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:09:35,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:09:35,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:09:35,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:09:35,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:09:35,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:09:35,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:09:35,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:09:35,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:09:35,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:09:35,544 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:09:35,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:09:35,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:09:35,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:09:35,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:09:35,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:09:35,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:09:35,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:09:35,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:09:35,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:09:35,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:09:35,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:09:35,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:09:35,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:09:35,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:09:35,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:09:35,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:09:35,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:09:35,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:09:35,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:09:35,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:09:35,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:09:35,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:09:35,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:09:35,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:09:35,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:09:35,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:09:35,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:09:35,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:09:35,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:09:35,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:09:35,586 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:09:35,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:09:35,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:09:35,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:09:35,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:09:35,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:09:35,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:09:35,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:09:35,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:09:35,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:09:35,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:09:35,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:09:35,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:09:35,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:09:35,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:09:35,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:09:35,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:09:35,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:09:35,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:09:35,589 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:09:35,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:09:35,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:09:35,590 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 -> f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 [2022-07-12 11:09:35,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:09:35,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:09:35,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:09:35,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:09:35,776 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:09:35,777 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_back_harness.i [2022-07-12 11:09:35,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4437cd49c/58a2256c9f514bb3a51514d10c454789/FLAG4958977b9 [2022-07-12 11:09:36,403 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:09:36,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-07-12 11:09:36,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4437cd49c/58a2256c9f514bb3a51514d10c454789/FLAG4958977b9 [2022-07-12 11:09:36,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4437cd49c/58a2256c9f514bb3a51514d10c454789 [2022-07-12 11:09:36,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:09:36,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:09:36,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:09:36,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:09:36,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:09:36,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:09:36" (1/1) ... [2022-07-12 11:09:36,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29612f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:36, skipping insertion in model container [2022-07-12 11:09:36,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:09:36" (1/1) ... [2022-07-12 11:09:36,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:09:36,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:09:37,144 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_back_harness.i[4494,4507] [2022-07-12 11:09:37,149 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_back_harness.i[4554,4567] [2022-07-12 11:09:37,544 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,544 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,545 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,545 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,546 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,554 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,557 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,558 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,559 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,560 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,560 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,561 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,561 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,736 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:37,737 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:37,738 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:37,739 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:37,740 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:37,741 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:37,741 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:37,742 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:37,743 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:37,750 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:37,837 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:37,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:37,881 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:09:37,904 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_back_harness.i[4494,4507] [2022-07-12 11:09:37,904 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_back_harness.i[4554,4567] [2022-07-12 11:09:37,932 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,933 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,933 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,933 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,934 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,938 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,938 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,939 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,939 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,940 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,940 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,941 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:37,941 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:38,015 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:38,016 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:38,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:38,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:38,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:38,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:38,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:38,019 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:38,019 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:38,019 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:38,036 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:38,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:38,195 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:09:38,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38 WrapperNode [2022-07-12 11:09:38,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:09:38,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:38,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:09:38,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:09:38,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,280 INFO L137 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2022-07-12 11:09:38,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:38,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:09:38,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:09:38,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:09:38,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:09:38,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:09:38,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:09:38,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:09:38,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (1/1) ... [2022-07-12 11:09:38,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:09:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:38,363 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) [2022-07-12 11:09:38,376 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 [2022-07-12 11:09:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2022-07-12 11:09:38,391 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2022-07-12 11:09:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:09:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:09:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:09:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-12 11:09:38,393 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-12 11:09:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:09:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-07-12 11:09:38,394 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-07-12 11:09:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:09:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:09:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:09:38,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:09:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-07-12 11:09:38,395 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-07-12 11:09:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:09:38,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:09:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:09:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:09:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:09:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:09:38,396 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:09:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-07-12 11:09:38,396 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-07-12 11:09:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:09:38,595 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:09:38,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:09:38,790 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:09:38,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:09:38,801 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 11:09:38,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:38 BoogieIcfgContainer [2022-07-12 11:09:38,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:09:38,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:09:38,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:09:38,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:09:38,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:09:36" (1/3) ... [2022-07-12 11:09:38,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b251c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:38, skipping insertion in model container [2022-07-12 11:09:38,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:38" (2/3) ... [2022-07-12 11:09:38,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b251c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:38, skipping insertion in model container [2022-07-12 11:09:38,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:38" (3/3) ... [2022-07-12 11:09:38,813 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2022-07-12 11:09:38,826 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:09:38,827 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:09:38,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:09:38,877 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6210dd73, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b62a42e [2022-07-12 11:09:38,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:09:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 11:09:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 11:09:38,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:38,890 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:38,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:38,896 INFO L85 PathProgramCache]: Analyzing trace with hash 464723229, now seen corresponding path program 1 times [2022-07-12 11:09:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:38,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802851475] [2022-07-12 11:09:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:09:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:09:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:09:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:09:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:09:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:09:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-12 11:09:39,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:39,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802851475] [2022-07-12 11:09:39,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802851475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:39,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:39,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:09:39,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266786802] [2022-07-12 11:09:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:39,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:09:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:09:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:09:39,420 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:09:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:39,452 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-07-12 11:09:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:09:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2022-07-12 11:09:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:39,463 INFO L225 Difference]: With dead ends: 188 [2022-07-12 11:09:39,463 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 11:09:39,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:09:39,468 INFO L413 NwaCegarLoop]: 127 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, 127 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 [2022-07-12 11:09:39,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:09:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 11:09:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-12 11:09:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 11:09:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-07-12 11:09:39,498 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-07-12 11:09:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:39,498 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-07-12 11:09:39,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:09:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-07-12 11:09:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 11:09:39,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:39,502 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:39,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:09:39,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash 463621205, now seen corresponding path program 1 times [2022-07-12 11:09:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:39,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153251638] [2022-07-12 11:09:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:09:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:09:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:09:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:09:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:09:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:09:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:09:39,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:39,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153251638] [2022-07-12 11:09:39,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153251638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:09:39,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963549662] [2022-07-12 11:09:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:39,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:39,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:39,844 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) [2022-07-12 11:09:39,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:09:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 11:09:40,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:40,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 11:09:40,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 11:09:40,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 11:09:40,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:40,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 11:09:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:09:40,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:09:40,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963549662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:40,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:09:40,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-07-12 11:09:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083752683] [2022-07-12 11:09:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:40,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:09:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:09:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:09:40,959 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-12 11:09:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:41,059 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2022-07-12 11:09:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:09:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 84 [2022-07-12 11:09:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:41,069 INFO L225 Difference]: With dead ends: 201 [2022-07-12 11:09:41,069 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 11:09:41,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:09:41,071 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 35 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:41,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 539 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2022-07-12 11:09:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 11:09:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2022-07-12 11:09:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 88 states have internal predecessors, (107), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2022-07-12 11:09:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2022-07-12 11:09:41,100 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 84 [2022-07-12 11:09:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:41,102 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2022-07-12 11:09:41,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-12 11:09:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2022-07-12 11:09:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 11:09:41,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:41,108 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:41,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:09:41,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:41,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash -345725421, now seen corresponding path program 1 times [2022-07-12 11:09:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:41,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762987455] [2022-07-12 11:09:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:09:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:09:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:09:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:09:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:09:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:09:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:09:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:41,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762987455] [2022-07-12 11:09:41,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762987455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:09:41,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412246281] [2022-07-12 11:09:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:41,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:41,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:41,524 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) [2022-07-12 11:09:41,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:09:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:41,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 11:09:41,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:41,676 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:09:41,676 INFO L390 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 9 treesize of output 15 [2022-07-12 11:09:41,686 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:09:41,687 INFO L390 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 9 treesize of output 15 [2022-07-12 11:09:43,828 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0)))) is different from true [2022-07-12 11:09:45,881 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0)))) (let ((.cse0 (+ c_aws_linked_list_back_~list.offset 24))) (or (not (= (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_back_~list.base) .cse0) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| c_aws_linked_list_back_~list.base) .cse0) 0))))) is different from true [2022-07-12 11:09:47,917 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0)))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 24)) 0))))) is different from true [2022-07-12 11:09:50,067 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 24)) 0)))) is different from true [2022-07-12 11:09:52,130 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 24)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 24)) 0)))) is different from true [2022-07-12 11:10:00,202 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:10:08,349 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:10:16,440 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:10:22,513 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:10:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2022-07-12 11:10:22,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:10:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 11:10:24,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412246281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:10:24,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:10:24,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17, 11] total 28 [2022-07-12 11:10:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907511812] [2022-07-12 11:10:24,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:10:24,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 11:10:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:24,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 11:10:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=439, Unknown=9, NotChecked=230, Total=756 [2022-07-12 11:10:24,960 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 26 states have internal predecessors, (96), 7 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-07-12 11:11:01,589 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:11:09,635 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:11:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:17,975 INFO L93 Difference]: Finished difference Result 270 states and 364 transitions. [2022-07-12 11:11:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 11:11:17,976 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 26 states have internal predecessors, (96), 7 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 84 [2022-07-12 11:11:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:17,978 INFO L225 Difference]: With dead ends: 270 [2022-07-12 11:11:17,978 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 11:11:17,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 167 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 95.2s TimeCoverageRelationStatistics Valid=226, Invalid=1175, Unknown=25, NotChecked=380, Total=1806 [2022-07-12 11:11:17,980 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 145 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 828 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:17,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1120 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 545 Invalid, 0 Unknown, 828 Unchecked, 0.4s Time] [2022-07-12 11:11:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 11:11:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2022-07-12 11:11:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 104 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2022-07-12 11:11:17,993 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 84 [2022-07-12 11:11:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:17,994 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2022-07-12 11:11:17,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 26 states have internal predecessors, (96), 7 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-07-12 11:11:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2022-07-12 11:11:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 11:11:17,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:17,996 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:18,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:18,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 11:11:18,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash 718708879, now seen corresponding path program 1 times [2022-07-12 11:11:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:18,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886260473] [2022-07-12 11:11:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:11:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:11:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:11:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:11:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:11:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:18,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886260473] [2022-07-12 11:11:18,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886260473] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:18,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496252622] [2022-07-12 11:11:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:18,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:18,419 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) [2022-07-12 11:11:18,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:11:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:18,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:11:18,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:11:18,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:18,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496252622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:18,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:18,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-07-12 11:11:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674650888] [2022-07-12 11:11:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:18,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:11:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:18,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:11:18,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:11:18,665 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:18,894 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2022-07-12 11:11:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:11:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-07-12 11:11:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:18,896 INFO L225 Difference]: With dead ends: 241 [2022-07-12 11:11:18,896 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 11:11:18,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:11:18,897 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 147 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:18,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 522 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:11:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 11:11:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-12 11:11:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 104 states have internal predecessors, (127), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-07-12 11:11:18,918 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 88 [2022-07-12 11:11:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:18,923 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-07-12 11:11:18,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-07-12 11:11:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:11:18,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:18,929 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-07-12 11:11:18,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:19,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:19,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -619251908, now seen corresponding path program 1 times [2022-07-12 11:11:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426631122] [2022-07-12 11:11:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:11:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:11:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:11:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:11:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 11:11:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:19,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426631122] [2022-07-12 11:11:19,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426631122] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:19,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617710772] [2022-07-12 11:11:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:19,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:19,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:19,306 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) [2022-07-12 11:11:19,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:11:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:19,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:11:19,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:11:19,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:19,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617710772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:19,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:19,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-07-12 11:11:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341152503] [2022-07-12 11:11:19,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:19,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:11:19,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:11:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:11:19,538 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:19,814 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2022-07-12 11:11:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:11:19,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 90 [2022-07-12 11:11:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:19,816 INFO L225 Difference]: With dead ends: 250 [2022-07-12 11:11:19,816 INFO L226 Difference]: Without dead ends: 154 [2022-07-12 11:11:19,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:11:19,817 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 183 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:19,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 577 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:11:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-12 11:11:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2022-07-12 11:11:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 105 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-07-12 11:11:19,826 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 90 [2022-07-12 11:11:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:19,826 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-07-12 11:11:19,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-07-12 11:11:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 11:11:19,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:19,828 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:19,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:20,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:20,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1442434984, now seen corresponding path program 1 times [2022-07-12 11:11:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:20,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496988072] [2022-07-12 11:11:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:11:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:11:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:11:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:11:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:11:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496988072] [2022-07-12 11:11:20,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496988072] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:20,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299981744] [2022-07-12 11:11:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:20,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:20,170 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) [2022-07-12 11:11:20,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:11:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:11:20,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 11:11:20,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:20,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299981744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:20,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:20,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-12 11:11:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819295711] [2022-07-12 11:11:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:20,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:11:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:11:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:11:20,307 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 11:11:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:20,323 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2022-07-12 11:11:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:11:20,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-07-12 11:11:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:20,325 INFO L225 Difference]: With dead ends: 246 [2022-07-12 11:11:20,326 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 11:11:20,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:11:20,328 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:20,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 11:11:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-12 11:11:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 106 states have internal predecessors, (129), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-07-12 11:11:20,341 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 89 [2022-07-12 11:11:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:20,342 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-07-12 11:11:20,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 11:11:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-07-12 11:11:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 11:11:20,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:20,344 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-07-12 11:11:20,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:20,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:20,562 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:20,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:20,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1174325196, now seen corresponding path program 1 times [2022-07-12 11:11:20,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:20,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093870549] [2022-07-12 11:11:20,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:11:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:11:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:11:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:11:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:11:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:20,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093870549] [2022-07-12 11:11:20,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093870549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:20,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841519212] [2022-07-12 11:11:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:20,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:20,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:20,730 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:20,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:11:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:20,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 11:11:20,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:20,894 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:20,895 INFO L390 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 9 treesize of output 15 [2022-07-12 11:11:20,904 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:20,905 INFO L390 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 9 treesize of output 15 [2022-07-12 11:11:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:11:21,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:11:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:11:21,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841519212] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:11:21,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:11:21,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2022-07-12 11:11:21,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785500640] [2022-07-12 11:11:21,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:11:21,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:11:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:21,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:11:21,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:11:21,763 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 21 states, 20 states have (on average 5.75) internal successors, (115), 20 states have internal predecessors, (115), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 11:11:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:22,236 INFO L93 Difference]: Finished difference Result 261 states and 341 transitions. [2022-07-12 11:11:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 11:11:22,238 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.75) internal successors, (115), 20 states have internal predecessors, (115), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 99 [2022-07-12 11:11:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:22,239 INFO L225 Difference]: With dead ends: 261 [2022-07-12 11:11:22,239 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 11:11:22,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 200 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 11:11:22,240 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 113 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:22,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1384 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 479 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2022-07-12 11:11:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 11:11:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2022-07-12 11:11:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 115 states have internal predecessors, (139), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (33), 27 states have call predecessors, (33), 29 states have call successors, (33) [2022-07-12 11:11:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2022-07-12 11:11:22,247 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 99 [2022-07-12 11:11:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:22,248 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2022-07-12 11:11:22,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.75) internal successors, (115), 20 states have internal predecessors, (115), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 11:11:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-07-12 11:11:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 11:11:22,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:22,249 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-07-12 11:11:22,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 11:11:22,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:22,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1176254157, now seen corresponding path program 1 times [2022-07-12 11:11:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:22,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678319877] [2022-07-12 11:11:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:11:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:11:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:11:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:11:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:11:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:22,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678319877] [2022-07-12 11:11:22,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678319877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:22,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171896623] [2022-07-12 11:11:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:22,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:22,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:22,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:22,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:11:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:22,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 11:11:22,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:22,875 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:22,875 INFO L390 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 9 treesize of output 15 [2022-07-12 11:11:22,884 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:22,884 INFO L390 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 9 treesize of output 15 [2022-07-12 11:11:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:11:23,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:11:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:11:23,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171896623] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:11:23,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:11:23,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 26 [2022-07-12 11:11:23,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281396326] [2022-07-12 11:11:23,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:11:23,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 11:11:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:23,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 11:11:23,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:11:23,924 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 26 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2022-07-12 11:11:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:25,131 INFO L93 Difference]: Finished difference Result 411 states and 566 transitions. [2022-07-12 11:11:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 11:11:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) Word has length 99 [2022-07-12 11:11:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:25,134 INFO L225 Difference]: With dead ends: 411 [2022-07-12 11:11:25,135 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 11:11:25,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 206 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=1878, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 11:11:25,136 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 236 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:25,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 2424 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1202 Invalid, 0 Unknown, 343 Unchecked, 0.7s Time] [2022-07-12 11:11:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 11:11:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 222. [2022-07-12 11:11:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 166 states have internal predecessors, (202), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (50), 35 states have call predecessors, (50), 35 states have call successors, (50) [2022-07-12 11:11:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 288 transitions. [2022-07-12 11:11:25,162 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 288 transitions. Word has length 99 [2022-07-12 11:11:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:25,163 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 288 transitions. [2022-07-12 11:11:25,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2022-07-12 11:11:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 288 transitions. [2022-07-12 11:11:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:11:25,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:25,165 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:25,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:25,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:25,378 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:25,378 INFO L85 PathProgramCache]: Analyzing trace with hash 136318385, now seen corresponding path program 1 times [2022-07-12 11:11:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:25,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522106964] [2022-07-12 11:11:25,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:25,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:11:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:11:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:11:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:11:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 11:11:25,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:25,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522106964] [2022-07-12 11:11:25,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522106964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814808142] [2022-07-12 11:11:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:25,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:25,535 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:25,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:11:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:25,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 11:11:25,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:26,475 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5|) 0)))) is different from true [2022-07-12 11:11:27,221 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_33 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) v_aws_linked_list_back_~list.offset_BEFORE_CALL_33) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_33 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) v_aws_linked_list_back_~list.offset_BEFORE_CALL_33) 0)))) is different from true [2022-07-12 11:11:27,916 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_34 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) v_aws_linked_list_back_~list.offset_BEFORE_CALL_34) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_34 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) v_aws_linked_list_back_~list.offset_BEFORE_CALL_34) 0)))) is different from true [2022-07-12 11:11:28,631 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_35 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) v_aws_linked_list_back_~list.offset_BEFORE_CALL_35) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_35 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) v_aws_linked_list_back_~list.offset_BEFORE_CALL_35) 0)))) is different from true [2022-07-12 11:11:29,328 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_36 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38) v_aws_linked_list_back_~list.offset_BEFORE_CALL_36) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_36 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_38) v_aws_linked_list_back_~list.offset_BEFORE_CALL_36) 0)))) is different from true [2022-07-12 11:11:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 12 not checked. [2022-07-12 11:11:39,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:11:40,266 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:11:40,267 INFO L390 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 24 treesize of output 23 [2022-07-12 11:11:40,272 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-12 11:11:40,272 INFO L390 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 20 treesize of output 12 [2022-07-12 11:11:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 11:11:40,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814808142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:11:40,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:11:40,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 11] total 30 [2022-07-12 11:11:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054480807] [2022-07-12 11:11:40,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:11:40,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 11:11:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 11:11:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=526, Unknown=8, NotChecked=250, Total=870 [2022-07-12 11:11:40,289 INFO L87 Difference]: Start difference. First operand 222 states and 288 transitions. Second operand has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 29 states have internal predecessors, (122), 6 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 11:11:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:44,221 INFO L93 Difference]: Finished difference Result 742 states and 1078 transitions. [2022-07-12 11:11:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 11:11:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 29 states have internal predecessors, (122), 6 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 101 [2022-07-12 11:11:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:44,224 INFO L225 Difference]: With dead ends: 742 [2022-07-12 11:11:44,225 INFO L226 Difference]: Without dead ends: 574 [2022-07-12 11:11:44,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 214 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=328, Invalid=1402, Unknown=12, NotChecked=420, Total=2162 [2022-07-12 11:11:44,226 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 418 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1537 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:44,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1572 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 782 Invalid, 0 Unknown, 1537 Unchecked, 0.4s Time] [2022-07-12 11:11:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-07-12 11:11:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 414. [2022-07-12 11:11:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 328 states have internal predecessors, (410), 54 states have call successors, (54), 32 states have call predecessors, (54), 41 states have return successors, (114), 53 states have call predecessors, (114), 53 states have call successors, (114) [2022-07-12 11:11:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 578 transitions. [2022-07-12 11:11:44,263 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 578 transitions. Word has length 101 [2022-07-12 11:11:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:44,263 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 578 transitions. [2022-07-12 11:11:44,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 29 states have internal predecessors, (122), 6 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 11:11:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 578 transitions. [2022-07-12 11:11:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 11:11:44,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:44,265 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-07-12 11:11:44,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:44,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 11:11:44,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1312319311, now seen corresponding path program 1 times [2022-07-12 11:11:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:44,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62538484] [2022-07-12 11:11:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:11:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:11:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:11:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:11:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 11:11:44,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:44,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62538484] [2022-07-12 11:11:44,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62538484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:44,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844628306] [2022-07-12 11:11:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:44,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:44,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:44,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:11:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:11:44,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 11:11:44,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:44,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844628306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:44,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:44,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-12 11:11:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690179271] [2022-07-12 11:11:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:44,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:11:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:11:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:11:44,724 INFO L87 Difference]: Start difference. First operand 414 states and 578 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:44,751 INFO L93 Difference]: Finished difference Result 610 states and 861 transitions. [2022-07-12 11:11:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:11:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-07-12 11:11:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:44,753 INFO L225 Difference]: With dead ends: 610 [2022-07-12 11:11:44,753 INFO L226 Difference]: Without dead ends: 368 [2022-07-12 11:11:44,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:11:44,755 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:44,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 357 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-12 11:11:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 360. [2022-07-12 11:11:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 275 states have (on average 1.269090909090909) internal successors, (349), 285 states have internal predecessors, (349), 48 states have call successors, (48), 28 states have call predecessors, (48), 36 states have return successors, (95), 46 states have call predecessors, (95), 47 states have call successors, (95) [2022-07-12 11:11:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 492 transitions. [2022-07-12 11:11:44,773 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 492 transitions. Word has length 99 [2022-07-12 11:11:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:44,773 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 492 transitions. [2022-07-12 11:11:44,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 492 transitions. [2022-07-12 11:11:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:11:44,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:44,775 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-07-12 11:11:44,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:44,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 11:11:44,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1894539913, now seen corresponding path program 1 times [2022-07-12 11:11:44,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:44,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147914273] [2022-07-12 11:11:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:11:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:11:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:11:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:11:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-12 11:11:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147914273] [2022-07-12 11:11:45,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147914273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758302216] [2022-07-12 11:11:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:45,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:45,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:11:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:11:45,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 11:11:45,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:45,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758302216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:45,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:45,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-12 11:11:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417775353] [2022-07-12 11:11:45,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:45,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:11:45,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:45,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:11:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:11:45,278 INFO L87 Difference]: Start difference. First operand 360 states and 492 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:45,296 INFO L93 Difference]: Finished difference Result 489 states and 676 transitions. [2022-07-12 11:11:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:11:45,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2022-07-12 11:11:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:45,298 INFO L225 Difference]: With dead ends: 489 [2022-07-12 11:11:45,298 INFO L226 Difference]: Without dead ends: 220 [2022-07-12 11:11:45,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:11:45,299 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:45,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 350 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-12 11:11:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2022-07-12 11:11:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 150 states have (on average 1.2) internal successors, (180), 155 states have internal predecessors, (180), 33 states have call successors, (33), 18 states have call predecessors, (33), 20 states have return successors, (43), 30 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-12 11:11:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2022-07-12 11:11:45,310 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 101 [2022-07-12 11:11:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:45,310 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2022-07-12 11:11:45,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2022-07-12 11:11:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 11:11:45,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:45,312 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:45,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:45,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 11:11:45,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:45,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1381429819, now seen corresponding path program 1 times [2022-07-12 11:11:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:45,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304241864] [2022-07-12 11:11:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:11:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:11:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:11:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:11:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 11:11:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304241864] [2022-07-12 11:11:45,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304241864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880011944] [2022-07-12 11:11:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:45,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:45,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:45,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:45,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:11:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:45,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:11:45,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 11:11:46,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:46,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880011944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:46,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:46,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-07-12 11:11:46,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414619087] [2022-07-12 11:11:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:46,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:11:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:11:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:11:46,044 INFO L87 Difference]: Start difference. First operand 204 states and 256 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:11:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:46,198 INFO L93 Difference]: Finished difference Result 382 states and 484 transitions. [2022-07-12 11:11:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:11:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2022-07-12 11:11:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:46,200 INFO L225 Difference]: With dead ends: 382 [2022-07-12 11:11:46,200 INFO L226 Difference]: Without dead ends: 166 [2022-07-12 11:11:46,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:11:46,201 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 151 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:46,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 490 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:11:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-12 11:11:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2022-07-12 11:11:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 118 states have internal predecessors, (132), 31 states have call successors, (31), 17 states have call predecessors, (31), 18 states have return successors, (35), 28 states have call predecessors, (35), 30 states have call successors, (35) [2022-07-12 11:11:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2022-07-12 11:11:46,209 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 102 [2022-07-12 11:11:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:46,209 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2022-07-12 11:11:46,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:11:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2022-07-12 11:11:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 11:11:46,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:46,210 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-07-12 11:11:46,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:46,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 11:11:46,424 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -904744676, now seen corresponding path program 1 times [2022-07-12 11:11:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001013807] [2022-07-12 11:11:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:11:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:11:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:11:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:11:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-12 11:11:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:46,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001013807] [2022-07-12 11:11:46,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001013807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:46,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258414360] [2022-07-12 11:11:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:46,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:46,742 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:46,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:11:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 11:11:46,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:46,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:11:47,034 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 11:11:47,043 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:47,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 11:11:47,049 INFO L390 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 5 treesize of output 3 [2022-07-12 11:11:47,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:11:47,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:11:47,110 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-07-12 11:11:47,111 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 11:11:47,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 11:11:47,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 11:11:47,312 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_45| input size 40 context size 40 output size 40 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 11:11:47,316 INFO L158 Benchmark]: Toolchain (without parser) took 130456.31ms. Allocated memory was 115.3MB in the beginning and 226.5MB in the end (delta: 111.1MB). Free memory was 80.8MB in the beginning and 115.9MB in the end (delta: -35.2MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2022-07-12 11:11:47,316 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:11:47,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1325.45ms. Allocated memory was 115.3MB in the beginning and 169.9MB in the end (delta: 54.5MB). Free memory was 80.5MB in the beginning and 114.4MB in the end (delta: -33.9MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2022-07-12 11:11:47,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.89ms. Allocated memory is still 169.9MB. Free memory was 114.4MB in the beginning and 109.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 11:11:47,317 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 169.9MB. Free memory was 109.2MB in the beginning and 106.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 11:11:47,317 INFO L158 Benchmark]: RCFGBuilder took 487.13ms. Allocated memory is still 169.9MB. Free memory was 106.1MB in the beginning and 84.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 11:11:47,325 INFO L158 Benchmark]: TraceAbstraction took 128510.00ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 83.0MB in the beginning and 115.9MB in the end (delta: -32.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2022-07-12 11:11:47,327 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.15ms. Allocated memory is still 115.3MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1325.45ms. Allocated memory was 115.3MB in the beginning and 169.9MB in the end (delta: 54.5MB). Free memory was 80.5MB in the beginning and 114.4MB in the end (delta: -33.9MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.89ms. Allocated memory is still 169.9MB. Free memory was 114.4MB in the beginning and 109.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 169.9MB. Free memory was 109.2MB in the beginning and 106.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.13ms. Allocated memory is still 169.9MB. Free memory was 106.1MB in the beginning and 84.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 128510.00ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 83.0MB in the beginning and 115.9MB in the end (delta: -32.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_45| input size 40 context size 40 output size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_45| input size 40 context size 40 output size 40: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 11:11:47,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_back_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:11:49,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:11:49,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:11:49,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:11:49,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:11:49,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:11:49,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:11:49,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:11:49,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:11:49,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:11:49,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:11:49,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:11:49,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:11:49,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:11:49,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:11:49,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:11:49,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:11:49,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:11:49,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:11:49,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:11:49,117 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:11:49,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:11:49,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:11:49,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:11:49,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:11:49,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:11:49,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:11:49,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:11:49,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:11:49,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:11:49,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:11:49,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:11:49,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:11:49,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:11:49,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:11:49,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:11:49,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:11:49,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:11:49,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:11:49,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:11:49,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:11:49,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:11:49,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 11:11:49,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:11:49,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:11:49,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:11:49,165 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:11:49,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:11:49,166 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:11:49,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:11:49,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:11:49,166 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:11:49,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:11:49,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:11:49,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:11:49,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:11:49,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:11:49,168 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 11:11:49,168 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 11:11:49,168 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 11:11:49,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:11:49,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:11:49,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:11:49,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:11:49,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:11:49,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:11:49,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:11:49,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:11:49,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:11:49,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:11:49,170 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 11:11:49,170 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 11:11:49,170 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:11:49,170 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:11:49,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:11:49,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 11:11:49,171 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 [2022-07-12 11:11:49,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:11:49,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:11:49,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:11:49,454 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:11:49,455 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:11:49,456 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_back_harness.i [2022-07-12 11:11:49,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158c61c57/326c66714c8a4c6ba7a47f836fbe097e/FLAGc45916948 [2022-07-12 11:11:50,081 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:11:50,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-07-12 11:11:50,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158c61c57/326c66714c8a4c6ba7a47f836fbe097e/FLAGc45916948 [2022-07-12 11:11:50,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158c61c57/326c66714c8a4c6ba7a47f836fbe097e [2022-07-12 11:11:50,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:11:50,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:11:50,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:11:50,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:11:50,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:11:50,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:11:50" (1/1) ... [2022-07-12 11:11:50,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5ca7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:11:50, skipping insertion in model container [2022-07-12 11:11:50,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:11:50" (1/1) ... [2022-07-12 11:11:50,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:11:50,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:11:50,613 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_back_harness.i[4494,4507] [2022-07-12 11:11:50,618 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_back_harness.i[4554,4567] [2022-07-12 11:11:51,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,164 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,166 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,183 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,185 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,186 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,187 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,189 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,190 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,191 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,191 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:11:51,375 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:11:51,376 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:11:51,376 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:11:51,377 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:11:51,378 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:11:51,378 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:11:51,378 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:11:51,379 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:11:51,379 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:11:51,380 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:11:51,489 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:11:51,507 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1384) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:249) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.translateInitializer(CHandler.java:2978) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2836) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2138) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 11:11:51,514 INFO L158 Benchmark]: Toolchain (without parser) took 1222.86ms. Allocated memory was 54.5MB in the beginning and 77.6MB in the end (delta: 23.1MB). Free memory was 26.5MB in the beginning and 46.7MB in the end (delta: -20.1MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-07-12 11:11:51,515 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:11:51,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1221.44ms. Allocated memory was 54.5MB in the beginning and 77.6MB in the end (delta: 23.1MB). Free memory was 26.4MB in the beginning and 46.7MB in the end (delta: -20.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-07-12 11:11:51,518 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.18ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1221.44ms. Allocated memory was 54.5MB in the beginning and 77.6MB in the end (delta: 23.1MB). Free memory was 26.4MB in the beginning and 46.7MB in the end (delta: -20.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range