./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 f4b24e32 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-?-f4b24e3 [2022-07-13 22:50:33,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:50:33,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:50:33,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:50:33,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:50:33,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:50:33,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:50:33,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:50:33,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:50:33,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:50:33,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:50:33,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:50:33,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:50:33,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:50:33,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:50:33,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:50:33,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:50:33,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:50:33,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:50:33,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:50:33,630 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:50:33,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:50:33,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:50:33,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:50:33,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:50:33,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:50:33,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:50:33,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:50:33,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:50:33,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:50:33,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:50:33,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:50:33,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:50:33,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:50:33,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:50:33,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:50:33,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:50:33,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:50:33,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:50:33,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:50:33,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:50:33,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:50:33,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:50:33,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:50:33,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:50:33,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:50:33,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:50:33,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:50:33,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:50:33,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:50:33,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:50:33,693 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:50:33,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:50:33,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:50:33,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:50:33,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:50:33,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:50:33,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:50:33,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:50:33,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:50:33,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:50:33,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:50:33,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:50:33,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:50:33,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:50:33,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:50:33,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:50:33,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:50:33,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:50:33,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:50:33,699 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:50:33,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:50:33,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:50:33,699 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-13 22:50:33,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:50:33,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:50:33,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:50:33,992 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:50:33,993 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:50:33,995 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-13 22:50:34,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5504540/a1ee73cde1cb404894d091c8e607e85b/FLAGa183e1cfd [2022-07-13 22:50:34,703 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:50:34,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-07-13 22:50:34,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5504540/a1ee73cde1cb404894d091c8e607e85b/FLAGa183e1cfd [2022-07-13 22:50:34,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5504540/a1ee73cde1cb404894d091c8e607e85b [2022-07-13 22:50:34,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:50:34,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:50:34,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:50:34,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:50:34,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:50:34,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:50:34" (1/1) ... [2022-07-13 22:50:34,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794a225e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:34, skipping insertion in model container [2022-07-13 22:50:34,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:50:34" (1/1) ... [2022-07-13 22:50:34,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:50:34,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:50:35,206 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-13 22:50:35,213 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-13 22:50:35,864 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,865 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,866 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,866 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,867 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,877 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,880 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,881 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,883 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,885 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,885 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,886 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:35,886 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,085 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:50:36,086 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:50:36,088 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:50:36,089 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:50:36,090 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:50:36,091 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:50:36,091 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:50:36,092 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:50:36,092 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:50:36,093 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:50:36,183 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:50:36,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:50:36,217 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:50:36,233 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-13 22:50:36,233 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-13 22:50:36,276 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,277 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,278 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,278 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,279 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,343 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,344 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,345 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,346 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,346 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,347 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:36,407 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:50:36,408 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:50:36,409 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:50:36,410 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:50:36,416 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:50:36,417 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:50:36,417 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:50:36,418 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:50:36,418 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:50:36,419 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:50:36,454 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:50:36,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:50:36,659 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:50:36,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36 WrapperNode [2022-07-13 22:50:36,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:50:36,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:50:36,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:50:36,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:50:36,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,771 INFO L137 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2022-07-13 22:50:36,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:50:36,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:50:36,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:50:36,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:50:36,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:50:36,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:50:36,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:50:36,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:50:36,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (1/1) ... [2022-07-13 22:50:36,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:50:36,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:36,893 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-13 22:50:36,918 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-13 22:50:36,939 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2022-07-13 22:50:36,939 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2022-07-13 22:50:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:50:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:50:36,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:50:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-13 22:50:36,941 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-13 22:50:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:50:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-07-13 22:50:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-07-13 22:50:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:50:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:50:36,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:50:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:50:36,944 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-07-13 22:50:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-07-13 22:50:36,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:50:36,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:50:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:50:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:50:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:50:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:50:36,946 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:50:36,946 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-07-13 22:50:36,946 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-07-13 22:50:36,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:50:37,208 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:50:37,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:50:37,542 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:50:37,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:50:37,562 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 22:50:37,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:50:37 BoogieIcfgContainer [2022-07-13 22:50:37,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:50:37,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:50:37,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:50:37,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:50:37,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:50:34" (1/3) ... [2022-07-13 22:50:37,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa56e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:50:37, skipping insertion in model container [2022-07-13 22:50:37,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:36" (2/3) ... [2022-07-13 22:50:37,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa56e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:50:37, skipping insertion in model container [2022-07-13 22:50:37,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:50:37" (3/3) ... [2022-07-13 22:50:37,584 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2022-07-13 22:50:37,596 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:50:37,597 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:50:37,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:50:37,675 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@29394144, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40dac435 [2022-07-13 22:50:37,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:50:37,680 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-13 22:50:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 22:50:37,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:37,694 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-13 22:50:37,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 464723229, now seen corresponding path program 1 times [2022-07-13 22:50:37,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:37,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691477708] [2022-07-13 22:50:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:50:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:50:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:50:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:50:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:50:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:50:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,244 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-13 22:50:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:38,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691477708] [2022-07-13 22:50:38,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691477708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:38,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:38,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:50:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082545421] [2022-07-13 22:50:38,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:38,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:50:38,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:38,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:50:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:50:38,292 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-13 22:50:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:38,351 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-07-13 22:50:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:50:38,353 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-13 22:50:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:38,364 INFO L225 Difference]: With dead ends: 188 [2022-07-13 22:50:38,364 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 22:50:38,372 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-13 22:50:38,381 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-13 22:50:38,382 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-13 22:50:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 22:50:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-13 22:50:38,432 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-13 22:50:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-07-13 22:50:38,442 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-07-13 22:50:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:38,442 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-07-13 22:50:38,443 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-13 22:50:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-07-13 22:50:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 22:50:38,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:38,449 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-13 22:50:38,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:50:38,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:38,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash 463621205, now seen corresponding path program 1 times [2022-07-13 22:50:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:38,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196313273] [2022-07-13 22:50:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:50:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:50:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:50:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:50:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:50:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:50:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,906 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-13 22:50:38,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:38,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196313273] [2022-07-13 22:50:38,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196313273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:38,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323086727] [2022-07-13 22:50:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:38,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:38,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:38,912 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-13 22:50:38,947 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-13 22:50:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 22:50:39,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:39,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,258 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-13 22:50:39,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,271 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-13 22:50:39,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,352 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-13 22:50:39,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:39,362 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-13 22:50:40,249 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-13 22:50:40,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:40,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323086727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:40,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:40,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-07-13 22:50:40,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023123182] [2022-07-13 22:50:40,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:40,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:50:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:40,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:50:40,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:50:40,255 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-13 22:50:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:40,386 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2022-07-13 22:50:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:50:40,392 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-13 22:50:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:40,399 INFO L225 Difference]: With dead ends: 201 [2022-07-13 22:50:40,399 INFO L226 Difference]: Without dead ends: 142 [2022-07-13 22:50:40,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:50:40,405 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 35 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 22:50:40,408 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-13 22:50:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-13 22:50:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2022-07-13 22:50:40,439 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-13 22:50:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2022-07-13 22:50:40,443 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 84 [2022-07-13 22:50:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:40,445 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2022-07-13 22:50:40,445 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-13 22:50:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2022-07-13 22:50:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 22:50:40,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:40,451 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-13 22:50:40,481 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-13 22:50:40,678 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-13 22:50:40,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:40,679 INFO L85 PathProgramCache]: Analyzing trace with hash -345725421, now seen corresponding path program 1 times [2022-07-13 22:50:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:40,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959026340] [2022-07-13 22:50:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:40,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:50:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:50:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:50:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:50:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:50:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:50:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,905 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-13 22:50:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:40,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959026340] [2022-07-13 22:50:40,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959026340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:40,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026503753] [2022-07-13 22:50:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:40,910 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-13 22:50:40,925 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-13 22:50:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 22:50:41,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:41,087 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:50:41,087 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-13 22:50:41,099 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:50:41,099 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-13 22:50:43,280 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-13 22:50:45,321 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-13 22:50:47,364 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-13 22:50:49,521 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-13 22:50:51,598 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-13 22:50:59,667 WARN L233 SmtUtils]: Spent 6.02s 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-13 22:51:07,823 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-13 22:51:15,927 WARN L233 SmtUtils]: Spent 6.03s 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-13 22:51:21,991 WARN L233 SmtUtils]: Spent 6.02s 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-13 22:51:22,025 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-13 22:51:22,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:51:24,527 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-13 22:51:24,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026503753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:51:24,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:51:24,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17, 11] total 28 [2022-07-13 22:51:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362271928] [2022-07-13 22:51:24,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:51:24,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 22:51:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 22:51:24,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=439, Unknown=9, NotChecked=230, Total=756 [2022-07-13 22:51:24,530 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-13 22:52:01,241 WARN L233 SmtUtils]: Spent 6.03s 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-13 22:52:09,287 WARN L233 SmtUtils]: Spent 6.02s 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-13 22:52:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:17,593 INFO L93 Difference]: Finished difference Result 270 states and 364 transitions. [2022-07-13 22:52:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 22:52:17,594 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-13 22:52:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:17,597 INFO L225 Difference]: With dead ends: 270 [2022-07-13 22:52:17,597 INFO L226 Difference]: Without dead ends: 153 [2022-07-13 22:52:17,598 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-13 22:52:17,599 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 145 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-13 22:52:17,599 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-13 22:52:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-13 22:52:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2022-07-13 22:52:17,611 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-13 22:52:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2022-07-13 22:52:17,612 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 84 [2022-07-13 22:52:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:17,613 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2022-07-13 22:52:17,613 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-13 22:52:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2022-07-13 22:52:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 22:52:17,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:17,615 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-13 22:52:17,639 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-13 22:52:17,838 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-13 22:52:17,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash 718708879, now seen corresponding path program 1 times [2022-07-13 22:52:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:17,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509956550] [2022-07-13 22:52:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:52:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:52:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:52:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:52:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:52:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:52:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:52:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,148 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-13 22:52:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:18,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509956550] [2022-07-13 22:52:18,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509956550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:18,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372751348] [2022-07-13 22:52:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:18,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:18,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:18,156 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-13 22:52:18,159 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-13 22:52:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 22:52:18,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:18,424 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-13 22:52:18,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372751348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:18,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:18,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-07-13 22:52:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915160632] [2022-07-13 22:52:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:18,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:52:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:52:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:52:18,426 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-13 22:52:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:18,667 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2022-07-13 22:52:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:52:18,668 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-13 22:52:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:18,669 INFO L225 Difference]: With dead ends: 241 [2022-07-13 22:52:18,669 INFO L226 Difference]: Without dead ends: 146 [2022-07-13 22:52:18,670 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-13 22:52:18,671 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-13 22:52:18,671 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-13 22:52:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-13 22:52:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-13 22:52:18,684 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-13 22:52:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-07-13 22:52:18,686 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 88 [2022-07-13 22:52:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:18,686 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-07-13 22:52:18,687 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-13 22:52:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-07-13 22:52:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:52:18,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:18,688 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-13 22:52:18,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 22:52:18,904 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-13 22:52:18,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash -619251908, now seen corresponding path program 1 times [2022-07-13 22:52:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:18,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951217222] [2022-07-13 22:52:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:52:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:52:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:52:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:52:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:52:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:52:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:52:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,111 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-13 22:52:19,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:19,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951217222] [2022-07-13 22:52:19,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951217222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:19,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463990555] [2022-07-13 22:52:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:19,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:19,113 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-13 22:52:19,143 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-13 22:52:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:19,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 22:52:19,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:19,389 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-13 22:52:19,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:19,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463990555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:19,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:19,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-07-13 22:52:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267249196] [2022-07-13 22:52:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:52:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:52:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:52:19,391 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-13 22:52:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:19,704 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2022-07-13 22:52:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:52:19,705 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-13 22:52:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:19,706 INFO L225 Difference]: With dead ends: 250 [2022-07-13 22:52:19,706 INFO L226 Difference]: Without dead ends: 154 [2022-07-13 22:52:19,707 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-13 22:52:19,708 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-13 22:52:19,708 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-13 22:52:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-13 22:52:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2022-07-13 22:52:19,720 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-13 22:52:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-07-13 22:52:19,721 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 90 [2022-07-13 22:52:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:19,722 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-07-13 22:52:19,722 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-13 22:52:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-07-13 22:52:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 22:52:19,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:19,723 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-13 22:52:19,750 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-13 22:52:19,946 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-13 22:52:19,946 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1442434984, now seen corresponding path program 1 times [2022-07-13 22:52:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:19,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18436369] [2022-07-13 22:52:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:52:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:52:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:52:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:52:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:52:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,108 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-13 22:52:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18436369] [2022-07-13 22:52:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18436369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:20,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251943230] [2022-07-13 22:52:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:20,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:20,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:20,112 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-13 22:52:20,113 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-13 22:52:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 22:52:20,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:20,269 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-13 22:52:20,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:20,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251943230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:20,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:20,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 22:52:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485787251] [2022-07-13 22:52:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:52:20,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:52:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:52:20,274 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-13 22:52:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:20,298 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2022-07-13 22:52:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:52:20,300 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-13 22:52:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:20,302 INFO L225 Difference]: With dead ends: 246 [2022-07-13 22:52:20,302 INFO L226 Difference]: Without dead ends: 153 [2022-07-13 22:52:20,303 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-13 22:52:20,303 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-13 22:52:20,304 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-13 22:52:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-13 22:52:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-13 22:52:20,315 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-13 22:52:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-07-13 22:52:20,317 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 89 [2022-07-13 22:52:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:20,317 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-07-13 22:52:20,317 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-13 22:52:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-07-13 22:52:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 22:52:20,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:20,322 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-13 22:52:20,349 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-13 22:52:20,535 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-13 22:52:20,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1174325196, now seen corresponding path program 1 times [2022-07-13 22:52:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:20,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085530312] [2022-07-13 22:52:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:52:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:52:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:52:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:52:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:52:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:52:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,755 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-13 22:52:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:20,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085530312] [2022-07-13 22:52:20,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085530312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:20,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175732606] [2022-07-13 22:52:20,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:20,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:20,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:20,760 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-13 22:52:20,761 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-13 22:52:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:20,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 22:52:20,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:20,961 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:52:20,962 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-13 22:52:20,973 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:52:20,973 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-13 22:52:21,594 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-13 22:52:21,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:21,993 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-13 22:52:21,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175732606] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:52:21,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:52:21,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2022-07-13 22:52:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021657388] [2022-07-13 22:52:21,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:21,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 22:52:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:21,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 22:52:21,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:52:21,997 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-13 22:52:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:22,579 INFO L93 Difference]: Finished difference Result 261 states and 341 transitions. [2022-07-13 22:52:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 22:52:22,580 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-13 22:52:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:22,581 INFO L225 Difference]: With dead ends: 261 [2022-07-13 22:52:22,581 INFO L226 Difference]: Without dead ends: 167 [2022-07-13 22:52:22,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 200 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 22:52:22,583 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 113 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:22,583 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.3s Time] [2022-07-13 22:52:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-13 22:52:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2022-07-13 22:52:22,605 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-13 22:52:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2022-07-13 22:52:22,607 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 99 [2022-07-13 22:52:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:22,608 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2022-07-13 22:52:22,608 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-13 22:52:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-07-13 22:52:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 22:52:22,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:22,611 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-13 22:52:22,634 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-13 22:52:22,831 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-13 22:52:22,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1176254157, now seen corresponding path program 1 times [2022-07-13 22:52:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098798788] [2022-07-13 22:52:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:22,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:52:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:22,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:52:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:52:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:52:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:52:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:52:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:23,083 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-13 22:52:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098798788] [2022-07-13 22:52:23,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098798788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907178673] [2022-07-13 22:52:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:23,085 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-13 22:52:23,112 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-13 22:52:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:23,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 22:52:23,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:23,280 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:52:23,281 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-13 22:52:23,292 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:52:23,293 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-13 22:52:24,027 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-13 22:52:24,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:24,479 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-13 22:52:24,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907178673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:52:24,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:52:24,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 26 [2022-07-13 22:52:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160960996] [2022-07-13 22:52:24,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:24,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 22:52:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 22:52:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:52:24,482 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-13 22:52:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:25,905 INFO L93 Difference]: Finished difference Result 411 states and 566 transitions. [2022-07-13 22:52:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 22:52:25,906 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-13 22:52:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:25,908 INFO L225 Difference]: With dead ends: 411 [2022-07-13 22:52:25,908 INFO L226 Difference]: Without dead ends: 306 [2022-07-13 22:52:25,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 206 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1878, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 22:52:25,910 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 236 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:25,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 2424 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1201 Invalid, 0 Unknown, 343 Unchecked, 0.8s Time] [2022-07-13 22:52:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-13 22:52:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 222. [2022-07-13 22:52:25,932 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-13 22:52:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 288 transitions. [2022-07-13 22:52:25,934 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 288 transitions. Word has length 99 [2022-07-13 22:52:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:25,934 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 288 transitions. [2022-07-13 22:52:25,935 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-13 22:52:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 288 transitions. [2022-07-13 22:52:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:25,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:25,936 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-13 22:52:25,958 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-13 22:52:26,151 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-13 22:52:26,152 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash 136318385, now seen corresponding path program 1 times [2022-07-13 22:52:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288647070] [2022-07-13 22:52:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:52:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:52:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:52:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:52:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:52:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:52:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,373 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-13 22:52:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:26,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288647070] [2022-07-13 22:52:26,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288647070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:26,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842319602] [2022-07-13 22:52:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:26,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:26,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:26,376 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-13 22:52:26,404 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-13 22:52:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:26,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 22:52:26,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:27,434 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-13 22:52:28,196 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-13 22:52:28,895 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-13 22:52:29,639 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-13 22:52:30,346 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-13 22:52:39,441 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-13 22:52:39,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:40,535 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:52:40,536 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-13 22:52:40,542 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-13 22:52:40,543 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-13 22:52:40,562 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-13 22:52:40,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842319602] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:52:40,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:52:40,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 11] total 30 [2022-07-13 22:52:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119303186] [2022-07-13 22:52:40,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:40,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 22:52:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:40,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 22:52:40,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=527, Unknown=7, NotChecked=250, Total=870 [2022-07-13 22:52:40,565 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-13 22:52:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:44,576 INFO L93 Difference]: Finished difference Result 742 states and 1078 transitions. [2022-07-13 22:52:44,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 22:52:44,578 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-13 22:52:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:44,582 INFO L225 Difference]: With dead ends: 742 [2022-07-13 22:52:44,582 INFO L226 Difference]: Without dead ends: 574 [2022-07-13 22:52:44,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 214 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=328, Invalid=1403, Unknown=11, NotChecked=420, Total=2162 [2022-07-13 22:52:44,584 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.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:44,585 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.5s Time] [2022-07-13 22:52:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-07-13 22:52:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 414. [2022-07-13 22:52:44,624 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-13 22:52:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 578 transitions. [2022-07-13 22:52:44,627 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 578 transitions. Word has length 101 [2022-07-13 22:52:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:44,627 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 578 transitions. [2022-07-13 22:52:44,627 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-13 22:52:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 578 transitions. [2022-07-13 22:52:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 22:52:44,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:44,630 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-13 22:52:44,655 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-13 22:52:44,843 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-13 22:52:44,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1312319311, now seen corresponding path program 1 times [2022-07-13 22:52:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:44,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747605897] [2022-07-13 22:52:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:52:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:52:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:52:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:52:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:44,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:52:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:52:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,013 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-13 22:52:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:45,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747605897] [2022-07-13 22:52:45,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747605897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:45,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206109150] [2022-07-13 22:52:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:45,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:45,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:45,015 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-13 22:52:45,017 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-13 22:52:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:52:45,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:45,188 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-13 22:52:45,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:45,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206109150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:45,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:45,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-13 22:52:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564485235] [2022-07-13 22:52:45,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:45,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:52:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:45,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:52:45,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:52:45,190 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-13 22:52:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:45,223 INFO L93 Difference]: Finished difference Result 610 states and 861 transitions. [2022-07-13 22:52:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:52:45,224 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-13 22:52:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:45,226 INFO L225 Difference]: With dead ends: 610 [2022-07-13 22:52:45,226 INFO L226 Difference]: Without dead ends: 368 [2022-07-13 22:52:45,227 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-13 22:52:45,228 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-13 22:52:45,228 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-13 22:52:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-13 22:52:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 360. [2022-07-13 22:52:45,252 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-13 22:52:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 492 transitions. [2022-07-13 22:52:45,254 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 492 transitions. Word has length 99 [2022-07-13 22:52:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:45,255 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 492 transitions. [2022-07-13 22:52:45,255 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-13 22:52:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 492 transitions. [2022-07-13 22:52:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:45,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:45,258 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-13 22:52:45,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 22:52:45,459 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-13 22:52:45,460 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1894539913, now seen corresponding path program 1 times [2022-07-13 22:52:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:45,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036508503] [2022-07-13 22:52:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:52:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:52:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:52:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:52:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:52:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:52:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,592 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-13 22:52:45,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:45,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036508503] [2022-07-13 22:52:45,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036508503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:45,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451416173] [2022-07-13 22:52:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:45,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:45,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:45,595 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-13 22:52:45,626 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-13 22:52:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:45,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:52:45,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:45,789 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-13 22:52:45,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:45,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451416173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:45,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:45,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-13 22:52:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761292252] [2022-07-13 22:52:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:45,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:52:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:52:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:52:45,791 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-13 22:52:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:45,814 INFO L93 Difference]: Finished difference Result 489 states and 676 transitions. [2022-07-13 22:52:45,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:52:45,815 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-13 22:52:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:45,816 INFO L225 Difference]: With dead ends: 489 [2022-07-13 22:52:45,816 INFO L226 Difference]: Without dead ends: 220 [2022-07-13 22:52:45,818 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-13 22:52:45,818 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-13 22:52:45,818 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-13 22:52:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-13 22:52:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2022-07-13 22:52:45,829 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-13 22:52:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2022-07-13 22:52:45,830 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 101 [2022-07-13 22:52:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:45,831 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2022-07-13 22:52:45,831 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-13 22:52:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2022-07-13 22:52:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:52:45,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:45,832 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-13 22:52:45,860 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-13 22:52:46,047 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-13 22:52:46,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1381429819, now seen corresponding path program 1 times [2022-07-13 22:52:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:46,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11673916] [2022-07-13 22:52:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:52:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:52:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:52:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:52:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:52:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:52:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:52:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,401 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-13 22:52:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:46,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11673916] [2022-07-13 22:52:46,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11673916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:46,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098153266] [2022-07-13 22:52:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:46,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:46,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:46,404 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-13 22:52:46,406 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-13 22:52:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:46,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:52:46,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:46,729 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-13 22:52:46,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:46,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098153266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:46,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:46,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-07-13 22:52:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904951619] [2022-07-13 22:52:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:46,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:52:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:46,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:52:46,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:52:46,731 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-13 22:52:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:46,905 INFO L93 Difference]: Finished difference Result 382 states and 484 transitions. [2022-07-13 22:52:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:52:46,906 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-13 22:52:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:46,907 INFO L225 Difference]: With dead ends: 382 [2022-07-13 22:52:46,907 INFO L226 Difference]: Without dead ends: 166 [2022-07-13 22:52:46,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:52:46,909 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-13 22:52:46,910 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-13 22:52:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-13 22:52:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2022-07-13 22:52:46,919 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-13 22:52:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2022-07-13 22:52:46,921 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 102 [2022-07-13 22:52:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:46,921 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2022-07-13 22:52:46,921 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-13 22:52:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2022-07-13 22:52:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 22:52:46,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:46,923 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-13 22:52:46,944 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-13 22:52:47,135 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-13 22:52:47,135 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -904744676, now seen corresponding path program 1 times [2022-07-13 22:52:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:47,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327745698] [2022-07-13 22:52:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:52:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:52:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:52:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:52:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:52:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:52:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:52:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,525 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-13 22:52:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:47,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327745698] [2022-07-13 22:52:47,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327745698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:47,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680893061] [2022-07-13 22:52:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:47,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:47,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:47,528 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-13 22:52:47,554 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-13 22:52:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-13 22:52:47,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:47,760 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-13 22:52:47,880 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-13 22:52:47,891 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:52:47,891 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-13 22:52:47,898 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-13 22:52:47,912 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:52:47,912 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-13 22:52:47,976 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-07-13 22:52:47,977 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 22:52:47,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:48,177 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-13 22:52:48,178 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:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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-13 22:52:48,180 INFO L158 Benchmark]: Toolchain (without parser) took 133309.43ms. Allocated memory was 81.8MB in the beginning and 186.6MB in the end (delta: 104.9MB). Free memory was 56.1MB in the beginning and 118.2MB in the end (delta: -62.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-07-13 22:52:48,180 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:52:48,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1786.19ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 55.9MB in the beginning and 64.5MB in the end (delta: -8.6MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-07-13 22:52:48,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.57ms. Allocated memory is still 111.1MB. Free memory was 64.5MB in the beginning and 58.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 22:52:48,181 INFO L158 Benchmark]: Boogie Preprocessor took 78.81ms. Allocated memory is still 111.1MB. Free memory was 58.9MB in the beginning and 56.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 22:52:48,181 INFO L158 Benchmark]: RCFGBuilder took 715.83ms. Allocated memory was 111.1MB in the beginning and 155.2MB in the end (delta: 44.0MB). Free memory was 56.2MB in the beginning and 108.4MB in the end (delta: -52.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 22:52:48,182 INFO L158 Benchmark]: TraceAbstraction took 130607.87ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 108.4MB in the beginning and 118.2MB in the end (delta: -9.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-07-13 22:52:48,183 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.20ms. Allocated memory is still 81.8MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1786.19ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 55.9MB in the beginning and 64.5MB in the end (delta: -8.6MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.57ms. Allocated memory is still 111.1MB. Free memory was 64.5MB in the beginning and 58.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.81ms. Allocated memory is still 111.1MB. Free memory was 58.9MB in the beginning and 56.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 715.83ms. Allocated memory was 111.1MB in the beginning and 155.2MB in the end (delta: 44.0MB). Free memory was 56.2MB in the beginning and 108.4MB in the end (delta: -52.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 130607.87ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 108.4MB in the beginning and 118.2MB in the end (delta: -9.8MB). Peak memory consumption was 22.2MB. 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-13 22:52:48,224 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-?-f4b24e3 [2022-07-13 22:52:50,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:52:50,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:52:50,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:52:50,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:52:50,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:52:50,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:52:50,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:52:50,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:52:50,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:52:50,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:52:50,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:52:50,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:52:50,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:52:50,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:52:50,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:52:50,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:52:50,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:52:50,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:52:50,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:52:50,171 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:52:50,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:52:50,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:52:50,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:52:50,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:52:50,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:52:50,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:52:50,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:52:50,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:52:50,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:52:50,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:52:50,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:52:50,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:52:50,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:52:50,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:52:50,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:52:50,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:52:50,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:52:50,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:52:50,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:52:50,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:52:50,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:52:50,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 22:52:50,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:52:50,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:52:50,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:52:50,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:52:50,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:52:50,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:52:50,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:52:50,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:52:50,232 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:52:50,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:52:50,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:52:50,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:52:50,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:52:50,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:52:50,234 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 22:52:50,238 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 22:52:50,238 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 22:52:50,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:52:50,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:52:50,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:52:50,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:52:50,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:52:50,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:52:50,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:52:50,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:52:50,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:52:50,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:52:50,240 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 22:52:50,241 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 22:52:50,241 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:52:50,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:52:50,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:52:50,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 22:52:50,241 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-13 22:52:50,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:52:50,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:52:50,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:52:50,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:52:50,601 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:52:50,604 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-13 22:52:50,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3913b63c0/1844dd394f0f4b03bdc57f020815d652/FLAGf178aef0c [2022-07-13 22:52:51,346 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:52:51,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-07-13 22:52:51,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3913b63c0/1844dd394f0f4b03bdc57f020815d652/FLAGf178aef0c [2022-07-13 22:52:51,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3913b63c0/1844dd394f0f4b03bdc57f020815d652 [2022-07-13 22:52:51,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:52:51,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:52:51,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:52:51,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:52:51,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:52:51,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:52:51" (1/1) ... [2022-07-13 22:52:51,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4871ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:51, skipping insertion in model container [2022-07-13 22:52:51,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:52:51" (1/1) ... [2022-07-13 22:52:51,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:52:51,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:52:52,008 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-13 22:52:52,013 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-13 22:52:52,722 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,722 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,723 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,723 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,726 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,740 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,741 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,742 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,742 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,748 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,750 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,750 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,751 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:52,985 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:52:52,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:52:52,987 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:52:52,988 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:52:52,989 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:52:52,989 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:52:52,990 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:52:52,990 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:52:52,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:52:52,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:52:53,078 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:52:53,110 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-13 22:52:53,118 INFO L158 Benchmark]: Toolchain (without parser) took 1455.36ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 28.2MB in the beginning and 36.8MB in the end (delta: -8.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-07-13 22:52:53,119 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 52.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:52:53,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1452.90ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 28.0MB in the beginning and 36.8MB in the end (delta: -8.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-07-13 22:52:53,122 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.23ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 52.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1452.90ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 28.0MB in the beginning and 36.8MB in the end (delta: -8.8MB). Peak memory consumption was 16.0MB. 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