./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_front_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 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:09:52,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:09:52,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:09:52,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:09:52,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:09:52,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:09:52,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:09:52,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:09:52,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:09:52,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:09:52,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:09:52,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:09:52,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:09:52,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:09:52,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:09:52,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:09:52,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:09:52,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:09:52,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:09:52,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:09:52,688 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:09:52,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:09:52,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:09:52,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:09:52,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:09:52,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:09:52,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:09:52,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:09:52,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:09:52,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:09:52,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:09:52,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:09:52,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:09:52,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:09:52,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:09:52,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:09:52,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:09:52,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:09:52,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:09:52,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:09:52,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:09:52,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:09:52,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:09:52,713 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:09:52,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:09:52,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:09:52,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:09:52,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:09:52,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:09:52,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:09:52,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:09:52,721 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:09:52,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:09:52,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:09:52,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:09:52,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:09:52,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:09:52,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:09:52,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:09:52,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:09:52,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:09:52,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:09:52,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:09:52,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:09:52,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:09:52,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:09:52,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:09:52,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:09:52,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:09:52,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:09:52,725 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:09:52,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:09:52,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:09:52,725 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 -> 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 [2022-07-12 11:09:52,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:09:52,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:09:52,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:09:52,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:09:52,953 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:09:52,954 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_front_harness.i [2022-07-12 11:09:53,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33fb5a72e/f8dbf869ec5e470bb2b4473c611f1de5/FLAGceff7a05e [2022-07-12 11:09:53,505 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:09:53,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-07-12 11:09:53,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33fb5a72e/f8dbf869ec5e470bb2b4473c611f1de5/FLAGceff7a05e [2022-07-12 11:09:53,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33fb5a72e/f8dbf869ec5e470bb2b4473c611f1de5 [2022-07-12 11:09:53,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:09:53,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:09:53,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:09:53,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:09:53,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:09:53,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:09:53" (1/1) ... [2022-07-12 11:09:53,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e640afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:53, skipping insertion in model container [2022-07-12 11:09:53,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:09:53" (1/1) ... [2022-07-12 11:09:53,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:09:54,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:09:54,290 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_front_harness.i[4495,4508] [2022-07-12 11:09:54,296 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_front_harness.i[4555,4568] [2022-07-12 11:09:54,864 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,866 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,867 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,868 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,869 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,879 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,879 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,880 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,881 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,882 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,882 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,883 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:54,883 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,080 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:55,082 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:55,083 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:55,084 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:55,084 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:55,085 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:55,085 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:55,085 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:55,086 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:55,091 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:55,184 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:55,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:55,220 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:09:55,231 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_front_harness.i[4495,4508] [2022-07-12 11:09:55,232 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_front_harness.i[4555,4568] [2022-07-12 11:09:55,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,292 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,293 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,293 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,298 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,303 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,303 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,305 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,305 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:55,339 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:55,340 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:55,341 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:55,341 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:55,344 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:55,345 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:55,345 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:55,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:55,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:55,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:55,365 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:55,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:55,509 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:09:55,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55 WrapperNode [2022-07-12 11:09:55,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:09:55,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:55,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:09:55,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:09:55,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,596 INFO L137 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2022-07-12 11:09:55,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:55,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:09:55,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:09:55,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:09:55,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:09:55,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:09:55,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:09:55,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:09:55,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (1/1) ... [2022-07-12 11:09:55,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:09:55,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:55,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:09:55,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:09:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:09:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:09:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:09:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-12 11:09:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-12 11:09:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:09:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-07-12 11:09:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-07-12 11:09:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:09:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:09:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2022-07-12 11:09:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2022-07-12 11:09:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:09:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:09:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-07-12 11:09:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-07-12 11:09:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:09:55,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:09:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:09:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:09:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:09:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:09:55,741 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:09:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-07-12 11:09:55,741 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-07-12 11:09:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:09:55,951 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:09:55,953 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:09:56,145 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:09:56,150 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:09:56,150 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 11:09:56,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:56 BoogieIcfgContainer [2022-07-12 11:09:56,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:09:56,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:09:56,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:09:56,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:09:56,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:09:53" (1/3) ... [2022-07-12 11:09:56,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aee612a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:56, skipping insertion in model container [2022-07-12 11:09:56,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:55" (2/3) ... [2022-07-12 11:09:56,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aee612a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:56, skipping insertion in model container [2022-07-12 11:09:56,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:56" (3/3) ... [2022-07-12 11:09:56,160 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2022-07-12 11:09:56,169 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:09:56,170 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:09:56,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:09:56,231 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@6667f50f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d77b166 [2022-07-12 11:09:56,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:09:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 11:09:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 11:09:56,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:56,245 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:56,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1286081961, now seen corresponding path program 1 times [2022-07-12 11:09:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552523587] [2022-07-12 11:09:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:09:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:09:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:09:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:09:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:09:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:09:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-12 11:09:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:56,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552523587] [2022-07-12 11:09:56,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552523587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:56,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:56,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:09:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686397705] [2022-07-12 11:09:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:56,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:09:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:09:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:09:56,629 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:09:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:56,656 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-07-12 11:09:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:09:56,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2022-07-12 11:09:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:56,664 INFO L225 Difference]: With dead ends: 188 [2022-07-12 11:09:56,664 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 11:09:56,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:09:56,668 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:56,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:09:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 11:09:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-12 11:09:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 11:09:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-07-12 11:09:56,698 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-07-12 11:09:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:56,698 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-07-12 11:09:56,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:09:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-07-12 11:09:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 11:09:56,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:56,701 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:56,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:09:56,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1287183985, now seen corresponding path program 1 times [2022-07-12 11:09:56,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:56,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654783015] [2022-07-12 11:09:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:09:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:09:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:09:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:09:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:09:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:09:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:09:57,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:57,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654783015] [2022-07-12 11:09:57,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654783015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:09:57,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490943222] [2022-07-12 11:09:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:57,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:57,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:57,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:09:57,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:09:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:57,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 11:09:57,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:57,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 11:09:57,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 11:09:57,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,397 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 28 treesize of output 31 [2022-07-12 11:09:57,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:09:57,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 11:09:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:09:58,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:09:58,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490943222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:58,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:09:58,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-07-12 11:09:58,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147192968] [2022-07-12 11:09:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:58,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:09:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:58,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:09:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:09:58,317 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-12 11:09:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:58,495 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2022-07-12 11:09:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:09:58,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 84 [2022-07-12 11:09:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:58,501 INFO L225 Difference]: With dead ends: 201 [2022-07-12 11:09:58,501 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 11:09:58,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:09:58,506 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 33 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:58,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 545 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2022-07-12 11:09:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 11:09:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2022-07-12 11:09:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 88 states have internal predecessors, (107), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2022-07-12 11:09:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2022-07-12 11:09:58,530 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 84 [2022-07-12 11:09:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:58,530 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2022-07-12 11:09:58,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-12 11:09:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2022-07-12 11:09:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 11:09:58,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:58,534 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:58,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:09:58,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:58,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2096530611, now seen corresponding path program 1 times [2022-07-12 11:09:58,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:58,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340635748] [2022-07-12 11:09:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:09:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:09:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:09:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:09:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:09:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:09:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:09:58,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:58,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340635748] [2022-07-12 11:09:58,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340635748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:09:58,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944361522] [2022-07-12 11:09:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:58,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:58,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:58,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:09:58,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:09:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 11:09:59,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:59,121 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:09:59,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:09:59,132 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:09:59,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:10:01,272 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) 0)))) is different from true [2022-07-12 11:10:03,360 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)) 0)))) is different from true [2022-07-12 11:10:05,418 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) 0)))) is different from true [2022-07-12 11:10:07,469 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) 0)))) is different from true [2022-07-12 11:10:15,519 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-12 11:10:23,619 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:10:31,704 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:10:37,776 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-12 11:10:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2022-07-12 11:10:37,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:10:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 11:10:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944361522] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:10:40,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:10:40,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 11] total 27 [2022-07-12 11:10:40,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883378408] [2022-07-12 11:10:40,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:10:40,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 11:10:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 11:10:40,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=438, Unknown=8, NotChecked=180, Total=702 [2022-07-12 11:10:40,240 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-07-12 11:11:14,875 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:11:22,929 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-12 11:11:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:31,247 INFO L93 Difference]: Finished difference Result 270 states and 364 transitions. [2022-07-12 11:11:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 11:11:31,259 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 84 [2022-07-12 11:11:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:31,261 INFO L225 Difference]: With dead ends: 270 [2022-07-12 11:11:31,261 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 11:11:31,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 91.1s TimeCoverageRelationStatistics Valid=224, Invalid=1175, Unknown=23, NotChecked=300, Total=1722 [2022-07-12 11:11:31,263 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 98 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 671 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:31,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1271 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 670 Invalid, 0 Unknown, 671 Unchecked, 0.4s Time] [2022-07-12 11:11:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 11:11:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2022-07-12 11:11:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 104 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2022-07-12 11:11:31,273 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 84 [2022-07-12 11:11:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:31,274 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2022-07-12 11:11:31,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-07-12 11:11:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2022-07-12 11:11:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 11:11:31,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:31,275 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:31,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:31,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 11:11:31,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1055778647, now seen corresponding path program 1 times [2022-07-12 11:11:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:31,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108654845] [2022-07-12 11:11:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:11:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:11:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:11:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:11:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:11:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:31,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108654845] [2022-07-12 11:11:31,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108654845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:31,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199605108] [2022-07-12 11:11:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:31,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:31,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:31,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:31,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:11:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:31,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:11:31,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:11:31,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:31,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199605108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:31,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:31,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-07-12 11:11:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321310813] [2022-07-12 11:11:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:31,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:11:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:11:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:11:31,915 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:32,110 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2022-07-12 11:11:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:11:32,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-07-12 11:11:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:32,112 INFO L225 Difference]: With dead ends: 241 [2022-07-12 11:11:32,112 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 11:11:32,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:11:32,114 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:32,114 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.1s Time] [2022-07-12 11:11:32,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 11:11:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-12 11:11:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 104 states have internal predecessors, (127), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-07-12 11:11:32,126 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 88 [2022-07-12 11:11:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:32,127 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-07-12 11:11:32,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-07-12 11:11:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 11:11:32,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:32,129 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:32,146 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-12 11:11:32,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:32,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:32,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash 426166840, now seen corresponding path program 1 times [2022-07-12 11:11:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:32,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590009250] [2022-07-12 11:11:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:11:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:11:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:11:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:11:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:11:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:32,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590009250] [2022-07-12 11:11:32,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590009250] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:32,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631769371] [2022-07-12 11:11:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:32,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:32,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:32,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:11:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:32,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:11:32,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 11:11:32,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:32,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631769371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:32,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:32,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-07-12 11:11:32,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108936047] [2022-07-12 11:11:32,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:32,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:11:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:32,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:11:32,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:11:32,677 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:32,953 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2022-07-12 11:11:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:11:32,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-07-12 11:11:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:32,955 INFO L225 Difference]: With dead ends: 250 [2022-07-12 11:11:32,955 INFO L226 Difference]: Without dead ends: 154 [2022-07-12 11:11:32,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:11:32,956 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 185 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:32,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 577 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:11:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-12 11:11:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2022-07-12 11:11:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 105 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-07-12 11:11:32,965 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 88 [2022-07-12 11:11:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:32,966 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-07-12 11:11:32,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-12 11:11:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-07-12 11:11:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 11:11:32,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:32,968 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] [2022-07-12 11:11:32,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:33,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:33,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1868931672, now seen corresponding path program 1 times [2022-07-12 11:11:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:33,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908467282] [2022-07-12 11:11:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:11:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:11:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:11:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:11:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 11:11:33,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:33,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908467282] [2022-07-12 11:11:33,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908467282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:33,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266774622] [2022-07-12 11:11:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:33,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:33,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:33,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:33,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:11:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:11:33,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 11:11:33,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:33,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266774622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:33,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:33,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-12 11:11:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398442748] [2022-07-12 11:11:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:33,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:11:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:11:33,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:11:33,443 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 11:11:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:33,455 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2022-07-12 11:11:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:11:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 91 [2022-07-12 11:11:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:33,457 INFO L225 Difference]: With dead ends: 246 [2022-07-12 11:11:33,457 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 11:11:33,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:11:33,458 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:33,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 11:11:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-12 11:11:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 106 states have internal predecessors, (129), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-07-12 11:11:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-07-12 11:11:33,476 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 91 [2022-07-12 11:11:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:33,478 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-07-12 11:11:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 11:11:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-07-12 11:11:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 11:11:33,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:33,479 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] [2022-07-12 11:11:33,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:33,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2072143320, now seen corresponding path program 1 times [2022-07-12 11:11:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360917935] [2022-07-12 11:11:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:11:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:11:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:11:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:11:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:11:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:33,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360917935] [2022-07-12 11:11:33,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360917935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:33,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947475132] [2022-07-12 11:11:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:33,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:33,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:11:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:33,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 11:11:33,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:33,998 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:33,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:11:34,007 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:34,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:11:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 11:11:34,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:11:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 11:11:34,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947475132] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:11:34,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:11:34,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2022-07-12 11:11:34,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229500230] [2022-07-12 11:11:34,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:11:34,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:11:34,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:34,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:11:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:11:34,847 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 11:11:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:35,352 INFO L93 Difference]: Finished difference Result 262 states and 340 transitions. [2022-07-12 11:11:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 11:11:35,353 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 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 97 [2022-07-12 11:11:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:35,354 INFO L225 Difference]: With dead ends: 262 [2022-07-12 11:11:35,354 INFO L226 Difference]: Without dead ends: 166 [2022-07-12 11:11:35,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 201 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 11:11:35,355 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 110 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:35,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1248 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 334 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2022-07-12 11:11:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-12 11:11:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 159. [2022-07-12 11:11:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 115 states have internal predecessors, (139), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (33), 27 states have call predecessors, (33), 29 states have call successors, (33) [2022-07-12 11:11:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2022-07-12 11:11:35,377 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 97 [2022-07-12 11:11:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:35,378 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2022-07-12 11:11:35,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 11:11:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-07-12 11:11:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:11:35,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:35,379 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:35,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:35,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:35,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1222210787, now seen corresponding path program 1 times [2022-07-12 11:11:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:35,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300807242] [2022-07-12 11:11:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:11:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:11:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:11:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:11:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 11:11:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:35,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300807242] [2022-07-12 11:11:35,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300807242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:35,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601993074] [2022-07-12 11:11:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:35,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:35,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:35,771 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:35,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:11:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:35,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 11:11:35,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:35,958 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:35,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:11:35,968 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:11:35,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:11:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 11:11:36,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:11:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 11:11:36,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601993074] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:11:36,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:11:36,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 26 [2022-07-12 11:11:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801801078] [2022-07-12 11:11:36,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:11:36,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 11:11:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:36,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 11:11:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:11:36,985 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 6 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2022-07-12 11:11:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:38,157 INFO L93 Difference]: Finished difference Result 411 states and 566 transitions. [2022-07-12 11:11:38,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 11:11:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 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 101 [2022-07-12 11:11:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:38,162 INFO L225 Difference]: With dead ends: 411 [2022-07-12 11:11:38,162 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 11:11:38,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 216 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 11:11:38,164 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 205 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:38,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 2521 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1104 Invalid, 0 Unknown, 272 Unchecked, 0.6s Time] [2022-07-12 11:11:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 11:11:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 222. [2022-07-12 11:11:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 166 states have internal predecessors, (202), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (50), 35 states have call predecessors, (50), 35 states have call successors, (50) [2022-07-12 11:11:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 288 transitions. [2022-07-12 11:11:38,180 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 288 transitions. Word has length 101 [2022-07-12 11:11:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:38,181 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 288 transitions. [2022-07-12 11:11:38,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 6 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2022-07-12 11:11:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 288 transitions. [2022-07-12 11:11:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 11:11:38,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:38,182 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] [2022-07-12 11:11:38,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:38,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:38,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:38,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash -452490819, now seen corresponding path program 1 times [2022-07-12 11:11:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:38,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323536338] [2022-07-12 11:11:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:11:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:11:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:11:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:11:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:11:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323536338] [2022-07-12 11:11:38,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323536338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355554868] [2022-07-12 11:11:38,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:38,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:38,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:38,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:11:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:38,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 11:11:38,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:39,687 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5|) 0)))) is different from true [2022-07-12 11:11:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:11:40,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:11:40,649 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:11:40,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-12 11:11:40,655 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-12 11:11:40,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 11:11:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:11:40,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355554868] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:11:40,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:11:40,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 11] total 31 [2022-07-12 11:11:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964376273] [2022-07-12 11:11:40,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:11:40,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 11:11:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:40,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 11:11:40,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2022-07-12 11:11:40,671 INFO L87 Difference]: Start difference. First operand 222 states and 288 transitions. Second operand has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) [2022-07-12 11:11:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:42,199 INFO L93 Difference]: Finished difference Result 672 states and 973 transitions. [2022-07-12 11:11:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 11:11:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) Word has length 99 [2022-07-12 11:11:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:42,205 INFO L225 Difference]: With dead ends: 672 [2022-07-12 11:11:42,205 INFO L226 Difference]: Without dead ends: 500 [2022-07-12 11:11:42,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 209 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=405, Invalid=2460, Unknown=1, NotChecked=104, Total=2970 [2022-07-12 11:11:42,210 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 323 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:42,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 2611 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1318 Invalid, 0 Unknown, 629 Unchecked, 0.7s Time] [2022-07-12 11:11:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-12 11:11:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 354. [2022-07-12 11:11:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 269 states have (on average 1.3011152416356877) internal successors, (350), 274 states have internal predecessors, (350), 51 states have call successors, (51), 28 states have call predecessors, (51), 33 states have return successors, (95), 51 states have call predecessors, (95), 50 states have call successors, (95) [2022-07-12 11:11:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 496 transitions. [2022-07-12 11:11:42,245 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 496 transitions. Word has length 99 [2022-07-12 11:11:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:42,246 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 496 transitions. [2022-07-12 11:11:42,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) [2022-07-12 11:11:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 496 transitions. [2022-07-12 11:11:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 11:11:42,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:42,249 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:42,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 11:11:42,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 11:11:42,467 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1509083839, now seen corresponding path program 1 times [2022-07-12 11:11:42,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:42,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935163718] [2022-07-12 11:11:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:11:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:11:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:11:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:11:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 11:11:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935163718] [2022-07-12 11:11:42,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935163718] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072323078] [2022-07-12 11:11:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:42,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:42,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:42,577 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:42,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:11:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:42,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:11:42,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 11:11:42,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:42,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072323078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:42,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:42,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-12 11:11:42,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799934530] [2022-07-12 11:11:42,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:42,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:11:42,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:11:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:11:42,725 INFO L87 Difference]: Start difference. First operand 354 states and 496 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:42,750 INFO L93 Difference]: Finished difference Result 534 states and 751 transitions. [2022-07-12 11:11:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:11:42,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-07-12 11:11:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:42,752 INFO L225 Difference]: With dead ends: 534 [2022-07-12 11:11:42,752 INFO L226 Difference]: Without dead ends: 323 [2022-07-12 11:11:42,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:11:42,753 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:42,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-12 11:11:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2022-07-12 11:11:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 243 states have (on average 1.2798353909465021) internal successors, (311), 247 states have internal predecessors, (311), 46 states have call successors, (46), 25 states have call predecessors, (46), 29 states have return successors, (80), 46 states have call predecessors, (80), 45 states have call successors, (80) [2022-07-12 11:11:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 437 transitions. [2022-07-12 11:11:42,768 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 437 transitions. Word has length 99 [2022-07-12 11:11:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:42,768 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 437 transitions. [2022-07-12 11:11:42,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 437 transitions. [2022-07-12 11:11:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:11:42,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:42,770 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:42,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 11:11:42,988 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1388679973, now seen corresponding path program 1 times [2022-07-12 11:11:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:42,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639590079] [2022-07-12 11:11:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:11:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:11:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:11:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:11:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-12 11:11:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:43,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639590079] [2022-07-12 11:11:43,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639590079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:43,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548742812] [2022-07-12 11:11:43,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:43,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:43,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:43,076 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:43,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:11:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:11:43,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 11:11:43,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:11:43,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548742812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:43,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:11:43,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-12 11:11:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020660516] [2022-07-12 11:11:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:43,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:11:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:11:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:11:43,232 INFO L87 Difference]: Start difference. First operand 319 states and 437 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:43,257 INFO L93 Difference]: Finished difference Result 423 states and 578 transitions. [2022-07-12 11:11:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:11:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2022-07-12 11:11:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:43,259 INFO L225 Difference]: With dead ends: 423 [2022-07-12 11:11:43,259 INFO L226 Difference]: Without dead ends: 178 [2022-07-12 11:11:43,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:11:43,260 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:43,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 351 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-12 11:11:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-07-12 11:11:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 122 states have internal predecessors, (140), 31 states have call successors, (31), 16 states have call predecessors, (31), 17 states have return successors, (36), 28 states have call predecessors, (36), 30 states have call successors, (36) [2022-07-12 11:11:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 207 transitions. [2022-07-12 11:11:43,269 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 207 transitions. Word has length 101 [2022-07-12 11:11:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:43,269 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 207 transitions. [2022-07-12 11:11:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:11:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2022-07-12 11:11:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 11:11:43,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:43,271 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] [2022-07-12 11:11:43,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:43,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 11:11:43,489 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash 226471105, now seen corresponding path program 1 times [2022-07-12 11:11:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:43,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495715588] [2022-07-12 11:11:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:11:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:11:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:11:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:11:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 11:11:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495715588] [2022-07-12 11:11:43,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495715588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:43,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:11:43,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:11:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167191042] [2022-07-12 11:11:43,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:43,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:11:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:43,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:11:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:11:43,696 INFO L87 Difference]: Start difference. First operand 167 states and 207 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:11:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:43,749 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-07-12 11:11:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:11:43,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 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 100 [2022-07-12 11:11:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:43,751 INFO L225 Difference]: With dead ends: 324 [2022-07-12 11:11:43,751 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 11:11:43,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:11:43,752 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 39 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:43,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 697 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 11:11:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2022-07-12 11:11:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 112 states have internal predecessors, (126), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (35), 28 states have call predecessors, (35), 30 states have call successors, (35) [2022-07-12 11:11:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2022-07-12 11:11:43,761 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 100 [2022-07-12 11:11:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:43,761 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2022-07-12 11:11:43,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:11:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2022-07-12 11:11:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 11:11:43,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:43,763 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:43,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 11:11:43,763 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1515726786, now seen corresponding path program 1 times [2022-07-12 11:11:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:43,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140432075] [2022-07-12 11:11:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:11:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:11:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:11:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:11:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:11:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:11:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:11:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-12 11:11:44,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:44,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140432075] [2022-07-12 11:11:44,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140432075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:44,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58920726] [2022-07-12 11:11:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:44,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:44,100 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:44,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:11:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:44,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 11:11:44,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:44,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:11:44,376 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:11:44,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:11:44,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 11:11:44,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:11:44,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:11:44,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2022-07-12 11:11:44,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2022-07-12 11:11:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 11:11:44,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:11:45,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1120 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1120) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1119) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_1121)) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset|) (+ 16 |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset|)))) is different from false [2022-07-12 11:11:45,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:11:45,137 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 1 case distinctions, treesize of input 42 treesize of output 35 [2022-07-12 11:11:45,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:11:45,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 277 [2022-07-12 11:11:45,159 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 306 treesize of output 298 [2022-07-12 11:11:45,164 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 298 treesize of output 294 [2022-07-12 11:11:45,205 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 6 treesize of output 4 [2022-07-12 11:11:45,229 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 8 treesize of output 6 [2022-07-12 11:11:45,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:11:45,234 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 23 treesize of output 27 [2022-07-12 11:11:45,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:11:45,268 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 77 treesize of output 77 [2022-07-12 11:11:45,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58920726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:45,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:11:45,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-07-12 11:11:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870947149] [2022-07-12 11:11:45,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:11:45,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 11:11:45,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 11:11:45,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1083, Unknown=1, NotChecked=66, Total=1260 [2022-07-12 11:11:45,591 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 25 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 10 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (25), 8 states have call predecessors, (25), 10 states have call successors, (25) [2022-07-12 11:11:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:46,407 INFO L93 Difference]: Finished difference Result 368 states and 475 transitions. [2022-07-12 11:11:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 11:11:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 10 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (25), 8 states have call predecessors, (25), 10 states have call successors, (25) Word has length 115 [2022-07-12 11:11:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:46,409 INFO L225 Difference]: With dead ends: 368 [2022-07-12 11:11:46,409 INFO L226 Difference]: Without dead ends: 241 [2022-07-12 11:11:46,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 222 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=2036, Unknown=1, NotChecked=92, Total=2352 [2022-07-12 11:11:46,410 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 127 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:46,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2519 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1004 Invalid, 0 Unknown, 369 Unchecked, 0.5s Time] [2022-07-12 11:11:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-12 11:11:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2022-07-12 11:11:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 156 states have internal predecessors, (177), 43 states have call successors, (43), 18 states have call predecessors, (43), 21 states have return successors, (54), 43 states have call predecessors, (54), 42 states have call successors, (54) [2022-07-12 11:11:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 274 transitions. [2022-07-12 11:11:46,421 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 274 transitions. Word has length 115 [2022-07-12 11:11:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:46,421 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 274 transitions. [2022-07-12 11:11:46,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 10 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (25), 8 states have call predecessors, (25), 10 states have call successors, (25) [2022-07-12 11:11:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 274 transitions. [2022-07-12 11:11:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 11:11:46,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:46,422 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] [2022-07-12 11:11:46,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 11:11:46,635 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,SelfDestructingSolverStorable12 [2022-07-12 11:11:46,635 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1963183712, now seen corresponding path program 1 times [2022-07-12 11:11:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:46,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063940371] [2022-07-12 11:11:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:11:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:11:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:11:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:11:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:11:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:11:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:11:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 11:11:47,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:47,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063940371] [2022-07-12 11:11:47,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063940371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:47,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534641175] [2022-07-12 11:11:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:47,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:47,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:47,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:11:47,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:11:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:47,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-12 11:11:47,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:47,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-12 11:11:47,347 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:11:47,352 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-12 11:11:47,354 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:11:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:11:49,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:12:02,493 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:12:14,754 WARN L233 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:12:15,997 INFO L356 Elim1Store]: treesize reduction 8, result has 95.2 percent of original size [2022-07-12 11:12:15,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 6464 treesize of output 6206 [2022-07-12 11:12:16,295 INFO L356 Elim1Store]: treesize reduction 30, result has 85.8 percent of original size [2022-07-12 11:12:16,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 37122 treesize of output 34704 [2022-07-12 11:12:16,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:12:16,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42483 treesize of output 40545 [2022-07-12 11:12:17,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:12:17,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 47868 treesize of output 46126 [2022-07-12 11:12:18,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:12:18,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 45558 treesize of output 44171 [2022-07-12 11:12:19,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:12:19,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43824 treesize of output 43079