./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_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_byte_cursor_trim_pred_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 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:45:41,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:45:41,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:45:41,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:45:41,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:45:41,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:45:41,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:45:41,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:45:41,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:45:41,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:45:41,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:45:41,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:45:41,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:45:41,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:45:41,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:45:41,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:45:41,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:45:41,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:45:41,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:45:41,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:45:41,955 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:45:41,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:45:41,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:45:41,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:45:41,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:45:41,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:45:41,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:45:41,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:45:41,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:45:41,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:45:41,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:45:41,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:45:41,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:45:41,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:45:41,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:45:41,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:45:41,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:45:41,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:45:41,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:45:41,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:45:41,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:45:41,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:45:41,969 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:45:41,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:45:41,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:45:41,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:45:42,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:45:42,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:45:42,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:45:42,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:45:42,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:45:42,002 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:45:42,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:45:42,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:45:42,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:45:42,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:45:42,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:45:42,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:45:42,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:45:42,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:45:42,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:45:42,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:45:42,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:45:42,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:45:42,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:45:42,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:45:42,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:45:42,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:45:42,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:45:42,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:45:42,013 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:45:42,013 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:45:42,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:45:42,014 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 -> 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc [2022-07-13 22:45:42,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:45:42,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:45:42,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:45:42,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:45:42,264 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:45:42,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i [2022-07-13 22:45:42,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aedfdb57/1986b645d76c4fd79599c1adf6240827/FLAG22624b608 [2022-07-13 22:45:43,040 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:45:43,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i [2022-07-13 22:45:43,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aedfdb57/1986b645d76c4fd79599c1adf6240827/FLAG22624b608 [2022-07-13 22:45:43,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aedfdb57/1986b645d76c4fd79599c1adf6240827 [2022-07-13 22:45:43,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:45:43,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:45:43,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:45:43,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:45:43,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:45:43,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:45:43" (1/1) ... [2022-07-13 22:45:43,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495b9bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:43, skipping insertion in model container [2022-07-13 22:45:43,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:45:43" (1/1) ... [2022-07-13 22:45:43,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:45:43,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:45:43,444 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_byte_cursor_trim_pred_harness.i[4499,4512] [2022-07-13 22:45:43,456 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_byte_cursor_trim_pred_harness.i[4559,4572] [2022-07-13 22:45:44,104 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,105 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,105 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,106 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,106 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,115 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,378 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:45:44,384 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:45:44,385 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:45:44,386 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:45:44,387 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:45:44,387 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:45:44,388 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:45:44,388 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:45:44,388 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:45:44,389 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:45:44,484 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:45:44,614 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,623 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:45:44,730 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:45:44,752 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_byte_cursor_trim_pred_harness.i[4499,4512] [2022-07-13 22:45:44,754 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_byte_cursor_trim_pred_harness.i[4559,4572] [2022-07-13 22:45:44,786 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,786 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,787 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,787 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,788 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,796 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,797 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,799 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,800 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,842 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:45:44,843 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:45:44,843 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:45:44,844 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:45:44,845 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:45:44,845 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:45:44,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:45:44,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:45:44,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:45:44,847 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:45:44,875 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:45:44,961 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,961 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:45:44,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:45:45,134 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:45:45,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45 WrapperNode [2022-07-13 22:45:45,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:45:45,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:45:45,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:45:45,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:45:45,142 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:45:45" (1/1) ... [2022-07-13 22:45:45,228 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:45:45" (1/1) ... [2022-07-13 22:45:45,302 INFO L137 Inliner]: procedures = 690, calls = 2620, calls flagged for inlining = 62, calls inlined = 10, statements flattened = 894 [2022-07-13 22:45:45,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:45:45,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:45:45,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:45:45,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:45:45,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:45:45,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:45:45,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:45:45,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:45:45,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (1/1) ... [2022-07-13 22:45:45,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:45:45,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:45,440 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:45:45,466 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:45:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-13 22:45:45,487 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-13 22:45:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:45:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:45:45,488 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:45:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:45:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:45:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:45:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_left_trim_pred [2022-07-13 22:45:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_left_trim_pred [2022-07-13 22:45:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:45:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:45:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:45:45,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:45:45,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:45:45,491 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:45:45,491 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:45:45,491 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-13 22:45:45,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-13 22:45:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:45:45,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:45:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:45:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:45:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:45:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~uint8_t~0~TO~int [2022-07-13 22:45:45,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~uint8_t~0~TO~int [2022-07-13 22:45:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:45:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:45:45,741 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:45:45,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:45:46,709 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:45:46,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:45:46,717 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 22:45:46,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:45:46 BoogieIcfgContainer [2022-07-13 22:45:46,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:45:46,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:45:46,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:45:46,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:45:46,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:45:43" (1/3) ... [2022-07-13 22:45:46,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b50fc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:45:46, skipping insertion in model container [2022-07-13 22:45:46,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:45:45" (2/3) ... [2022-07-13 22:45:46,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b50fc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:45:46, skipping insertion in model container [2022-07-13 22:45:46,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:45:46" (3/3) ... [2022-07-13 22:45:46,728 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_trim_pred_harness.i [2022-07-13 22:45:46,740 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:45:46,740 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:45:46,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:45:46,806 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@6bf2a580, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c51c7af [2022-07-13 22:45:46,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:45:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-13 22:45:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 22:45:46,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:46,821 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:46,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -484495775, now seen corresponding path program 1 times [2022-07-13 22:45:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:46,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105775565] [2022-07-13 22:45:46,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:45:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:45:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:45:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:45:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:45:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:45:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:45:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 22:45:47,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:47,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105775565] [2022-07-13 22:45:47,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105775565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:47,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:45:47,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:45:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289684430] [2022-07-13 22:45:47,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:47,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:45:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:47,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:45:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:45:47,489 INFO L87 Difference]: Start difference. First operand has 124 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:47,524 INFO L93 Difference]: Finished difference Result 244 states and 355 transitions. [2022-07-13 22:45:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:45:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2022-07-13 22:45:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:47,534 INFO L225 Difference]: With dead ends: 244 [2022-07-13 22:45:47,534 INFO L226 Difference]: Without dead ends: 115 [2022-07-13 22:45:47,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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:45:47,540 INFO L413 NwaCegarLoop]: 165 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, 165 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:45:47,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:45:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-13 22:45:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-13 22:45:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 22:45:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2022-07-13 22:45:47,593 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 79 [2022-07-13 22:45:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:47,593 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2022-07-13 22:45:47,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2022-07-13 22:45:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-13 22:45:47,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:47,597 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:47,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:45:47,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1850978430, now seen corresponding path program 1 times [2022-07-13 22:45:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007618281] [2022-07-13 22:45:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:45:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:45:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:45:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:45:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:45:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:45:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:45:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-13 22:45:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:47,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007618281] [2022-07-13 22:45:47,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007618281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:47,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147008659] [2022-07-13 22:45:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:47,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:47,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:47,943 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:45:47,974 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:45:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 2552 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:45:48,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:45:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 22:45:48,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:45:48,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147008659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:48,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:45:48,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-07-13 22:45:48,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122407428] [2022-07-13 22:45:48,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:48,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:45:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:45:48,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:45:48,574 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:48,796 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-07-13 22:45:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:45:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 81 [2022-07-13 22:45:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:48,800 INFO L225 Difference]: With dead ends: 213 [2022-07-13 22:45:48,800 INFO L226 Difference]: Without dead ends: 118 [2022-07-13 22:45:48,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:45:48,803 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 171 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:48,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 294 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:45:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-13 22:45:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-13 22:45:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (45), 35 states have call predecessors, (45), 35 states have call successors, (45) [2022-07-13 22:45:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2022-07-13 22:45:48,827 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 81 [2022-07-13 22:45:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:48,827 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2022-07-13 22:45:48,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-07-13 22:45:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 22:45:48,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:48,830 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:45:48,863 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:45:49,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:49,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1473940729, now seen corresponding path program 1 times [2022-07-13 22:45:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:49,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449253573] [2022-07-13 22:45:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:45:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:45:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:45:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:45:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:45:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:45:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:45:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:45:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 22:45:49,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449253573] [2022-07-13 22:45:49,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449253573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:49,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121086267] [2022-07-13 22:45:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:49,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:49,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:49,363 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:45:49,365 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:45:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:49,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 2557 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:45:49,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:45:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 22:45:50,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:45:50,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121086267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:50,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:45:50,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-07-13 22:45:50,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352872814] [2022-07-13 22:45:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:50,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:45:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:45:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:45:50,049 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:45:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:50,335 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2022-07-13 22:45:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:45:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 83 [2022-07-13 22:45:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:50,337 INFO L225 Difference]: With dead ends: 208 [2022-07-13 22:45:50,337 INFO L226 Difference]: Without dead ends: 118 [2022-07-13 22:45:50,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:45:50,339 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 189 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:50,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 469 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:45:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-13 22:45:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-13 22:45:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (43), 35 states have call predecessors, (43), 35 states have call successors, (43) [2022-07-13 22:45:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2022-07-13 22:45:50,352 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 83 [2022-07-13 22:45:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:50,353 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2022-07-13 22:45:50,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:45:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-07-13 22:45:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 22:45:50,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:50,355 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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:45:50,383 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:45:50,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 22:45:50,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash -346545804, now seen corresponding path program 2 times [2022-07-13 22:45:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:50,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413574143] [2022-07-13 22:45:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:45:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:45:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:45:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:45:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:45:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:45:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:45:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:45:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 22:45:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413574143] [2022-07-13 22:45:50,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413574143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44344505] [2022-07-13 22:45:50,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:45:50,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:50,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:50,965 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:45:50,993 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:45:51,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:45:51,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:45:51,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 22:45:51,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:45:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-13 22:45:51,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:45:51,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44344505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:51,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:45:51,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-13 22:45:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692134786] [2022-07-13 22:45:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:51,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:45:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:51,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:45:51,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:45:51,608 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:45:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:51,943 INFO L93 Difference]: Finished difference Result 201 states and 281 transitions. [2022-07-13 22:45:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:45:51,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2022-07-13 22:45:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:51,947 INFO L225 Difference]: With dead ends: 201 [2022-07-13 22:45:51,948 INFO L226 Difference]: Without dead ends: 118 [2022-07-13 22:45:51,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:45:51,951 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 196 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:51,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 613 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:45:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-13 22:45:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-13 22:45:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2022-07-13 22:45:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2022-07-13 22:45:51,964 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 85 [2022-07-13 22:45:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:51,965 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2022-07-13 22:45:51,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:45:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2022-07-13 22:45:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 22:45:51,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:51,967 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:45:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:52,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 625417492, now seen corresponding path program 1 times [2022-07-13 22:45:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:52,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661173140] [2022-07-13 22:45:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:45:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:45:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:45:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:45:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:45:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:45:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:45:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 22:45:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:52,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661173140] [2022-07-13 22:45:52,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661173140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:52,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:45:52,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:45:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349974991] [2022-07-13 22:45:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:52,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:45:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:45:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:45:52,552 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:45:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:52,631 INFO L93 Difference]: Finished difference Result 130 states and 185 transitions. [2022-07-13 22:45:52,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:45:52,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2022-07-13 22:45:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:52,634 INFO L225 Difference]: With dead ends: 130 [2022-07-13 22:45:52,634 INFO L226 Difference]: Without dead ends: 128 [2022-07-13 22:45:52,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:45:52,635 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:52,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1057 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:45:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-13 22:45:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-13 22:45:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 81 states have internal predecessors, (90), 38 states have call successors, (38), 9 states have call predecessors, (38), 10 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2022-07-13 22:45:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2022-07-13 22:45:52,654 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 89 [2022-07-13 22:45:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:52,655 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2022-07-13 22:45:52,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:45:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2022-07-13 22:45:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 22:45:52,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:52,660 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:45:52,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:45:52,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 852132828, now seen corresponding path program 1 times [2022-07-13 22:45:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:52,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506269829] [2022-07-13 22:45:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:45:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:45:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:45:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:45:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:45:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:45:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:45:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 22:45:53,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:53,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506269829] [2022-07-13 22:45:53,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506269829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:53,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:45:53,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:45:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367177306] [2022-07-13 22:45:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:53,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:45:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:45:53,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:45:53,062 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:53,486 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2022-07-13 22:45:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:45:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2022-07-13 22:45:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:53,488 INFO L225 Difference]: With dead ends: 225 [2022-07-13 22:45:53,488 INFO L226 Difference]: Without dead ends: 148 [2022-07-13 22:45:53,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:45:53,490 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 36 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:53,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 657 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:45:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-13 22:45:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2022-07-13 22:45:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.170731707317073) internal successors, (96), 86 states have internal predecessors, (96), 41 states have call successors, (41), 9 states have call predecessors, (41), 10 states have return successors, (58), 38 states have call predecessors, (58), 39 states have call successors, (58) [2022-07-13 22:45:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2022-07-13 22:45:53,506 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 93 [2022-07-13 22:45:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:53,506 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2022-07-13 22:45:53,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2022-07-13 22:45:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:45:53,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:53,508 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:45:53,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:45:53,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1211514462, now seen corresponding path program 1 times [2022-07-13 22:45:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:53,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618041191] [2022-07-13 22:45:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:45:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:45:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:45:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:45:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:45:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:45:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:45:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 22:45:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:53,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618041191] [2022-07-13 22:45:53,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618041191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:53,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:45:53,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:45:53,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608560607] [2022-07-13 22:45:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:53,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:45:53,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:53,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:45:53,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:45:53,694 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:53,709 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2022-07-13 22:45:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:45:53,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2022-07-13 22:45:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:53,711 INFO L225 Difference]: With dead ends: 223 [2022-07-13 22:45:53,711 INFO L226 Difference]: Without dead ends: 135 [2022-07-13 22:45:53,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:45:53,712 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:53,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:45:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-13 22:45:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-13 22:45:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 87 states have internal predecessors, (96), 41 states have call successors, (41), 9 states have call predecessors, (41), 10 states have return successors, (58), 38 states have call predecessors, (58), 39 states have call successors, (58) [2022-07-13 22:45:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2022-07-13 22:45:53,724 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 96 [2022-07-13 22:45:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:53,725 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2022-07-13 22:45:53,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:45:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2022-07-13 22:45:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 22:45:53,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:53,726 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:53,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:45:53,726 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash -247569564, now seen corresponding path program 1 times [2022-07-13 22:45:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:53,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197842450] [2022-07-13 22:45:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:53,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:45:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:45:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:45:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:45:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:45:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:45:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:45:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:45:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 22:45:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:54,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197842450] [2022-07-13 22:45:54,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197842450] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:54,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035004205] [2022-07-13 22:45:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:54,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:54,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:54,115 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:45:54,147 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:45:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:54,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 2612 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 22:45:54,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:45:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:45:55,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:45:55,993 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 26 treesize of output 14 [2022-07-13 22:45:56,036 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:45:56,037 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:45:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 22:45:56,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035004205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:45:56,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:45:56,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 24 [2022-07-13 22:45:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389284106] [2022-07-13 22:45:56,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:45:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 22:45:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 22:45:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:45:56,052 INFO L87 Difference]: Start difference. First operand 135 states and 195 transitions. Second operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2022-07-13 22:45:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:58,095 INFO L93 Difference]: Finished difference Result 361 states and 544 transitions. [2022-07-13 22:45:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-13 22:45:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) Word has length 99 [2022-07-13 22:45:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:58,097 INFO L225 Difference]: With dead ends: 361 [2022-07-13 22:45:58,098 INFO L226 Difference]: Without dead ends: 258 [2022-07-13 22:45:58,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 191 SyntacticMatches, 23 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 22:45:58,100 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 133 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:58,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 2413 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1856 Invalid, 0 Unknown, 214 Unchecked, 1.4s Time] [2022-07-13 22:45:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-13 22:45:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 202. [2022-07-13 22:45:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.136) internal successors, (142), 129 states have internal predecessors, (142), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (84), 59 states have call predecessors, (84), 60 states have call successors, (84) [2022-07-13 22:45:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 288 transitions. [2022-07-13 22:45:58,122 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 288 transitions. Word has length 99 [2022-07-13 22:45:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:58,122 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 288 transitions. [2022-07-13 22:45:58,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2022-07-13 22:45:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 288 transitions. [2022-07-13 22:45:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 22:45:58,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:58,124 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:58,151 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:45:58,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:58,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1338258892, now seen corresponding path program 1 times [2022-07-13 22:45:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478517427] [2022-07-13 22:45:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:45:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:45:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:45:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:45:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:45:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:45:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:45:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:45:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:45:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:45:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-13 22:45:58,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:58,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478517427] [2022-07-13 22:45:58,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478517427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:58,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:45:58,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:45:58,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769541392] [2022-07-13 22:45:58,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:58,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:45:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:45:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:45:58,573 INFO L87 Difference]: Start difference. First operand 202 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:45:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:58,624 INFO L93 Difference]: Finished difference Result 280 states and 398 transitions. [2022-07-13 22:45:58,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:45:58,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-07-13 22:45:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:58,627 INFO L225 Difference]: With dead ends: 280 [2022-07-13 22:45:58,627 INFO L226 Difference]: Without dead ends: 202 [2022-07-13 22:45:58,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:45:58,630 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 18 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:58,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 522 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:45:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-13 22:45:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-13 22:45:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.136) internal successors, (142), 129 states have internal predecessors, (142), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (81), 59 states have call predecessors, (81), 60 states have call successors, (81) [2022-07-13 22:45:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 285 transitions. [2022-07-13 22:45:58,655 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 285 transitions. Word has length 105 [2022-07-13 22:45:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:58,655 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 285 transitions. [2022-07-13 22:45:58,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:45:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 285 transitions. [2022-07-13 22:45:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 22:45:58,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:58,658 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:45:58,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:45:58,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:58,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash 762751521, now seen corresponding path program 1 times [2022-07-13 22:45:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:58,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524980923] [2022-07-13 22:45:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:45:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:45:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:45:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:45:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:45:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:45:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:45:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:45:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:45:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-13 22:45:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:58,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524980923] [2022-07-13 22:45:58,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524980923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:45:58,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:45:58,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:45:58,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096387487] [2022-07-13 22:45:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:45:58,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:45:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:45:58,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:45:58,914 INFO L87 Difference]: Start difference. First operand 202 states and 285 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-13 22:45:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:58,989 INFO L93 Difference]: Finished difference Result 210 states and 293 transitions. [2022-07-13 22:45:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:45:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 103 [2022-07-13 22:45:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:58,992 INFO L225 Difference]: With dead ends: 210 [2022-07-13 22:45:58,992 INFO L226 Difference]: Without dead ends: 208 [2022-07-13 22:45:58,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:45:58,993 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 16 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:58,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1065 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:45:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-13 22:45:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2022-07-13 22:45:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 128 states have (on average 1.1328125) internal successors, (145), 132 states have internal predecessors, (145), 63 states have call successors, (63), 14 states have call predecessors, (63), 15 states have return successors, (82), 60 states have call predecessors, (82), 61 states have call successors, (82) [2022-07-13 22:45:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2022-07-13 22:45:59,026 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 103 [2022-07-13 22:45:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:59,026 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2022-07-13 22:45:59,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-13 22:45:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2022-07-13 22:45:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 22:45:59,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:59,029 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:45:59,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:45:59,030 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:59,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash -912199724, now seen corresponding path program 2 times [2022-07-13 22:45:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:59,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567769032] [2022-07-13 22:45:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:45:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:45:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:45:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:45:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:45:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:45:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:45:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:45:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:45:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:45:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:45:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 22:45:59,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:59,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567769032] [2022-07-13 22:45:59,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567769032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:59,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36856354] [2022-07-13 22:45:59,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:45:59,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:59,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:59,336 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:45:59,363 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:46:00,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:46:00,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:46:00,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 2636 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 22:46:00,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:46:00,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:46:01,034 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:46:01,034 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 19 [2022-07-13 22:46:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 22:46:01,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36856354] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:46:01,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:46:01,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 25 [2022-07-13 22:46:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538689663] [2022-07-13 22:46:01,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:46:01,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 22:46:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 22:46:01,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:46:01,047 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2022-07-13 22:46:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:03,031 INFO L93 Difference]: Finished difference Result 400 states and 590 transitions. [2022-07-13 22:46:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 22:46:03,032 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) Word has length 107 [2022-07-13 22:46:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:03,033 INFO L225 Difference]: With dead ends: 400 [2022-07-13 22:46:03,033 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 22:46:03,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=2062, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 22:46:03,035 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:03,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 2334 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2071 Invalid, 0 Unknown, 242 Unchecked, 1.4s Time] [2022-07-13 22:46:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 22:46:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2022-07-13 22:46:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 144 states have internal predecessors, (156), 64 states have call successors, (64), 16 states have call predecessors, (64), 17 states have return successors, (95), 60 states have call predecessors, (95), 62 states have call successors, (95) [2022-07-13 22:46:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2022-07-13 22:46:03,056 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 107 [2022-07-13 22:46:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:03,056 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2022-07-13 22:46:03,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2022-07-13 22:46:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2022-07-13 22:46:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 22:46:03,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:03,059 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:03,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 22:46:03,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 22:46:03,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 411830111, now seen corresponding path program 1 times [2022-07-13 22:46:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325464441] [2022-07-13 22:46:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:46:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:46:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:46:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:46:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:46:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:46:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:46:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:46:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:46:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:46:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-13 22:46:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:03,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325464441] [2022-07-13 22:46:03,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325464441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:03,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107234020] [2022-07-13 22:46:03,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:03,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:03,735 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:46:03,736 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:46:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 2669 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:46:04,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-13 22:46:04,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:04,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107234020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:04,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:04,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-13 22:46:04,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255197451] [2022-07-13 22:46:04,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:04,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:46:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:46:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:46:04,288 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:46:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:04,458 INFO L93 Difference]: Finished difference Result 358 states and 508 transitions. [2022-07-13 22:46:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:46:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2022-07-13 22:46:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:04,461 INFO L225 Difference]: With dead ends: 358 [2022-07-13 22:46:04,461 INFO L226 Difference]: Without dead ends: 221 [2022-07-13 22:46:04,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:46:04,462 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:04,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1119 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:46:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-13 22:46:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-13 22:46:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 144 states have internal predecessors, (156), 64 states have call successors, (64), 16 states have call predecessors, (64), 17 states have return successors, (93), 60 states have call predecessors, (93), 62 states have call successors, (93) [2022-07-13 22:46:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 313 transitions. [2022-07-13 22:46:04,479 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 313 transitions. Word has length 110 [2022-07-13 22:46:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:04,480 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 313 transitions. [2022-07-13 22:46:04,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:46:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 313 transitions. [2022-07-13 22:46:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 22:46:04,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:04,482 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:04,512 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:46:04,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:04,695 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash -712076360, now seen corresponding path program 1 times [2022-07-13 22:46:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:04,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409019289] [2022-07-13 22:46:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:46:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:46:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:46:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:46:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:46:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:46:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:46:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:46:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:46:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:46:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-13 22:46:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:05,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409019289] [2022-07-13 22:46:05,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409019289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:05,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533727801] [2022-07-13 22:46:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:05,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:05,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:05,055 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:46:05,056 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:46:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:05,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 22:46:05,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:05,682 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 27 treesize of output 15 [2022-07-13 22:46:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:46:05,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:05,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533727801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:05,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:05,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2022-07-13 22:46:05,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586608898] [2022-07-13 22:46:05,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:05,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:46:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:46:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:46:05,720 INFO L87 Difference]: Start difference. First operand 221 states and 313 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:46:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:06,318 INFO L93 Difference]: Finished difference Result 400 states and 602 transitions. [2022-07-13 22:46:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:46:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2022-07-13 22:46:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:06,321 INFO L225 Difference]: With dead ends: 400 [2022-07-13 22:46:06,321 INFO L226 Difference]: Without dead ends: 272 [2022-07-13 22:46:06,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:46:06,322 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 110 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:06,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 890 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 436 Invalid, 0 Unknown, 81 Unchecked, 0.5s Time] [2022-07-13 22:46:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-13 22:46:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 225. [2022-07-13 22:46:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 142 states have (on average 1.1126760563380282) internal successors, (158), 147 states have internal predecessors, (158), 64 states have call successors, (64), 17 states have call predecessors, (64), 18 states have return successors, (93), 60 states have call predecessors, (93), 62 states have call successors, (93) [2022-07-13 22:46:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 315 transitions. [2022-07-13 22:46:06,344 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 315 transitions. Word has length 112 [2022-07-13 22:46:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:06,344 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 315 transitions. [2022-07-13 22:46:06,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:46:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 315 transitions. [2022-07-13 22:46:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 22:46:06,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:06,346 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:06,377 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:46:06,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:06,559 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1160869054, now seen corresponding path program 1 times [2022-07-13 22:46:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282628085] [2022-07-13 22:46:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:46:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:46:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:46:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:46:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:46:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:46:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:46:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:46:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:46:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-13 22:46:06,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:06,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282628085] [2022-07-13 22:46:06,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282628085] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875172439] [2022-07-13 22:46:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:06,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:06,823 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:46:06,825 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:46:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:07,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 22:46:07,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:10,028 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 25 treesize of output 17 [2022-07-13 22:46:10,031 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 21 treesize of output 13 [2022-07-13 22:46:10,034 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 18 treesize of output 10 [2022-07-13 22:46:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:46:10,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:10,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875172439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:10,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:10,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 21 [2022-07-13 22:46:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767096706] [2022-07-13 22:46:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:10,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:46:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:46:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:46:10,072 INFO L87 Difference]: Start difference. First operand 225 states and 315 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:46:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:15,248 INFO L93 Difference]: Finished difference Result 442 states and 639 transitions. [2022-07-13 22:46:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:46:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2022-07-13 22:46:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:15,251 INFO L225 Difference]: With dead ends: 442 [2022-07-13 22:46:15,251 INFO L226 Difference]: Without dead ends: 305 [2022-07-13 22:46:15,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=137, Invalid=673, Unknown=2, NotChecked=0, Total=812 [2022-07-13 22:46:15,253 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 117 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:15,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 807 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 727 Invalid, 0 Unknown, 165 Unchecked, 0.7s Time] [2022-07-13 22:46:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-13 22:46:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 262. [2022-07-13 22:46:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 173 states have (on average 1.115606936416185) internal successors, (193), 179 states have internal predecessors, (193), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (95), 62 states have call predecessors, (95), 63 states have call successors, (95) [2022-07-13 22:46:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2022-07-13 22:46:15,276 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 115 [2022-07-13 22:46:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:15,276 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2022-07-13 22:46:15,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:46:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2022-07-13 22:46:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 22:46:15,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:15,280 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:15,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:15,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 22:46:15,496 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1782713024, now seen corresponding path program 1 times [2022-07-13 22:46:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:15,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046203269] [2022-07-13 22:46:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:46:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:46:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:46:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:46:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:46:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:46:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:46:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:46:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:46:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-13 22:46:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:15,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046203269] [2022-07-13 22:46:15,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046203269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606291961] [2022-07-13 22:46:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:15,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:15,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:15,663 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:15,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:46:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 2663 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:46:16,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 22:46:16,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:16,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606291961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:16,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:16,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-13 22:46:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570783562] [2022-07-13 22:46:16,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:16,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:46:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:16,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:46:16,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:46:16,051 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 22:46:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:16,083 INFO L93 Difference]: Finished difference Result 422 states and 601 transitions. [2022-07-13 22:46:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:46:16,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2022-07-13 22:46:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:16,085 INFO L225 Difference]: With dead ends: 422 [2022-07-13 22:46:16,086 INFO L226 Difference]: Without dead ends: 251 [2022-07-13 22:46:16,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:46:16,089 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:16,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 456 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:46:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-13 22:46:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2022-07-13 22:46:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 160 states have (on average 1.10625) internal successors, (177), 166 states have internal predecessors, (177), 63 states have call successors, (63), 18 states have call predecessors, (63), 21 states have return successors, (91), 60 states have call predecessors, (91), 61 states have call successors, (91) [2022-07-13 22:46:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 331 transitions. [2022-07-13 22:46:16,112 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 331 transitions. Word has length 115 [2022-07-13 22:46:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:16,112 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 331 transitions. [2022-07-13 22:46:16,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 22:46:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 331 transitions. [2022-07-13 22:46:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 22:46:16,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:16,114 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:16,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:16,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 22:46:16,339 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash 929000903, now seen corresponding path program 2 times [2022-07-13 22:46:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:16,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009502733] [2022-07-13 22:46:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:46:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:46:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:46:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:46:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:46:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:46:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:46:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:46:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:46:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:46:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-13 22:46:16,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:16,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009502733] [2022-07-13 22:46:16,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009502733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:16,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634809229] [2022-07-13 22:46:16,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:46:16,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:16,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:16,697 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:16,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 22:46:17,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:46:17,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:46:17,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 2701 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 22:46:17,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 114 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 22:46:17,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:46:17,800 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:46:17,800 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:46:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 22:46:17,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634809229] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:46:17,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:46:17,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 18 [2022-07-13 22:46:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113619092] [2022-07-13 22:46:17,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:46:17,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 22:46:17,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:17,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 22:46:17,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:46:17,820 INFO L87 Difference]: Start difference. First operand 245 states and 331 transitions. Second operand has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-13 22:46:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:19,025 INFO L93 Difference]: Finished difference Result 496 states and 702 transitions. [2022-07-13 22:46:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 22:46:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 118 [2022-07-13 22:46:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:19,028 INFO L225 Difference]: With dead ends: 496 [2022-07-13 22:46:19,028 INFO L226 Difference]: Without dead ends: 365 [2022-07-13 22:46:19,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 247 SyntacticMatches, 14 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:46:19,030 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 132 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:19,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1087 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1085 Invalid, 0 Unknown, 230 Unchecked, 0.8s Time] [2022-07-13 22:46:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-13 22:46:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 342. [2022-07-13 22:46:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 225 states have internal predecessors, (243), 95 states have call successors, (95), 24 states have call predecessors, (95), 26 states have return successors, (136), 92 states have call predecessors, (136), 93 states have call successors, (136) [2022-07-13 22:46:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 474 transitions. [2022-07-13 22:46:19,056 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 474 transitions. Word has length 118 [2022-07-13 22:46:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:19,056 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 474 transitions. [2022-07-13 22:46:19,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-13 22:46:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 474 transitions. [2022-07-13 22:46:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 22:46:19,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:19,058 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:19,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:19,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 22:46:19,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash -158853761, now seen corresponding path program 1 times [2022-07-13 22:46:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:19,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072419819] [2022-07-13 22:46:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:46:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:46:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:46:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:46:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:46:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:46:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:46:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:46:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:46:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:46:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-13 22:46:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:19,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072419819] [2022-07-13 22:46:19,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072419819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:19,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493687015] [2022-07-13 22:46:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:19,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:19,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:19,614 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:19,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 22:46:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-13 22:46:20,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:20,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:46:20,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:46:20,244 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 15 treesize of output 7 [2022-07-13 22:46:20,246 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 15 treesize of output 7 [2022-07-13 22:46:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-13 22:46:20,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:20,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493687015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:20,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:20,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-13 22:46:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153587151] [2022-07-13 22:46:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:20,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:46:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:46:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:46:20,263 INFO L87 Difference]: Start difference. First operand 342 states and 474 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:46:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:20,470 INFO L93 Difference]: Finished difference Result 644 states and 948 transitions. [2022-07-13 22:46:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:46:20,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 122 [2022-07-13 22:46:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:20,473 INFO L225 Difference]: With dead ends: 644 [2022-07-13 22:46:20,473 INFO L226 Difference]: Without dead ends: 428 [2022-07-13 22:46:20,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:46:20,476 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 91 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:20,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 811 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 118 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-07-13 22:46:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-13 22:46:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 352. [2022-07-13 22:46:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 228 states have (on average 1.1008771929824561) internal successors, (251), 234 states have internal predecessors, (251), 96 states have call successors, (96), 25 states have call predecessors, (96), 27 states have return successors, (137), 92 states have call predecessors, (137), 94 states have call successors, (137) [2022-07-13 22:46:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 484 transitions. [2022-07-13 22:46:20,509 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 484 transitions. Word has length 122 [2022-07-13 22:46:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:20,510 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 484 transitions. [2022-07-13 22:46:20,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:46:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2022-07-13 22:46:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-13 22:46:20,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:20,512 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:20,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:20,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 22:46:20,727 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1460715489, now seen corresponding path program 1 times [2022-07-13 22:46:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:20,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382088024] [2022-07-13 22:46:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 22:46:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:46:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:46:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:46:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:46:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:46:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:46:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:46:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:46:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:46:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:46:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:46:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-13 22:46:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382088024] [2022-07-13 22:46:21,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382088024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073473647] [2022-07-13 22:46:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:21,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:21,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:21,072 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:21,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 22:46:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:21,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 2750 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:46:21,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:46:21,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:21,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073473647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:21,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:21,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-13 22:46:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873873179] [2022-07-13 22:46:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:21,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:46:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:46:21,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:46:21,587 INFO L87 Difference]: Start difference. First operand 352 states and 484 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:46:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:21,738 INFO L93 Difference]: Finished difference Result 530 states and 729 transitions. [2022-07-13 22:46:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:46:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2022-07-13 22:46:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:21,741 INFO L225 Difference]: With dead ends: 530 [2022-07-13 22:46:21,741 INFO L226 Difference]: Without dead ends: 329 [2022-07-13 22:46:21,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:46:21,742 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:21,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1128 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:46:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-13 22:46:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2022-07-13 22:46:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 207 states have (on average 1.1014492753623188) internal successors, (228), 213 states have internal predecessors, (228), 84 states have call successors, (84), 24 states have call predecessors, (84), 25 states have return successors, (119), 79 states have call predecessors, (119), 82 states have call successors, (119) [2022-07-13 22:46:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-13 22:46:21,769 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 133 [2022-07-13 22:46:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:21,770 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-13 22:46:21,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:46:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-13 22:46:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 22:46:21,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:21,772 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:21,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:21,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 22:46:21,999 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1001276614, now seen corresponding path program 2 times [2022-07-13 22:46:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:21,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571256820] [2022-07-13 22:46:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:21,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 22:46:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:46:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:46:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:46:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:46:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:46:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:46:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:46:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:46:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:46:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:46:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:46:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-13 22:46:22,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:22,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571256820] [2022-07-13 22:46:22,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571256820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:22,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:46:22,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-13 22:46:22,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53290129] [2022-07-13 22:46:22,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:22,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 22:46:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:22,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 22:46:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:46:22,811 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 22:46:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:24,394 INFO L93 Difference]: Finished difference Result 533 states and 802 transitions. [2022-07-13 22:46:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 22:46:24,395 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Word has length 135 [2022-07-13 22:46:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:24,399 INFO L225 Difference]: With dead ends: 533 [2022-07-13 22:46:24,399 INFO L226 Difference]: Without dead ends: 444 [2022-07-13 22:46:24,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:46:24,401 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 166 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:24,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 911 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 22:46:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-13 22:46:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 427. [2022-07-13 22:46:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 265 states have (on average 1.0981132075471698) internal successors, (291), 274 states have internal predecessors, (291), 131 states have call successors, (131), 26 states have call predecessors, (131), 30 states have return successors, (213), 126 states have call predecessors, (213), 129 states have call successors, (213) [2022-07-13 22:46:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 635 transitions. [2022-07-13 22:46:24,455 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 635 transitions. Word has length 135 [2022-07-13 22:46:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:24,457 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 635 transitions. [2022-07-13 22:46:24,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 22:46:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 635 transitions. [2022-07-13 22:46:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 22:46:24,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:24,465 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 22:46:24,466 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:24,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -743111176, now seen corresponding path program 1 times [2022-07-13 22:46:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:24,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172962670] [2022-07-13 22:46:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 22:46:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:46:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:46:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:46:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:46:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:46:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:46:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:46:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:46:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:46:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:46:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:46:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-13 22:46:24,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:24,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172962670] [2022-07-13 22:46:24,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172962670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:24,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:46:24,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:46:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113488318] [2022-07-13 22:46:24,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:24,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:46:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:46:24,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:46:24,754 INFO L87 Difference]: Start difference. First operand 427 states and 635 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:46:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:25,055 INFO L93 Difference]: Finished difference Result 593 states and 924 transitions. [2022-07-13 22:46:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:46:25,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2022-07-13 22:46:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:25,058 INFO L225 Difference]: With dead ends: 593 [2022-07-13 22:46:25,058 INFO L226 Difference]: Without dead ends: 418 [2022-07-13 22:46:25,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:46:25,060 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 44 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:25,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 329 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:46:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-13 22:46:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-07-13 22:46:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 257 states have (on average 1.093385214007782) internal successors, (281), 265 states have internal predecessors, (281), 131 states have call successors, (131), 26 states have call predecessors, (131), 29 states have return successors, (192), 126 states have call predecessors, (192), 129 states have call successors, (192) [2022-07-13 22:46:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 604 transitions. [2022-07-13 22:46:25,105 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 604 transitions. Word has length 135 [2022-07-13 22:46:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:25,106 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 604 transitions. [2022-07-13 22:46:25,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:46:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 604 transitions. [2022-07-13 22:46:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 22:46:25,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:25,110 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:25,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 22:46:25,110 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:25,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:25,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2134105364, now seen corresponding path program 1 times [2022-07-13 22:46:25,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:25,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068516805] [2022-07-13 22:46:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:46:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:46:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:46:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:46:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:46:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:46:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:46:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:46:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:46:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:46:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:46:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:46:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:46:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:46:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-13 22:46:25,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:25,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068516805] [2022-07-13 22:46:25,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068516805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:25,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611005993] [2022-07-13 22:46:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:25,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:25,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:25,358 INFO L229 MonitoredProcess]: Starting monitored process 14 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:46:25,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 22:46:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:25,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:46:25,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 94 proven. 84 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-13 22:46:25,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:46:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-13 22:46:26,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611005993] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:46:26,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:46:26,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-07-13 22:46:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94687003] [2022-07-13 22:46:26,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:46:26,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:46:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:46:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:46:26,032 INFO L87 Difference]: Start difference. First operand 418 states and 604 transitions. Second operand has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) [2022-07-13 22:46:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:26,522 INFO L93 Difference]: Finished difference Result 560 states and 829 transitions. [2022-07-13 22:46:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:46:26,523 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) Word has length 139 [2022-07-13 22:46:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:26,525 INFO L225 Difference]: With dead ends: 560 [2022-07-13 22:46:26,526 INFO L226 Difference]: Without dead ends: 418 [2022-07-13 22:46:26,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:46:26,528 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 212 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:26,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 388 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:46:26,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-13 22:46:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-07-13 22:46:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 257 states have (on average 1.093385214007782) internal successors, (281), 265 states have internal predecessors, (281), 131 states have call successors, (131), 26 states have call predecessors, (131), 29 states have return successors, (184), 126 states have call predecessors, (184), 129 states have call successors, (184) [2022-07-13 22:46:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 596 transitions. [2022-07-13 22:46:26,574 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 596 transitions. Word has length 139 [2022-07-13 22:46:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:26,574 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 596 transitions. [2022-07-13 22:46:26,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) [2022-07-13 22:46:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 596 transitions. [2022-07-13 22:46:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 22:46:26,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:26,577 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:26,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:26,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 22:46:26,803 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1988577793, now seen corresponding path program 1 times [2022-07-13 22:46:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:26,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540388776] [2022-07-13 22:46:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 22:46:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:46:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:46:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:46:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:46:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:46:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:46:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:46:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:46:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:46:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:46:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:46:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-13 22:46:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540388776] [2022-07-13 22:46:27,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540388776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:27,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:46:27,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:46:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329369752] [2022-07-13 22:46:27,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:27,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:46:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:27,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:46:27,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:46:27,129 INFO L87 Difference]: Start difference. First operand 418 states and 596 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:46:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:27,972 INFO L93 Difference]: Finished difference Result 426 states and 604 transitions. [2022-07-13 22:46:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:46:27,973 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2022-07-13 22:46:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:27,976 INFO L225 Difference]: With dead ends: 426 [2022-07-13 22:46:27,976 INFO L226 Difference]: Without dead ends: 424 [2022-07-13 22:46:27,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:46:27,977 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:27,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 997 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:46:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-07-13 22:46:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 423. [2022-07-13 22:46:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 260 states have (on average 1.0923076923076922) internal successors, (284), 268 states have internal predecessors, (284), 132 states have call successors, (132), 27 states have call predecessors, (132), 30 states have return successors, (185), 127 states have call predecessors, (185), 130 states have call successors, (185) [2022-07-13 22:46:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 601 transitions. [2022-07-13 22:46:28,024 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 601 transitions. Word has length 137 [2022-07-13 22:46:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:28,024 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 601 transitions. [2022-07-13 22:46:28,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:46:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 601 transitions. [2022-07-13 22:46:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 22:46:28,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:28,027 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:28,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 22:46:28,027 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash -32643708, now seen corresponding path program 1 times [2022-07-13 22:46:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:28,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860514184] [2022-07-13 22:46:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:46:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 22:46:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:46:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:46:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:46:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:46:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:46:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:46:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:46:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:46:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:46:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:46:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:46:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-13 22:46:29,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:29,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860514184] [2022-07-13 22:46:29,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860514184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:29,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781584079] [2022-07-13 22:46:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:29,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:29,088 INFO L229 MonitoredProcess]: Starting monitored process 15 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:46:29,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 22:46:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:29,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-13 22:46:29,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:29,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:46:29,679 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 22:46:29,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 22:46:29,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:46:30,053 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-13 22:46:30,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-13 22:46:30,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 22:46:34,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 22:47:02,682 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:47:02,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-13 22:47:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 22:47:03,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:47:03,746 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:47:03,746 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 19 treesize of output 18 [2022-07-13 22:47:03,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (or (and (= c_aws_byte_cursor_left_trim_pred_~source.base |aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_aws_byte_cursor_left_trim_pred_~source.offset |c_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (forall ((v_ArrVal_999 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |aws_byte_cursor_left_trim_pred_~#trimmed~1.base| v_ArrVal_999) c_aws_byte_cursor_left_trim_pred_~source.base) (+ c_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0))))) is different from false [2022-07-13 22:47:03,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781584079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:47:03,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:47:03,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 39 [2022-07-13 22:47:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359075764] [2022-07-13 22:47:03,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:47:03,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 22:47:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:03,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 22:47:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2057, Unknown=3, NotChecked=92, Total=2352 [2022-07-13 22:47:03,838 INFO L87 Difference]: Start difference. First operand 423 states and 601 transitions. Second operand has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 33 states have internal predecessors, (123), 13 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-13 22:47:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:07,483 INFO L93 Difference]: Finished difference Result 629 states and 852 transitions. [2022-07-13 22:47:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-13 22:47:07,484 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 33 states have internal predecessors, (123), 13 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) Word has length 138 [2022-07-13 22:47:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:07,487 INFO L225 Difference]: With dead ends: 629 [2022-07-13 22:47:07,487 INFO L226 Difference]: Without dead ends: 512 [2022-07-13 22:47:07,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 149 SyntacticMatches, 22 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=444, Invalid=5256, Unknown=4, NotChecked=148, Total=5852 [2022-07-13 22:47:07,490 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 108 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 3127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1436 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:07,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1451 Invalid, 3127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1629 Invalid, 0 Unknown, 1436 Unchecked, 0.9s Time] [2022-07-13 22:47:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-07-13 22:47:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 493. [2022-07-13 22:47:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 320 states have (on average 1.090625) internal successors, (349), 327 states have internal predecessors, (349), 132 states have call successors, (132), 39 states have call predecessors, (132), 40 states have return successors, (185), 126 states have call predecessors, (185), 130 states have call successors, (185) [2022-07-13 22:47:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 666 transitions. [2022-07-13 22:47:07,540 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 666 transitions. Word has length 138 [2022-07-13 22:47:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:07,541 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 666 transitions. [2022-07-13 22:47:07,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 33 states have internal predecessors, (123), 13 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-13 22:47:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 666 transitions. [2022-07-13 22:47:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-13 22:47:07,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:07,544 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 22:47:07,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:47:07,759 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 121582132, now seen corresponding path program 1 times [2022-07-13 22:47:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:07,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735337100] [2022-07-13 22:47:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:47:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:47:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:47:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:47:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:47:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:47:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:47:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:47:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:47:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-13 22:47:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:08,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735337100] [2022-07-13 22:47:08,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735337100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:47:08,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:47:08,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:47:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648200658] [2022-07-13 22:47:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:47:08,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:47:08,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:08,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:47:08,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:47:08,057 INFO L87 Difference]: Start difference. First operand 493 states and 666 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:47:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:08,539 INFO L93 Difference]: Finished difference Result 507 states and 683 transitions. [2022-07-13 22:47:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:47:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2022-07-13 22:47:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:08,542 INFO L225 Difference]: With dead ends: 507 [2022-07-13 22:47:08,542 INFO L226 Difference]: Without dead ends: 505 [2022-07-13 22:47:08,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:47:08,543 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 50 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:08,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 654 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:47:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-13 22:47:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501. [2022-07-13 22:47:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 323 states have (on average 1.089783281733746) internal successors, (352), 330 states have internal predecessors, (352), 136 states have call successors, (136), 40 states have call predecessors, (136), 41 states have return successors, (189), 130 states have call predecessors, (189), 134 states have call successors, (189) [2022-07-13 22:47:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 677 transitions. [2022-07-13 22:47:08,590 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 677 transitions. Word has length 143 [2022-07-13 22:47:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:08,591 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 677 transitions. [2022-07-13 22:47:08,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:47:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 677 transitions. [2022-07-13 22:47:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 22:47:08,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:08,593 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:08,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 22:47:08,594 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash 386312444, now seen corresponding path program 1 times [2022-07-13 22:47:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:08,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734099047] [2022-07-13 22:47:08,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:47:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:47:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:47:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:47:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:47:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:47:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:47:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:47:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:47:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-13 22:47:08,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:08,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734099047] [2022-07-13 22:47:08,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734099047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:47:08,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:47:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:47:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797324370] [2022-07-13 22:47:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:47:08,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:47:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:47:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:47:08,996 INFO L87 Difference]: Start difference. First operand 501 states and 677 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 22:47:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:10,163 INFO L93 Difference]: Finished difference Result 719 states and 1040 transitions. [2022-07-13 22:47:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:47:10,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2022-07-13 22:47:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:10,167 INFO L225 Difference]: With dead ends: 719 [2022-07-13 22:47:10,167 INFO L226 Difference]: Without dead ends: 563 [2022-07-13 22:47:10,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:47:10,168 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 69 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:10,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 627 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 22:47:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-07-13 22:47:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 535. [2022-07-13 22:47:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 342 states have (on average 1.0964912280701755) internal successors, (375), 349 states have internal predecessors, (375), 149 states have call successors, (149), 40 states have call predecessors, (149), 43 states have return successors, (196), 145 states have call predecessors, (196), 147 states have call successors, (196) [2022-07-13 22:47:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 720 transitions. [2022-07-13 22:47:10,238 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 720 transitions. Word has length 147 [2022-07-13 22:47:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:10,238 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 720 transitions. [2022-07-13 22:47:10,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 22:47:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 720 transitions. [2022-07-13 22:47:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-13 22:47:10,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:10,241 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 22:47:10,241 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash 542080828, now seen corresponding path program 1 times [2022-07-13 22:47:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:10,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623361253] [2022-07-13 22:47:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:10,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:47:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:47:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:47:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:47:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:47:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:47:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:47:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:47:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:47:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2022-07-13 22:47:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:10,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623361253] [2022-07-13 22:47:10,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623361253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:47:10,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:47:10,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:47:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278391542] [2022-07-13 22:47:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:47:10,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:47:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:10,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:47:10,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:47:10,443 INFO L87 Difference]: Start difference. First operand 535 states and 720 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-13 22:47:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:10,714 INFO L93 Difference]: Finished difference Result 611 states and 830 transitions. [2022-07-13 22:47:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:47:10,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2022-07-13 22:47:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:10,717 INFO L225 Difference]: With dead ends: 611 [2022-07-13 22:47:10,717 INFO L226 Difference]: Without dead ends: 541 [2022-07-13 22:47:10,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:47:10,719 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 34 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:10,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 238 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:47:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-13 22:47:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2022-07-13 22:47:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 348 states have (on average 1.0948275862068966) internal successors, (381), 355 states have internal predecessors, (381), 149 states have call successors, (149), 40 states have call predecessors, (149), 43 states have return successors, (196), 145 states have call predecessors, (196), 147 states have call successors, (196) [2022-07-13 22:47:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 726 transitions. [2022-07-13 22:47:10,786 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 726 transitions. Word has length 150 [2022-07-13 22:47:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:10,786 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 726 transitions. [2022-07-13 22:47:10,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-13 22:47:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 726 transitions. [2022-07-13 22:47:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-13 22:47:10,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:10,789 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 22:47:10,789 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1517452615, now seen corresponding path program 1 times [2022-07-13 22:47:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:10,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286309136] [2022-07-13 22:47:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:10,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 22:47:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:47:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:47:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:47:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:47:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:47:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:47:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:47:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:47:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:47:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:47:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:47:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:47:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:47:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 38 proven. 21 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-13 22:47:11,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:11,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286309136] [2022-07-13 22:47:11,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286309136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:47:11,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130868560] [2022-07-13 22:47:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:11,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:47:11,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:47:11,152 INFO L229 MonitoredProcess]: Starting monitored process 16 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:47:11,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 22:47:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:11,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 2792 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-13 22:47:11,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:47:11,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:47:11,816 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 22:47:11,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 22:47:12,056 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:47:12,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 22:47:12,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-13 22:47:14,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-13 22:47:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 80 proven. 77 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:47:30,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:47:31,206 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_1164) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616))))) is different from false [2022-07-13 22:47:31,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130868560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:47:31,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:47:31,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 28 [2022-07-13 22:47:31,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538743114] [2022-07-13 22:47:31,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:47:31,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 22:47:31,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:31,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 22:47:31,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=884, Unknown=2, NotChecked=60, Total=1056 [2022-07-13 22:47:31,214 INFO L87 Difference]: Start difference. First operand 541 states and 726 transitions. Second operand has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 25 states have internal predecessors, (150), 9 states have call successors, (37), 8 states have call predecessors, (37), 10 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-07-13 22:47:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:34,349 INFO L93 Difference]: Finished difference Result 819 states and 1106 transitions. [2022-07-13 22:47:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 22:47:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 25 states have internal predecessors, (150), 9 states have call successors, (37), 8 states have call predecessors, (37), 10 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 149 [2022-07-13 22:47:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:34,352 INFO L225 Difference]: With dead ends: 819 [2022-07-13 22:47:34,352 INFO L226 Difference]: Without dead ends: 581 [2022-07-13 22:47:34,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 237 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=270, Invalid=2282, Unknown=2, NotChecked=98, Total=2652 [2022-07-13 22:47:34,354 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 563 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:34,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1018 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 747 Invalid, 0 Unknown, 563 Unchecked, 0.6s Time] [2022-07-13 22:47:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-07-13 22:47:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 532. [2022-07-13 22:47:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 352 states have (on average 1.09375) internal successors, (385), 359 states have internal predecessors, (385), 134 states have call successors, (134), 41 states have call predecessors, (134), 45 states have return successors, (177), 131 states have call predecessors, (177), 132 states have call successors, (177) [2022-07-13 22:47:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 696 transitions. [2022-07-13 22:47:34,415 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 696 transitions. Word has length 149 [2022-07-13 22:47:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:34,415 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 696 transitions. [2022-07-13 22:47:34,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 25 states have internal predecessors, (150), 9 states have call successors, (37), 8 states have call predecessors, (37), 10 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-07-13 22:47:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 696 transitions. [2022-07-13 22:47:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-13 22:47:34,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:34,418 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 22:47:34,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 22:47:34,634 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:34,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1095383274, now seen corresponding path program 1 times [2022-07-13 22:47:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:34,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703931481] [2022-07-13 22:47:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:47:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:47:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:47:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:47:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:47:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:47:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:47:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:47:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:47:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:47:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:47:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-07-13 22:47:34,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703931481] [2022-07-13 22:47:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703931481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:47:34,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:47:34,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:47:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886460113] [2022-07-13 22:47:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:47:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:47:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:34,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:47:34,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:47:34,848 INFO L87 Difference]: Start difference. First operand 532 states and 696 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:47:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:35,204 INFO L93 Difference]: Finished difference Result 614 states and 807 transitions. [2022-07-13 22:47:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:47:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2022-07-13 22:47:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:35,208 INFO L225 Difference]: With dead ends: 614 [2022-07-13 22:47:35,208 INFO L226 Difference]: Without dead ends: 532 [2022-07-13 22:47:35,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:47:35,209 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:35,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 367 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:47:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-13 22:47:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2022-07-13 22:47:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 352 states have (on average 1.09375) internal successors, (385), 359 states have internal predecessors, (385), 134 states have call successors, (134), 41 states have call predecessors, (134), 45 states have return successors, (173), 131 states have call predecessors, (173), 132 states have call successors, (173) [2022-07-13 22:47:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 692 transitions. [2022-07-13 22:47:35,263 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 692 transitions. Word has length 155 [2022-07-13 22:47:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:35,264 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 692 transitions. [2022-07-13 22:47:35,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:47:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 692 transitions. [2022-07-13 22:47:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 22:47:35,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:35,266 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:47:35,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 22:47:35,267 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -38056338, now seen corresponding path program 1 times [2022-07-13 22:47:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:35,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484856020] [2022-07-13 22:47:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:47:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:47:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:47:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:47:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:47:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:47:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:47:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:47:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:47:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:47:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-13 22:47:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:35,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484856020] [2022-07-13 22:47:35,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484856020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:47:35,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:47:35,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:47:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698650184] [2022-07-13 22:47:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:47:35,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:47:35,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:35,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:47:35,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:47:35,591 INFO L87 Difference]: Start difference. First operand 532 states and 692 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-13 22:47:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:36,386 INFO L93 Difference]: Finished difference Result 674 states and 918 transitions. [2022-07-13 22:47:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:47:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2022-07-13 22:47:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:36,389 INFO L225 Difference]: With dead ends: 674 [2022-07-13 22:47:36,389 INFO L226 Difference]: Without dead ends: 548 [2022-07-13 22:47:36,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:47:36,391 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 53 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:36,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 486 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:47:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-13 22:47:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 520. [2022-07-13 22:47:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 344 states have (on average 1.072674418604651) internal successors, (369), 351 states have internal predecessors, (369), 130 states have call successors, (130), 41 states have call predecessors, (130), 45 states have return successors, (169), 127 states have call predecessors, (169), 128 states have call successors, (169) [2022-07-13 22:47:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2022-07-13 22:47:36,441 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 156 [2022-07-13 22:47:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:36,442 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2022-07-13 22:47:36,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-13 22:47:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2022-07-13 22:47:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 22:47:36,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:36,444 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 22:47:36,445 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:36,445 INFO L85 PathProgramCache]: Analyzing trace with hash -23336005, now seen corresponding path program 1 times [2022-07-13 22:47:36,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:36,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651012446] [2022-07-13 22:47:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:47:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:47:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:47:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:47:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:47:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:47:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 22:47:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:47:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:47:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:47:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:47:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:47:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:47:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:47:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-07-13 22:47:36,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:36,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651012446] [2022-07-13 22:47:36,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651012446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:47:36,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:47:36,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:47:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191217136] [2022-07-13 22:47:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:47:36,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:47:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:47:36,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:47:36,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:47:36,716 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-13 22:47:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:47:37,192 INFO L93 Difference]: Finished difference Result 534 states and 685 transitions. [2022-07-13 22:47:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:47:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2022-07-13 22:47:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:47:37,195 INFO L225 Difference]: With dead ends: 534 [2022-07-13 22:47:37,195 INFO L226 Difference]: Without dead ends: 532 [2022-07-13 22:47:37,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:47:37,196 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 50 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:47:37,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 653 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:47:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-13 22:47:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2022-07-13 22:47:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 347 states have (on average 1.0720461095100864) internal successors, (372), 354 states have internal predecessors, (372), 134 states have call successors, (134), 42 states have call predecessors, (134), 46 states have return successors, (173), 131 states have call predecessors, (173), 132 states have call successors, (173) [2022-07-13 22:47:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 679 transitions. [2022-07-13 22:47:37,250 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 679 transitions. Word has length 157 [2022-07-13 22:47:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:47:37,250 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 679 transitions. [2022-07-13 22:47:37,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-13 22:47:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 679 transitions. [2022-07-13 22:47:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-13 22:47:37,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:47:37,253 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:47:37,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 22:47:37,253 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:47:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:47:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1886376426, now seen corresponding path program 1 times [2022-07-13 22:47:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:47:37,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350917630] [2022-07-13 22:47:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:47:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:47:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:47:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 22:47:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:47:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:47:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:47:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:47:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:47:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:47:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:47:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:47:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:47:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:47:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:47:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:47:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:47:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:47:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 56 proven. 19 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-07-13 22:47:38,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:47:38,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350917630] [2022-07-13 22:47:38,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350917630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:47:38,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025466032] [2022-07-13 22:47:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:47:38,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:47:38,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:47:38,343 INFO L229 MonitoredProcess]: Starting monitored process 17 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:47:38,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 22:47:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:47:39,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 22:47:39,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:47:41,194 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_32|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_27|)) 0)))) is different from true [2022-07-13 22:47:43,253 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_33|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_28|)) 0)))) is different from true [2022-07-13 22:47:45,373 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_34) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_29)) 0)))) is different from true [2022-07-13 22:47:50,303 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_35) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_30)) 0)))) is different from true [2022-07-13 22:47:52,957 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_36) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_31)) 0)))) is different from true [2022-07-13 22:47:54,136 WARN L855 $PredicateComparison]: unable to prove that (exists ((aws_byte_cursor_left_trim_pred_~source.base Int) (|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1| Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_32 Int)) (let ((.cse2 (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse2))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1|) 8) .cse0) (or (not (= .cse0 0)) (not (= .cse1 0))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_1|) 8)))))) is different from true [2022-07-13 22:47:57,067 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2| Int) (aws_byte_cursor_left_trim_pred_~source.base Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_33 Int)) (let ((.cse2 (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_33))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse2)) (.cse0 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse2))) (and (or (not (= .cse0 0)) (not (= .cse1 0))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2|) 8)) (= (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_2|) 8) .cse0))))) is different from true [2022-07-13 22:47:59,941 WARN L855 $PredicateComparison]: unable to prove that (exists ((aws_byte_cursor_left_trim_pred_~source.base Int) (|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3| Int) (aws_byte_cursor_left_trim_pred_~source.offset Int)) (let ((.cse2 (+ aws_byte_cursor_left_trim_pred_~source.offset 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse2)) (.cse0 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse2))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3|) 8)) (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_3|) 8) .cse1) (or (not (= 0 .cse1)) (not (= .cse0 0))))))) is different from true [2022-07-13 22:48:04,589 WARN L855 $PredicateComparison]: unable to prove that (exists ((aws_byte_cursor_left_trim_pred_~source.base Int) (|v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4| Int) (aws_byte_cursor_left_trim_pred_~source.offset Int)) (let ((.cse2 (+ aws_byte_cursor_left_trim_pred_~source.offset 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| aws_byte_cursor_left_trim_pred_~source.base) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| aws_byte_cursor_left_trim_pred_~source.base) .cse2))) (and (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4|) 8) .cse0) (= .cse1 (select (select |c_#memory_$Pointer$.offset| |v_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_BEFORE_CALL_4|) 8)) (or (not (= 0 .cse0)) (not (= .cse1 0))))))) is different from true [2022-07-13 22:48:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 121 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 83 not checked. [2022-07-13 22:48:13,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:48:13,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025466032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:13,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:48:13,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 38 [2022-07-13 22:48:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069433844] [2022-07-13 22:48:13,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:48:13,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 22:48:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 22:48:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=897, Unknown=12, NotChecked=612, Total=1640 [2022-07-13 22:48:13,284 INFO L87 Difference]: Start difference. First operand 528 states and 679 transitions. Second operand has 38 states, 37 states have (on average 4.027027027027027) internal successors, (149), 34 states have internal predecessors, (149), 12 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2022-07-13 22:48:36,033 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)