./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_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 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:51:02,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:51:02,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:51:02,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:51:02,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:51:02,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:51:02,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:51:02,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:51:02,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:51:02,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:51:02,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:51:02,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:51:02,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:51:02,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:51:02,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:51:02,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:51:02,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:51:02,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:51:02,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:51:02,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:51:02,741 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:51:02,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:51:02,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:51:02,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:51:02,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:51:02,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:51:02,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:51:02,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:51:02,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:51:02,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:51:02,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:51:02,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:51:02,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:51:02,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:51:02,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:51:02,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:51:02,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:51:02,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:51:02,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:51:02,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:51:02,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:51:02,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:51:02,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:51:02,776 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:51:02,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:51:02,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:51:02,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:51:02,777 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:51:02,778 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:51:02,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:51:02,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:51:02,778 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:51:02,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:51:02,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:51:02,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:51:02,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:51:02,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:51:02,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:51:02,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:51:02,780 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:51:02,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:51:02,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:51:02,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:51:02,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:51:02,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:51:02,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:51:02,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:51:02,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:51:02,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:51:02,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:51:02,781 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:51:02,782 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:51:02,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:51:02,782 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 -> 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d [2022-07-13 22:51:02,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:51:03,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:51:03,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:51:03,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:51:03,004 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:51:03,005 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_init_harness.i [2022-07-13 22:51:03,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df01a5d19/70d1273bb2304bc0b98a22a4bbd33649/FLAG2f4fcc9b8 [2022-07-13 22:51:03,551 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:51:03,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2022-07-13 22:51:03,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df01a5d19/70d1273bb2304bc0b98a22a4bbd33649/FLAG2f4fcc9b8 [2022-07-13 22:51:04,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df01a5d19/70d1273bb2304bc0b98a22a4bbd33649 [2022-07-13 22:51:04,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:51:04,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:51:04,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:51:04,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:51:04,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:51:04,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:51:04" (1/1) ... [2022-07-13 22:51:04,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d86aa8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:04, skipping insertion in model container [2022-07-13 22:51:04,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:51:04" (1/1) ... [2022-07-13 22:51:04,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:51:04,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:51:04,407 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_init_harness.i[4494,4507] [2022-07-13 22:51:04,412 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_init_harness.i[4554,4567] [2022-07-13 22:51:04,824 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,825 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,826 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,826 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,827 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,842 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,842 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,843 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,844 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,845 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,846 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,846 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:04,846 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,019 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:51:05,020 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:51:05,021 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:51:05,021 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:51:05,022 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:51:05,023 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:51:05,023 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:51:05,023 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:51:05,024 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:51:05,032 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:51:05,113 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:51:05,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:51:05,158 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:51:05,174 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_init_harness.i[4494,4507] [2022-07-13 22:51:05,175 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_init_harness.i[4554,4567] [2022-07-13 22:51:05,209 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,210 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,210 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,210 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,214 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,222 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,223 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,224 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,224 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,225 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,225 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,226 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,226 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:05,269 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:51:05,270 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:51:05,270 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:51:05,271 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:51:05,271 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:51:05,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:51:05,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:51:05,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:51:05,273 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:51:05,273 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:51:05,285 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:51:05,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:51:05,455 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:51:05,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05 WrapperNode [2022-07-13 22:51:05,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:51:05,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:51:05,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:51:05,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:51:05,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,574 INFO L137 Inliner]: procedures = 679, calls = 1036, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2022-07-13 22:51:05,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:51:05,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:51:05,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:51:05,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:51:05,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:51:05,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:51:05,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:51:05,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:51:05,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (1/1) ... [2022-07-13 22:51:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:51:05,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:51:05,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:51:05,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:51:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2022-07-13 22:51:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2022-07-13 22:51:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:51:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:51:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:51:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-13 22:51:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-13 22:51:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-07-13 22:51:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-07-13 22:51:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:51:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:51:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:51:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:51:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-07-13 22:51:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-07-13 22:51:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:51:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:51:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:51:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:51:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:51:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:51:05,850 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:51:05,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:51:05,984 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:51:05,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:51:05,989 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 22:51:05,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:51:05 BoogieIcfgContainer [2022-07-13 22:51:05,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:51:05,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:51:05,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:51:05,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:51:05,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:51:04" (1/3) ... [2022-07-13 22:51:05,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ad4d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:51:05, skipping insertion in model container [2022-07-13 22:51:05,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:05" (2/3) ... [2022-07-13 22:51:05,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ad4d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:51:05, skipping insertion in model container [2022-07-13 22:51:05,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:51:05" (3/3) ... [2022-07-13 22:51:05,995 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2022-07-13 22:51:06,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:51:06,005 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:51:06,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:51:06,039 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@1a04a171, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30ceeb04 [2022-07-13 22:51:06,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:51:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 22:51:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 22:51:06,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:06,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:06,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:06,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2022-07-13 22:51:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:06,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576800230] [2022-07-13 22:51:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:06,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576800230] [2022-07-13 22:51:06,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576800230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:06,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:06,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:51:06,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399917196] [2022-07-13 22:51:06,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:06,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:51:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:06,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:51:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:51:06,346 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:06,369 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-07-13 22:51:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:51:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-13 22:51:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:06,375 INFO L225 Difference]: With dead ends: 117 [2022-07-13 22:51:06,375 INFO L226 Difference]: Without dead ends: 56 [2022-07-13 22:51:06,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:51:06,386 INFO L413 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:06,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:51:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-13 22:51:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-13 22:51:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 22:51:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-07-13 22:51:06,416 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2022-07-13 22:51:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:06,417 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-07-13 22:51:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-07-13 22:51:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 22:51:06,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:06,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:06,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:51:06,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2022-07-13 22:51:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:06,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385738701] [2022-07-13 22:51:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:06,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:06,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:06,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385738701] [2022-07-13 22:51:06,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385738701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:06,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:06,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:51:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212434465] [2022-07-13 22:51:06,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:06,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:51:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:06,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:51:06,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:51:06,751 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:06,952 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2022-07-13 22:51:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:51:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-13 22:51:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:06,955 INFO L225 Difference]: With dead ends: 108 [2022-07-13 22:51:06,955 INFO L226 Difference]: Without dead ends: 59 [2022-07-13 22:51:06,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:51:06,957 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:06,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 320 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:51:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-13 22:51:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-13 22:51:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-13 22:51:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-07-13 22:51:06,971 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2022-07-13 22:51:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:06,971 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-07-13 22:51:06,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-07-13 22:51:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 22:51:06,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:06,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:06,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:51:06,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1650638505, now seen corresponding path program 1 times [2022-07-13 22:51:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:06,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968533621] [2022-07-13 22:51:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:07,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968533621] [2022-07-13 22:51:07,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968533621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:07,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:07,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:51:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553200774] [2022-07-13 22:51:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:51:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:51:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:51:07,213 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:07,416 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2022-07-13 22:51:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:51:07,417 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-13 22:51:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:07,418 INFO L225 Difference]: With dead ends: 124 [2022-07-13 22:51:07,418 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 22:51:07,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:51:07,419 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 77 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:07,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 409 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:51:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 22:51:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-13 22:51:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 52 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-13 22:51:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-07-13 22:51:07,426 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 26 [2022-07-13 22:51:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:07,426 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-07-13 22:51:07,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-07-13 22:51:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 22:51:07,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:07,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:07,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:51:07,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1257611495, now seen corresponding path program 1 times [2022-07-13 22:51:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:07,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688459537] [2022-07-13 22:51:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:07,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688459537] [2022-07-13 22:51:07,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688459537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:07,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:07,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:51:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163208830] [2022-07-13 22:51:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:07,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:51:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:51:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:51:07,569 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:07,721 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2022-07-13 22:51:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:51:07,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-13 22:51:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:07,723 INFO L225 Difference]: With dead ends: 152 [2022-07-13 22:51:07,723 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 22:51:07,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:51:07,724 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 87 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:07,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 375 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:51:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 22:51:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2022-07-13 22:51:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-13 22:51:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2022-07-13 22:51:07,731 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 26 [2022-07-13 22:51:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:07,731 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2022-07-13 22:51:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2022-07-13 22:51:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 22:51:07,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:07,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:07,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:51:07,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:07,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1515776933, now seen corresponding path program 1 times [2022-07-13 22:51:07,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:07,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413841171] [2022-07-13 22:51:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:07,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413841171] [2022-07-13 22:51:07,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413841171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:07,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:07,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:51:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046986408] [2022-07-13 22:51:07,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:07,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:51:07,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:51:07,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:51:07,850 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:08,018 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2022-07-13 22:51:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:51:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-13 22:51:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:08,020 INFO L225 Difference]: With dead ends: 176 [2022-07-13 22:51:08,020 INFO L226 Difference]: Without dead ends: 110 [2022-07-13 22:51:08,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:51:08,021 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:08,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 480 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:51:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-13 22:51:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2022-07-13 22:51:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.396551724137931) internal successors, (81), 60 states have internal predecessors, (81), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-13 22:51:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2022-07-13 22:51:08,027 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 26 [2022-07-13 22:51:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:08,027 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2022-07-13 22:51:08,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 22:51:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-07-13 22:51:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 22:51:08,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:08,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:08,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:51:08,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:08,029 INFO L85 PathProgramCache]: Analyzing trace with hash 504659683, now seen corresponding path program 1 times [2022-07-13 22:51:08,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:08,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217334273] [2022-07-13 22:51:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:08,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217334273] [2022-07-13 22:51:08,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217334273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:08,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:08,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:51:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816743930] [2022-07-13 22:51:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:08,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:51:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:08,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:51:08,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:51:08,090 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:08,136 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2022-07-13 22:51:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:51:08,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-13 22:51:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:08,137 INFO L225 Difference]: With dead ends: 173 [2022-07-13 22:51:08,137 INFO L226 Difference]: Without dead ends: 70 [2022-07-13 22:51:08,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-13 22:51:08,138 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 45 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:08,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 380 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:51:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-13 22:51:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-13 22:51:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 53 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-13 22:51:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-07-13 22:51:08,143 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 26 [2022-07-13 22:51:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-07-13 22:51:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-07-13 22:51:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 22:51:08,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:08,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:08,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:51:08,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2022-07-13 22:51:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:08,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783805742] [2022-07-13 22:51:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:08,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783805742] [2022-07-13 22:51:08,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783805742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:08,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:08,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:51:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441592460] [2022-07-13 22:51:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:08,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:51:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:51:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:51:08,227 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:08,306 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2022-07-13 22:51:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:51:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-13 22:51:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:08,307 INFO L225 Difference]: With dead ends: 141 [2022-07-13 22:51:08,307 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 22:51:08,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:51:08,308 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 38 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:08,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 319 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:51:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 22:51:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-13 22:51:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 53 states have internal predecessors, (67), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-13 22:51:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-07-13 22:51:08,328 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 28 [2022-07-13 22:51:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:08,328 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-07-13 22:51:08,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-07-13 22:51:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 22:51:08,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:08,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:08,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:51:08,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2022-07-13 22:51:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:08,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292369495] [2022-07-13 22:51:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:08,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:08,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292369495] [2022-07-13 22:51:08,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292369495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:08,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:08,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:51:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527146081] [2022-07-13 22:51:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:08,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:51:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:51:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:51:08,448 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:08,589 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2022-07-13 22:51:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:51:08,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-13 22:51:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:08,590 INFO L225 Difference]: With dead ends: 159 [2022-07-13 22:51:08,590 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 22:51:08,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:51:08,591 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 64 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:08,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:51:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 22:51:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2022-07-13 22:51:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 55 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-13 22:51:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-07-13 22:51:08,597 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 30 [2022-07-13 22:51:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:08,597 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-07-13 22:51:08,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-07-13 22:51:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 22:51:08,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:08,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:08,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:51:08,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2022-07-13 22:51:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:08,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358657793] [2022-07-13 22:51:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:08,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:08,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358657793] [2022-07-13 22:51:08,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358657793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:08,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:08,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:51:08,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330292827] [2022-07-13 22:51:08,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:08,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:51:08,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:51:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:51:08,651 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:08,695 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2022-07-13 22:51:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:51:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-13 22:51:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:08,696 INFO L225 Difference]: With dead ends: 149 [2022-07-13 22:51:08,696 INFO L226 Difference]: Without dead ends: 84 [2022-07-13 22:51:08,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:51:08,697 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:08,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 276 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:51:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-13 22:51:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2022-07-13 22:51:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.290909090909091) internal successors, (71), 57 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-13 22:51:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-07-13 22:51:08,702 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 31 [2022-07-13 22:51:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:08,702 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-07-13 22:51:08,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 22:51:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-07-13 22:51:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 22:51:08,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:08,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:08,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:51:08,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1854431003, now seen corresponding path program 1 times [2022-07-13 22:51:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:08,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803081512] [2022-07-13 22:51:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:09,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:09,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803081512] [2022-07-13 22:51:09,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803081512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:09,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:09,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:51:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126721527] [2022-07-13 22:51:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:09,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:51:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:09,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:51:09,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:51:09,008 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 22:51:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:09,373 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2022-07-13 22:51:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:51:09,373 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-07-13 22:51:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:09,374 INFO L225 Difference]: With dead ends: 164 [2022-07-13 22:51:09,374 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 22:51:09,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:51:09,375 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 59 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:09,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 482 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:51:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 22:51:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2022-07-13 22:51:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-13 22:51:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-07-13 22:51:09,380 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 39 [2022-07-13 22:51:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:09,380 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-07-13 22:51:09,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 22:51:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-07-13 22:51:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 22:51:09,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:09,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:09,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:51:09,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1596265565, now seen corresponding path program 1 times [2022-07-13 22:51:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:09,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300388279] [2022-07-13 22:51:09,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:09,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300388279] [2022-07-13 22:51:09,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300388279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:09,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:51:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655452754] [2022-07-13 22:51:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:09,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:51:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:51:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:51:09,529 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 22:51:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:09,849 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2022-07-13 22:51:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:51:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-07-13 22:51:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:09,852 INFO L225 Difference]: With dead ends: 192 [2022-07-13 22:51:09,852 INFO L226 Difference]: Without dead ends: 120 [2022-07-13 22:51:09,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:51:09,853 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:09,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 519 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:51:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-13 22:51:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2022-07-13 22:51:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 66 states have internal predecessors, (80), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-13 22:51:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2022-07-13 22:51:09,862 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 39 [2022-07-13 22:51:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:09,863 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2022-07-13 22:51:09,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 22:51:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2022-07-13 22:51:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 22:51:09,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:09,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:09,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:51:09,864 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1687584481, now seen corresponding path program 1 times [2022-07-13 22:51:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:09,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138299679] [2022-07-13 22:51:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:09,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138299679] [2022-07-13 22:51:09,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138299679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:09,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:09,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:51:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389279847] [2022-07-13 22:51:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:09,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:51:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:51:09,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:51:09,978 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:51:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:10,135 INFO L93 Difference]: Finished difference Result 201 states and 278 transitions. [2022-07-13 22:51:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:51:10,136 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-13 22:51:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:10,137 INFO L225 Difference]: With dead ends: 201 [2022-07-13 22:51:10,137 INFO L226 Difference]: Without dead ends: 99 [2022-07-13 22:51:10,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:51:10,138 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:10,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:51:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-13 22:51:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2022-07-13 22:51:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 67 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-13 22:51:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2022-07-13 22:51:10,148 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 39 [2022-07-13 22:51:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:10,148 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2022-07-13 22:51:10,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:51:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-07-13 22:51:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 22:51:10,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:10,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:51:10,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 22:51:10,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1045188466, now seen corresponding path program 1 times [2022-07-13 22:51:10,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:10,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38847737] [2022-07-13 22:51:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:10,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38847737] [2022-07-13 22:51:10,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38847737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:51:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290181296] [2022-07-13 22:51:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:51:10,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:51:10,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:51:10,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:51:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:10,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 22:51:10,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:51:11,340 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-07-13 22:51:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:11,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:51:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:51:11,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290181296] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:51:11,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:51:11,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 8] total 27 [2022-07-13 22:51:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312787794] [2022-07-13 22:51:11,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:51:11,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 22:51:11,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:11,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 22:51:11,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=586, Unknown=1, NotChecked=48, Total=702 [2022-07-13 22:51:11,628 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 22:51:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:12,423 INFO L93 Difference]: Finished difference Result 233 states and 321 transitions. [2022-07-13 22:51:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 22:51:12,424 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 41 [2022-07-13 22:51:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:12,425 INFO L225 Difference]: With dead ends: 233 [2022-07-13 22:51:12,425 INFO L226 Difference]: Without dead ends: 155 [2022-07-13 22:51:12,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=188, Invalid=1455, Unknown=1, NotChecked=78, Total=1722 [2022-07-13 22:51:12,426 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 204 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:12,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 943 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 928 Invalid, 0 Unknown, 197 Unchecked, 0.4s Time] [2022-07-13 22:51:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-13 22:51:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 102. [2022-07-13 22:51:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 82 states have internal predecessors, (100), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 12 states have call predecessors, (21), 13 states have call successors, (21) [2022-07-13 22:51:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-07-13 22:51:12,434 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 41 [2022-07-13 22:51:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:12,435 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-07-13 22:51:12,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 22:51:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-07-13 22:51:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 22:51:12,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:12,436 INFO L195 NwaCegarLoop]: trace histogram [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-13 22:51:12,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:51:12,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 22:51:12,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2022-07-13 22:51:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:12,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610677033] [2022-07-13 22:51:12,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 22:51:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:12,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610677033] [2022-07-13 22:51:12,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610677033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:12,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:12,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:51:12,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204014932] [2022-07-13 22:51:12,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:12,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:51:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:51:12,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:51:12,732 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 22:51:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:12,781 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2022-07-13 22:51:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:51:12,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-07-13 22:51:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:12,782 INFO L225 Difference]: With dead ends: 118 [2022-07-13 22:51:12,782 INFO L226 Difference]: Without dead ends: 116 [2022-07-13 22:51:12,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:51:12,783 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:12,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 452 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:51:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-13 22:51:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2022-07-13 22:51:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 89 states have internal predecessors, (106), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (24), 13 states have call predecessors, (24), 14 states have call successors, (24) [2022-07-13 22:51:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2022-07-13 22:51:12,790 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 42 [2022-07-13 22:51:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:12,790 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2022-07-13 22:51:12,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 22:51:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2022-07-13 22:51:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 22:51:12,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:12,791 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:51:12,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:51:12,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1440497479, now seen corresponding path program 1 times [2022-07-13 22:51:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:12,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265409214] [2022-07-13 22:51:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:51:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:51:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:51:13,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:13,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265409214] [2022-07-13 22:51:13,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265409214] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:51:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515683435] [2022-07-13 22:51:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:51:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:51:13,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:51:13,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:51:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:13,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 22:51:13,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:51:13,166 INFO L356 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2022-07-13 22:51:13,167 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 3 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:51:13,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:13,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:13,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:13,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:13,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:13,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:13,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-13 22:51:25,562 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3| Int)) (not (= (+ |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| 16) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|))))) (exists ((v_aws_linked_list_init_~list.offset_BEFORE_CALL_4 Int) (v_aws_linked_list_init_~list.base_BEFORE_CALL_2 Int)) (and (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_init_~list.base_BEFORE_CALL_2) v_aws_linked_list_init_~list.offset_BEFORE_CALL_4) v_aws_linked_list_init_~list.base_BEFORE_CALL_2) (= (+ v_aws_linked_list_init_~list.offset_BEFORE_CALL_4 16) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_init_~list.base_BEFORE_CALL_2) v_aws_linked_list_init_~list.offset_BEFORE_CALL_4))))) is different from true [2022-07-13 22:51:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-13 22:51:25,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:51:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 22:51:26,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515683435] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:51:26,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:51:26,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 25 [2022-07-13 22:51:26,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060731170] [2022-07-13 22:51:26,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:51:26,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 22:51:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 22:51:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=474, Unknown=2, NotChecked=44, Total=600 [2022-07-13 22:51:26,024 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-13 22:51:38,407 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:51:50,466 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:52:02,540 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:52:14,593 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:52:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:14,783 INFO L93 Difference]: Finished difference Result 351 states and 468 transitions. [2022-07-13 22:52:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 22:52:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 50 [2022-07-13 22:52:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:14,792 INFO L225 Difference]: With dead ends: 351 [2022-07-13 22:52:14,792 INFO L226 Difference]: Without dead ends: 205 [2022-07-13 22:52:14,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 61.0s TimeCoverageRelationStatistics Valid=191, Invalid=1367, Unknown=6, NotChecked=76, Total=1640 [2022-07-13 22:52:14,793 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 138 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:14,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 935 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 207 Invalid, 0 Unknown, 249 Unchecked, 0.2s Time] [2022-07-13 22:52:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-13 22:52:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 149. [2022-07-13 22:52:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 122 states have internal predecessors, (146), 17 states have call successors, (17), 11 states have call predecessors, (17), 15 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-13 22:52:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 190 transitions. [2022-07-13 22:52:14,807 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 190 transitions. Word has length 50 [2022-07-13 22:52:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:14,808 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 190 transitions. [2022-07-13 22:52:14,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-13 22:52:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 190 transitions. [2022-07-13 22:52:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 22:52:14,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:14,808 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:52:14,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:15,026 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,SelfDestructingSolverStorable14 [2022-07-13 22:52:15,026 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2080562516, now seen corresponding path program 2 times [2022-07-13 22:52:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:15,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101614025] [2022-07-13 22:52:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:52:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:52:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:52:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:52:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101614025] [2022-07-13 22:52:15,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101614025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:15,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:52:15,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:52:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452207462] [2022-07-13 22:52:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:15,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:52:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:15,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:52:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:52:15,160 INFO L87 Difference]: Start difference. First operand 149 states and 190 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:52:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:15,313 INFO L93 Difference]: Finished difference Result 262 states and 340 transitions. [2022-07-13 22:52:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:52:15,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-07-13 22:52:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:15,315 INFO L225 Difference]: With dead ends: 262 [2022-07-13 22:52:15,315 INFO L226 Difference]: Without dead ends: 163 [2022-07-13 22:52:15,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:52:15,316 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 25 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:15,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 374 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:52:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-13 22:52:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2022-07-13 22:52:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.25) internal successors, (145), 123 states have internal predecessors, (145), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (28), 14 states have call predecessors, (28), 15 states have call successors, (28) [2022-07-13 22:52:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 189 transitions. [2022-07-13 22:52:15,324 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 189 transitions. Word has length 52 [2022-07-13 22:52:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:15,325 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 189 transitions. [2022-07-13 22:52:15,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:52:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 189 transitions. [2022-07-13 22:52:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 22:52:15,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:15,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:15,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 22:52:15,326 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -41969126, now seen corresponding path program 1 times [2022-07-13 22:52:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:15,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108956012] [2022-07-13 22:52:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:15,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:52:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:52:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:52:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:52:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 22:52:15,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:15,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108956012] [2022-07-13 22:52:15,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108956012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:15,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:52:15,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:52:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758748311] [2022-07-13 22:52:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:15,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:52:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:15,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:52:15,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:52:15,471 INFO L87 Difference]: Start difference. First operand 149 states and 189 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:52:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:15,619 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2022-07-13 22:52:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:52:15,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-07-13 22:52:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:15,620 INFO L225 Difference]: With dead ends: 155 [2022-07-13 22:52:15,620 INFO L226 Difference]: Without dead ends: 151 [2022-07-13 22:52:15,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:52:15,621 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:15,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 471 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:52:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-13 22:52:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-13 22:52:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 124 states have internal predecessors, (146), 16 states have call successors, (16), 12 states have call predecessors, (16), 16 states have return successors, (28), 14 states have call predecessors, (28), 15 states have call successors, (28) [2022-07-13 22:52:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2022-07-13 22:52:15,628 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 58 [2022-07-13 22:52:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:15,628 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2022-07-13 22:52:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:52:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2022-07-13 22:52:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:52:15,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:15,629 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2022-07-13 22:52:15,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 22:52:15,629 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1239716043, now seen corresponding path program 1 times [2022-07-13 22:52:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:15,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054412683] [2022-07-13 22:52:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:52:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:52:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:52:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:52:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:52:15,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:15,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054412683] [2022-07-13 22:52:15,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054412683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:15,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567518864] [2022-07-13 22:52:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:15,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:15,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:15,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:52:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:16,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 22:52:16,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:16,058 INFO L356 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2022-07-13 22:52:16,058 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 3 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:52:16,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:16,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:16,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:16,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:16,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:16,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:16,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:52:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 22:52:16,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:16,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1530 treesize of output 1506 [2022-07-13 22:52:17,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:17,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:52:17,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:52:17,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:52:17,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:52:17,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567518864] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:17,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:52:17,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 13] total 26 [2022-07-13 22:52:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990796533] [2022-07-13 22:52:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:17,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:52:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:52:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:52:17,271 INFO L87 Difference]: Start difference. First operand 151 states and 190 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:52:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:17,399 INFO L93 Difference]: Finished difference Result 160 states and 200 transitions. [2022-07-13 22:52:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:52:17,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 78 [2022-07-13 22:52:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:17,400 INFO L225 Difference]: With dead ends: 160 [2022-07-13 22:52:17,400 INFO L226 Difference]: Without dead ends: 153 [2022-07-13 22:52:17,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:52:17,401 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:17,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 258 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:52:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-13 22:52:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-13 22:52:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.225) internal successors, (147), 126 states have internal predecessors, (147), 16 states have call successors, (16), 12 states have call predecessors, (16), 16 states have return successors, (28), 14 states have call predecessors, (28), 15 states have call successors, (28) [2022-07-13 22:52:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 191 transitions. [2022-07-13 22:52:17,410 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 191 transitions. Word has length 78 [2022-07-13 22:52:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:17,410 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 191 transitions. [2022-07-13 22:52:17,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:52:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 191 transitions. [2022-07-13 22:52:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:52:17,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:17,411 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 22:52:17,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 22:52:17,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 22:52:17,628 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2049062669, now seen corresponding path program 1 times [2022-07-13 22:52:17,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:17,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392942560] [2022-07-13 22:52:17,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:17,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:52:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:52:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:52:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:52:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 22:52:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:17,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392942560] [2022-07-13 22:52:17,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392942560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:17,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912898638] [2022-07-13 22:52:17,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:17,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:17,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:18,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:18,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:52:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:18,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-13 22:52:18,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:18,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:18,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:18,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:18,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:18,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:52:20,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-13 22:52:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 5 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:52:35,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:35,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-07-13 22:52:35,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-07-13 22:52:38,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-07-13 22:52:38,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912898638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:38,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:52:38,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 33 [2022-07-13 22:52:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071677398] [2022-07-13 22:52:38,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:38,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:52:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:52:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1815, Unknown=2, NotChecked=0, Total=1980 [2022-07-13 22:52:38,126 INFO L87 Difference]: Start difference. First operand 153 states and 191 transitions. Second operand has 33 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 states have internal predecessors, (97), 13 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 22:52:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:57,744 INFO L93 Difference]: Finished difference Result 344 states and 457 transitions. [2022-07-13 22:52:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-13 22:52:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 states have internal predecessors, (97), 13 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) Word has length 78 [2022-07-13 22:52:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:57,746 INFO L225 Difference]: With dead ends: 344 [2022-07-13 22:52:57,747 INFO L226 Difference]: Without dead ends: 299 [2022-07-13 22:52:57,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 114 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=405, Invalid=4993, Unknown=4, NotChecked=0, Total=5402 [2022-07-13 22:52:57,748 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 161 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:57,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 752 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 735 Invalid, 0 Unknown, 337 Unchecked, 0.4s Time] [2022-07-13 22:52:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-13 22:52:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 244. [2022-07-13 22:52:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 193 states have (on average 1.2072538860103628) internal successors, (233), 201 states have internal predecessors, (233), 24 states have call successors, (24), 19 states have call predecessors, (24), 26 states have return successors, (44), 23 states have call predecessors, (44), 23 states have call successors, (44) [2022-07-13 22:52:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 301 transitions. [2022-07-13 22:52:57,780 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 301 transitions. Word has length 78 [2022-07-13 22:52:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:57,781 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 301 transitions. [2022-07-13 22:52:57,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 states have internal predecessors, (97), 13 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 22:52:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 301 transitions. [2022-07-13 22:52:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:52:57,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:57,782 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 22:52:57,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:57,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:57,984 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:57,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1852877617, now seen corresponding path program 1 times [2022-07-13 22:52:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:57,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503561877] [2022-07-13 22:52:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:52:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:52:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:52:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:52:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:52:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 22:52:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:58,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503561877] [2022-07-13 22:52:58,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503561877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:58,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317599390] [2022-07-13 22:52:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:58,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:58,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:58,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:52:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:58,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 22:52:58,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 22:52:59,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:59,656 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-13 22:52:59,656 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 30 treesize of output 25 [2022-07-13 22:52:59,661 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-13 22:52:59,661 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 12 [2022-07-13 22:52:59,756 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-13 22:52:59,756 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 30 treesize of output 25 [2022-07-13 22:52:59,761 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-13 22:52:59,761 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 12 [2022-07-13 22:52:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:52:59,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317599390] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:52:59,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:52:59,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 33 [2022-07-13 22:52:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455717798] [2022-07-13 22:52:59,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:59,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:52:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:52:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:52:59,776 INFO L87 Difference]: Start difference. First operand 244 states and 301 transitions. Second operand has 33 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-13 22:53:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:00,670 INFO L93 Difference]: Finished difference Result 332 states and 414 transitions. [2022-07-13 22:53:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 22:53:00,671 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 78 [2022-07-13 22:53:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:00,672 INFO L225 Difference]: With dead ends: 332 [2022-07-13 22:53:00,672 INFO L226 Difference]: Without dead ends: 325 [2022-07-13 22:53:00,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 149 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=329, Invalid=1741, Unknown=0, NotChecked=0, Total=2070 [2022-07-13 22:53:00,673 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 222 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:00,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 420 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 952 Invalid, 0 Unknown, 381 Unchecked, 0.5s Time] [2022-07-13 22:53:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-13 22:53:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 307. [2022-07-13 22:53:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 245 states have (on average 1.2163265306122448) internal successors, (298), 255 states have internal predecessors, (298), 28 states have call successors, (28), 24 states have call predecessors, (28), 33 states have return successors, (54), 27 states have call predecessors, (54), 27 states have call successors, (54) [2022-07-13 22:53:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 380 transitions. [2022-07-13 22:53:00,699 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 380 transitions. Word has length 78 [2022-07-13 22:53:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:00,700 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 380 transitions. [2022-07-13 22:53:00,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-13 22:53:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 380 transitions. [2022-07-13 22:53:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:53:00,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:00,704 INFO L195 NwaCegarLoop]: trace histogram [3, 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-13 22:53:00,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:00,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:00,919 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2111043055, now seen corresponding path program 1 times [2022-07-13 22:53:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:00,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322217137] [2022-07-13 22:53:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:00,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:53:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:53:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:53:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:53:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:53:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 22:53:01,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:01,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322217137] [2022-07-13 22:53:01,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322217137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:01,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113331280] [2022-07-13 22:53:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:01,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:01,162 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:01,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:53:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 22:53:01,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:02,193 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 0)))) is different from true [2022-07-13 22:53:03,043 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_32| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_32| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_32|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_32|) 0))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_32| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_32| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_32|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_32|) 0)))) is different from true [2022-07-13 22:53:03,838 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_33| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_33| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_33|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_33|) 0))) (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_33| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_33| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_33|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_33|) 0)))) is different from true [2022-07-13 22:53:04,593 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_34| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_34| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_34|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_34|) 0))) (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_34| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_34| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_34|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_34|) 0)))) is different from true [2022-07-13 22:53:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-07-13 22:53:05,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:53:05,454 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:53:05,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 22:53:05,459 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-13 22:53:05,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-13 22:53:05,563 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:53:05,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 22:53:05,568 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-13 22:53:05,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-13 22:53:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:53:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113331280] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:53:05,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:53:05,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 13] total 39 [2022-07-13 22:53:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271941954] [2022-07-13 22:53:05,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:53:05,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 22:53:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:05,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 22:53:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1073, Unknown=4, NotChecked=276, Total=1482 [2022-07-13 22:53:05,580 INFO L87 Difference]: Start difference. First operand 307 states and 380 transitions. Second operand has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-13 22:53:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:18,644 INFO L93 Difference]: Finished difference Result 447 states and 614 transitions. [2022-07-13 22:53:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 22:53:18,644 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) Word has length 78 [2022-07-13 22:53:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:18,646 INFO L225 Difference]: With dead ends: 447 [2022-07-13 22:53:18,646 INFO L226 Difference]: Without dead ends: 440 [2022-07-13 22:53:18,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 148 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=405, Invalid=3025, Unknown=8, NotChecked=468, Total=3906 [2022-07-13 22:53:18,647 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 285 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1029 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:18,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 283 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1137 Invalid, 0 Unknown, 1029 Unchecked, 0.6s Time] [2022-07-13 22:53:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-07-13 22:53:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 345. [2022-07-13 22:53:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 278 states have (on average 1.2517985611510791) internal successors, (348), 284 states have internal predecessors, (348), 30 states have call successors, (30), 26 states have call predecessors, (30), 36 states have return successors, (63), 34 states have call predecessors, (63), 29 states have call successors, (63) [2022-07-13 22:53:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 441 transitions. [2022-07-13 22:53:18,674 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 441 transitions. Word has length 78 [2022-07-13 22:53:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:18,674 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 441 transitions. [2022-07-13 22:53:18,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-13 22:53:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 441 transitions. [2022-07-13 22:53:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 22:53:18,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:18,676 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 22:53:18,693 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-13 22:53:18,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:18,891 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1310004315, now seen corresponding path program 1 times [2022-07-13 22:53:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:18,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283441403] [2022-07-13 22:53:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:53:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:53:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:53:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:53:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:53:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 22:53:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283441403] [2022-07-13 22:53:19,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283441403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958330433] [2022-07-13 22:53:19,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:19,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:19,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:19,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:19,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:53:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 121 conjunts are in the unsatisfiable core [2022-07-13 22:53:19,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:19,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:53:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:19,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:53:21,678 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_41| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_41| Int)) (let ((.cse0 (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_41| 24))) (and (= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_41|) .cse0)) (= |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_41|) .cse0))))) is different from true [2022-07-13 22:53:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-07-13 22:53:23,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:53:35,096 WARN L233 SmtUtils]: Spent 10.28s 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-13 22:53:45,463 WARN L233 SmtUtils]: Spent 10.26s 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-13 22:53:56,395 WARN L233 SmtUtils]: Spent 10.44s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:54:09,322 WARN L233 SmtUtils]: Spent 10.24s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:54:24,110 WARN L233 SmtUtils]: Spent 10.38s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:54:35,378 WARN L233 SmtUtils]: Spent 11.17s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:54:45,743 WARN L233 SmtUtils]: Spent 10.24s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:54:45,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958330433] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:54:45,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:54:45,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 45 [2022-07-13 22:54:45,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213860279] [2022-07-13 22:54:45,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:54:45,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-13 22:54:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:54:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-13 22:54:45,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3422, Unknown=4, NotChecked=118, Total=3782 [2022-07-13 22:54:45,783 INFO L87 Difference]: Start difference. First operand 345 states and 441 transitions. Second operand has 45 states, 40 states have (on average 2.85) internal successors, (114), 37 states have internal predecessors, (114), 14 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2022-07-13 22:54:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:54:59,098 INFO L93 Difference]: Finished difference Result 488 states and 645 transitions. [2022-07-13 22:54:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-13 22:54:59,098 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.85) internal successors, (114), 37 states have internal predecessors, (114), 14 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) Word has length 91 [2022-07-13 22:54:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:54:59,100 INFO L225 Difference]: With dead ends: 488 [2022-07-13 22:54:59,100 INFO L226 Difference]: Without dead ends: 463 [2022-07-13 22:54:59,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 97.0s TimeCoverageRelationStatistics Valid=644, Invalid=9058, Unknown=4, NotChecked=194, Total=9900 [2022-07-13 22:54:59,102 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 111 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 866 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:54:59,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 788 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1156 Invalid, 0 Unknown, 866 Unchecked, 0.8s Time] [2022-07-13 22:54:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-07-13 22:54:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 399. [2022-07-13 22:54:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 323 states have (on average 1.2136222910216719) internal successors, (392), 329 states have internal predecessors, (392), 33 states have call successors, (33), 30 states have call predecessors, (33), 42 states have return successors, (69), 39 states have call predecessors, (69), 32 states have call successors, (69) [2022-07-13 22:54:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 494 transitions. [2022-07-13 22:54:59,133 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 494 transitions. Word has length 91 [2022-07-13 22:54:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:54:59,133 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 494 transitions. [2022-07-13 22:54:59,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.85) internal successors, (114), 37 states have internal predecessors, (114), 14 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2022-07-13 22:54:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 494 transitions. [2022-07-13 22:54:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 22:54:59,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:54:59,134 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:54:59,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 22:54:59,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:54:59,352 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:54:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:54:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1568169753, now seen corresponding path program 1 times [2022-07-13 22:54:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:54:59,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980214329] [2022-07-13 22:54:59,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:54:59,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:54:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:54:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:54:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:54:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:54:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:54:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:54:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:54:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:54:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:54:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:54:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:54:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:54:59,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980214329] [2022-07-13 22:54:59,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980214329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:54:59,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889743695] [2022-07-13 22:54:59,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:54:59,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:54:59,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:54:59,767 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:54:59,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:54:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:59,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-13 22:54:59,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:55:02,113 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_51| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_51| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_51| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_51|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_51|))) is different from true [2022-07-13 22:55:04,181 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_52| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_52| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_52| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_52|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_52|))) is different from true [2022-07-13 22:55:06,238 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_53| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_53| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_53| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_53|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_53|))) is different from true [2022-07-13 22:55:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-13 22:55:07,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:55:07,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-13 22:55:07,815 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:55:07,815 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 16 treesize of output 15 [2022-07-13 22:55:08,219 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:55:08,220 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 16 treesize of output 15 [2022-07-13 22:55:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 22:55:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889743695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:55:08,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:55:08,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 21] total 50 [2022-07-13 22:55:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616002145] [2022-07-13 22:55:08,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:55:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 22:55:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:55:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 22:55:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1995, Unknown=3, NotChecked=276, Total=2450 [2022-07-13 22:55:08,311 INFO L87 Difference]: Start difference. First operand 399 states and 494 transitions. Second operand has 50 states, 45 states have (on average 3.111111111111111) internal successors, (140), 46 states have internal predecessors, (140), 18 states have call successors, (26), 7 states have call predecessors, (26), 14 states have return successors, (26), 14 states have call predecessors, (26), 17 states have call successors, (26)