./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_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_compare_lexical_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 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:41:39,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:41:39,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:41:39,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:41:39,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:41:39,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:41:39,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:41:39,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:41:39,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:41:39,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:41:39,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:41:39,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:41:39,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:41:39,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:41:39,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:41:39,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:41:39,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:41:39,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:41:39,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:41:39,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:41:39,963 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:41:39,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:41:39,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:41:39,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:41:39,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:41:39,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:41:39,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:41:39,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:41:39,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:41:39,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:41:39,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:41:39,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:41:39,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:41:39,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:41:39,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:41:39,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:41:39,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:41:39,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:41:39,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:41:39,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:41:39,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:41:39,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:41:39,976 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:41:39,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:41:39,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:41:39,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:41:39,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:41:39,989 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:41:39,989 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:41:39,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:41:39,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:41:39,990 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:41:39,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:41:39,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:41:39,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:41:39,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:41:39,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:41:39,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:41:39,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:41:39,991 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:41:39,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:41:39,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:41:39,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:41:39,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:41:39,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:41:39,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:41:39,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:41:39,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:41:39,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:41:39,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:41:39,993 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:41:39,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:41:39,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:41:39,993 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 -> 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 [2022-07-13 22:41:40,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:41:40,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:41:40,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:41:40,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:41:40,156 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:41:40,157 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_compare_lexical_harness.i [2022-07-13 22:41:40,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912224c0e/784d8cc949224c2eb1cecfe40f739977/FLAGf84381da0 [2022-07-13 22:41:40,781 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:41:40,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-07-13 22:41:40,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912224c0e/784d8cc949224c2eb1cecfe40f739977/FLAGf84381da0 [2022-07-13 22:41:41,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912224c0e/784d8cc949224c2eb1cecfe40f739977 [2022-07-13 22:41:41,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:41:41,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:41:41,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:41:41,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:41:41,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:41:41,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:41:41" (1/1) ... [2022-07-13 22:41:41,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d254abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:41, skipping insertion in model container [2022-07-13 22:41:41,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:41:41" (1/1) ... [2022-07-13 22:41:41,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:41:41,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:41:41,557 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_compare_lexical_harness.i[4505,4518] [2022-07-13 22:41:41,564 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_compare_lexical_harness.i[4565,4578] [2022-07-13 22:41:42,007 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,009 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,010 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,012 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,022 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,024 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,025 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,026 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,195 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:41:42,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:41:42,197 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:41:42,198 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:41:42,201 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:41:42,203 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:41:42,203 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:41:42,204 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:41:42,206 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:41:42,207 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:41:42,285 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:41:42,326 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,326 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:41:42,412 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:41:42,420 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_compare_lexical_harness.i[4505,4518] [2022-07-13 22:41:42,421 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_compare_lexical_harness.i[4565,4578] [2022-07-13 22:41:42,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,471 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,471 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,474 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,474 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,475 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,475 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,492 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:41:42,493 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:41:42,493 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:41:42,494 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:41:42,494 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:41:42,495 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:41:42,495 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:41:42,495 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:41:42,495 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:41:42,496 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:41:42,507 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:41:42,554 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,554 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:42,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:41:42,729 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:41:42,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42 WrapperNode [2022-07-13 22:41:42,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:41:42,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:41:42,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:41:42,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:41:42,736 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:41:42" (1/1) ... [2022-07-13 22:41:42,824 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:41:42" (1/1) ... [2022-07-13 22:41:42,877 INFO L137 Inliner]: procedures = 691, calls = 2656, calls flagged for inlining = 59, calls inlined = 6, statements flattened = 925 [2022-07-13 22:41:42,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:41:42,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:41:42,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:41:42,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:41:42,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:41:42,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:41:42,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:41:42,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:41:42,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:41:42,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:43,011 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:41:43,018 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:41:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-13 22:41:43,037 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-13 22:41:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lexical [2022-07-13 22:41:43,038 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lexical [2022-07-13 22:41:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 22:41:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:41:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:41:43,038 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:41:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:41:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-13 22:41:43,038 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-13 22:41:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:41:43,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:41:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:41:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:41:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-13 22:41:43,039 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-13 22:41:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:41:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:41:43,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:41:43,040 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:41:43,040 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:41:43,040 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-13 22:41:43,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-13 22:41:43,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:41:43,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:41:43,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:41:43,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:41:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:41:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:41:43,041 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:41:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:41:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-13 22:41:43,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-13 22:41:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:41:43,193 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:41:43,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:41:43,980 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:41:43,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:41:43,988 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:41:43,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:41:43 BoogieIcfgContainer [2022-07-13 22:41:43,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:41:43,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:41:43,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:41:43,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:41:43,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:41:41" (1/3) ... [2022-07-13 22:41:43,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2788c7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:41:43, skipping insertion in model container [2022-07-13 22:41:43,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42" (2/3) ... [2022-07-13 22:41:43,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2788c7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:41:43, skipping insertion in model container [2022-07-13 22:41:43,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:41:43" (3/3) ... [2022-07-13 22:41:43,997 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lexical_harness.i [2022-07-13 22:41:44,008 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:41:44,009 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:41:44,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:41:44,066 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@15feaa2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20c61262 [2022-07-13 22:41:44,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:41:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 22:41:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 22:41:44,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:44,083 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 22:41:44,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash 616113637, now seen corresponding path program 1 times [2022-07-13 22:41:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:44,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636666177] [2022-07-13 22:41:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:44,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:41:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:41:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:41:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:41:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:41:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:41:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:41:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:41:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:41:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:41:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:41:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:41:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:41:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:41:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-13 22:41:44,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:44,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636666177] [2022-07-13 22:41:44,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636666177] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:44,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108160034] [2022-07-13 22:41:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:44,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:44,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:44,684 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:41:44,728 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:41:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:41:45,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-13 22:41:45,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:45,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108160034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:45,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:45,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-13 22:41:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065426281] [2022-07-13 22:41:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:45,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:41:45,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:41:45,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:41:45,317 INFO L87 Difference]: Start difference. First operand has 151 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 22:41:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:45,493 INFO L93 Difference]: Finished difference Result 301 states and 447 transitions. [2022-07-13 22:41:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:41:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 120 [2022-07-13 22:41:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:45,501 INFO L225 Difference]: With dead ends: 301 [2022-07-13 22:41:45,501 INFO L226 Difference]: Without dead ends: 148 [2022-07-13 22:41:45,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:41:45,506 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 222 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:45,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 422 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:41:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-13 22:41:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-13 22:41:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2022-07-13 22:41:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 204 transitions. [2022-07-13 22:41:45,541 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 204 transitions. Word has length 120 [2022-07-13 22:41:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:45,541 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 204 transitions. [2022-07-13 22:41:45,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 22:41:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 204 transitions. [2022-07-13 22:41:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 22:41:45,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:45,544 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:41:45,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 22:41:45,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-13 22:41:45,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash 138900842, now seen corresponding path program 1 times [2022-07-13 22:41:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:45,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368337312] [2022-07-13 22:41:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:41:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:41:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:41:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:41:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:41:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:41:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:41:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:41:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:41:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:41:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-07-13 22:41:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:46,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368337312] [2022-07-13 22:41:46,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368337312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:46,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151976567] [2022-07-13 22:41:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:46,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:46,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:46,137 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:41:46,138 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:41:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 2704 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:41:46,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 22:41:46,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:46,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151976567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:46,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:46,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-13 22:41:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989711906] [2022-07-13 22:41:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:46,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:41:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:41:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:41:46,664 INFO L87 Difference]: Start difference. First operand 148 states and 204 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-13 22:41:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:46,964 INFO L93 Difference]: Finished difference Result 242 states and 337 transitions. [2022-07-13 22:41:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:41:46,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 122 [2022-07-13 22:41:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:46,967 INFO L225 Difference]: With dead ends: 242 [2022-07-13 22:41:46,967 INFO L226 Difference]: Without dead ends: 148 [2022-07-13 22:41:46,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:41:46,968 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 233 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:46,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 708 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:41:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-13 22:41:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-13 22:41:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2022-07-13 22:41:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2022-07-13 22:41:46,993 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 122 [2022-07-13 22:41:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:46,993 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2022-07-13 22:41:46,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-13 22:41:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2022-07-13 22:41:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-13 22:41:46,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:46,995 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:41:47,021 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:41:47,195 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,SelfDestructingSolverStorable1 [2022-07-13 22:41:47,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2034710092, now seen corresponding path program 2 times [2022-07-13 22:41:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:47,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078797237] [2022-07-13 22:41:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:41:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:41:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:41:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:41:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:41:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:41:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:41:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:41:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:41:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:41:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-13 22:41:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:47,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078797237] [2022-07-13 22:41:47,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078797237] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:47,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895716151] [2022-07-13 22:41:47,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:41:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:47,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:47,628 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:41:47,629 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:41:47,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:41:47,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:41:47,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 22:41:47,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-13 22:41:48,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:48,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895716151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:48,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:48,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-13 22:41:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616817472] [2022-07-13 22:41:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:48,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:41:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:48,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:41:48,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:41:48,009 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:41:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:48,081 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2022-07-13 22:41:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:41:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2022-07-13 22:41:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:48,085 INFO L225 Difference]: With dead ends: 160 [2022-07-13 22:41:48,085 INFO L226 Difference]: Without dead ends: 158 [2022-07-13 22:41:48,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:41:48,088 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 16 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:48,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1341 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:41:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-13 22:41:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-07-13 22:41:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 98 states have internal predecessors, (113), 47 states have call successors, (47), 12 states have call predecessors, (47), 14 states have return successors, (58), 46 states have call predecessors, (58), 46 states have call successors, (58) [2022-07-13 22:41:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 218 transitions. [2022-07-13 22:41:48,115 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 218 transitions. Word has length 126 [2022-07-13 22:41:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:48,118 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 218 transitions. [2022-07-13 22:41:48,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:41:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 218 transitions. [2022-07-13 22:41:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 22:41:48,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:48,121 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:41:48,142 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:41:48,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:48,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1275067964, now seen corresponding path program 1 times [2022-07-13 22:41:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848448732] [2022-07-13 22:41:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:41:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:41:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:41:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:41:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:41:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:41:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:41:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:41:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:41:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:41:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-13 22:41:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:48,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848448732] [2022-07-13 22:41:48,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848448732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:48,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411944124] [2022-07-13 22:41:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:48,629 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:41:48,630 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:41:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 2726 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:41:49,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-13 22:41:49,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:49,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411944124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:49,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:49,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-13 22:41:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491909979] [2022-07-13 22:41:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:49,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:41:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:41:49,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:41:49,101 INFO L87 Difference]: Start difference. First operand 157 states and 218 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-13 22:41:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:49,353 INFO L93 Difference]: Finished difference Result 307 states and 437 transitions. [2022-07-13 22:41:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:41:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 130 [2022-07-13 22:41:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:49,355 INFO L225 Difference]: With dead ends: 307 [2022-07-13 22:41:49,355 INFO L226 Difference]: Without dead ends: 187 [2022-07-13 22:41:49,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:41:49,356 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 277 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:49,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 810 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:41:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-13 22:41:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-13 22:41:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 114 states have internal predecessors, (133), 60 states have call successors, (60), 13 states have call predecessors, (60), 15 states have return successors, (73), 59 states have call predecessors, (73), 59 states have call successors, (73) [2022-07-13 22:41:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 266 transitions. [2022-07-13 22:41:49,366 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 266 transitions. Word has length 130 [2022-07-13 22:41:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:49,366 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 266 transitions. [2022-07-13 22:41:49,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-13 22:41:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 266 transitions. [2022-07-13 22:41:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-13 22:41:49,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:49,368 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:41:49,389 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:41:49,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:49,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1527536575, now seen corresponding path program 1 times [2022-07-13 22:41:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:49,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863820294] [2022-07-13 22:41:49,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:49,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:41:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:41:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:41:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:41:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:41:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:41:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:41:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:41:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:41:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:41:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-13 22:41:50,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:50,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863820294] [2022-07-13 22:41:50,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863820294] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:50,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884952957] [2022-07-13 22:41:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:50,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:50,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:50,348 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:41:50,395 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:41:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 2731 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-13 22:41:50,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:50,948 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:41:50,952 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:41:51,202 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:41:51,205 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:41:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:41:51,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:41:51,547 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 38 treesize of output 32 [2022-07-13 22:41:51,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:41:51,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:41:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-13 22:41:51,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884952957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:41:51,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:41:51,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 12] total 31 [2022-07-13 22:41:51,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896885300] [2022-07-13 22:41:51,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:41:51,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 22:41:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:51,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 22:41:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:41:51,586 INFO L87 Difference]: Start difference. First operand 187 states and 266 transitions. Second operand has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-13 22:41:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:54,496 INFO L93 Difference]: Finished difference Result 495 states and 722 transitions. [2022-07-13 22:41:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 22:41:54,497 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) Word has length 132 [2022-07-13 22:41:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:54,501 INFO L225 Difference]: With dead ends: 495 [2022-07-13 22:41:54,501 INFO L226 Difference]: Without dead ends: 288 [2022-07-13 22:41:54,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 286 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=2911, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 22:41:54,505 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 346 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 3923 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 3923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:54,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1296 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 3923 Invalid, 0 Unknown, 410 Unchecked, 2.2s Time] [2022-07-13 22:41:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-13 22:41:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2022-07-13 22:41:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 158 states have (on average 1.1962025316455696) internal successors, (189), 164 states have internal predecessors, (189), 95 states have call successors, (95), 15 states have call predecessors, (95), 19 states have return successors, (123), 93 states have call predecessors, (123), 94 states have call successors, (123) [2022-07-13 22:41:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 407 transitions. [2022-07-13 22:41:54,559 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 407 transitions. Word has length 132 [2022-07-13 22:41:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:54,560 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 407 transitions. [2022-07-13 22:41:54,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-13 22:41:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 407 transitions. [2022-07-13 22:41:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-13 22:41:54,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:54,562 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:41:54,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:41:54,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:54,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:54,780 INFO L85 PathProgramCache]: Analyzing trace with hash -132654696, now seen corresponding path program 1 times [2022-07-13 22:41:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:54,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080084778] [2022-07-13 22:41:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:41:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:41:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:41:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:41:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:41:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:41:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:41:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:41:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:41:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:41:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:41:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:41:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:41:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:41:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:41:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-13 22:41:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:55,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080084778] [2022-07-13 22:41:55,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080084778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:55,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207146908] [2022-07-13 22:41:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:55,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:55,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:55,514 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:41:55,543 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:41:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:55,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-13 22:41:55,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:55,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 22:41:56,340 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 22:41:56,340 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 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-13 22:41:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 132 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 22:41:58,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207146908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:05,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:42:05,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 36 [2022-07-13 22:42:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479131228] [2022-07-13 22:42:05,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:05,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 22:42:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 22:42:05,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1412, Unknown=4, NotChecked=0, Total=1560 [2022-07-13 22:42:05,626 INFO L87 Difference]: Start difference. First operand 273 states and 407 transitions. Second operand has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-13 22:42:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:16,149 INFO L93 Difference]: Finished difference Result 727 states and 1106 transitions. [2022-07-13 22:42:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-13 22:42:16,150 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) Word has length 143 [2022-07-13 22:42:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:16,155 INFO L225 Difference]: With dead ends: 727 [2022-07-13 22:42:16,155 INFO L226 Difference]: Without dead ends: 534 [2022-07-13 22:42:16,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 234 SyntacticMatches, 24 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1777 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=511, Invalid=5027, Unknown=12, NotChecked=0, Total=5550 [2022-07-13 22:42:16,162 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 404 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 3911 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 6258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 3911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1991 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:16,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1941 Invalid, 6258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 3911 Invalid, 0 Unknown, 1991 Unchecked, 2.5s Time] [2022-07-13 22:42:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-07-13 22:42:16,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 423. [2022-07-13 22:42:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 248 states have (on average 1.1774193548387097) internal successors, (292), 255 states have internal predecessors, (292), 147 states have call successors, (147), 22 states have call predecessors, (147), 27 states have return successors, (187), 145 states have call predecessors, (187), 146 states have call successors, (187) [2022-07-13 22:42:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 626 transitions. [2022-07-13 22:42:16,204 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 626 transitions. Word has length 143 [2022-07-13 22:42:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:16,205 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 626 transitions. [2022-07-13 22:42:16,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-13 22:42:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 626 transitions. [2022-07-13 22:42:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 22:42:16,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:16,208 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:42:16,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 22:42:16,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:16,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash -845476291, now seen corresponding path program 1 times [2022-07-13 22:42:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:16,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740139754] [2022-07-13 22:42:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:16,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:42:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:42:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:42:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:42:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:42:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:42:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:42:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-13 22:42:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:16,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740139754] [2022-07-13 22:42:16,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740139754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:16,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:16,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:42:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569794198] [2022-07-13 22:42:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:16,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:42:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:42:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:42:16,796 INFO L87 Difference]: Start difference. First operand 423 states and 626 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-13 22:42:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:17,549 INFO L93 Difference]: Finished difference Result 449 states and 678 transitions. [2022-07-13 22:42:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:42:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2022-07-13 22:42:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:17,553 INFO L225 Difference]: With dead ends: 449 [2022-07-13 22:42:17,553 INFO L226 Difference]: Without dead ends: 447 [2022-07-13 22:42:17,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:42:17,553 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 161 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:17,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 778 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:42:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-13 22:42:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2022-07-13 22:42:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 261 states have (on average 1.1685823754789273) internal successors, (305), 270 states have internal predecessors, (305), 151 states have call successors, (151), 23 states have call predecessors, (151), 30 states have return successors, (216), 149 states have call predecessors, (216), 150 states have call successors, (216) [2022-07-13 22:42:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 672 transitions. [2022-07-13 22:42:17,586 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 672 transitions. Word has length 145 [2022-07-13 22:42:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:17,586 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 672 transitions. [2022-07-13 22:42:17,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-13 22:42:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 672 transitions. [2022-07-13 22:42:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 22:42:17,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:17,589 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:42:17,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:42:17,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash -144411713, now seen corresponding path program 1 times [2022-07-13 22:42:17,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:17,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487615889] [2022-07-13 22:42:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:17,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:42:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:42:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:42:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:42:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:42:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:42:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:42:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-13 22:42:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:17,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487615889] [2022-07-13 22:42:17,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487615889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:17,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:17,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 22:42:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515011512] [2022-07-13 22:42:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:17,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:42:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:17,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:42:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:42:17,939 INFO L87 Difference]: Start difference. First operand 443 states and 672 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-13 22:42:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:19,014 INFO L93 Difference]: Finished difference Result 460 states and 712 transitions. [2022-07-13 22:42:19,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:42:19,015 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2022-07-13 22:42:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:19,017 INFO L225 Difference]: With dead ends: 460 [2022-07-13 22:42:19,018 INFO L226 Difference]: Without dead ends: 458 [2022-07-13 22:42:19,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:42:19,018 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 241 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:19,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 901 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 22:42:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-13 22:42:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 435. [2022-07-13 22:42:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 255 states have (on average 1.1725490196078432) internal successors, (299), 263 states have internal predecessors, (299), 150 states have call successors, (150), 23 states have call predecessors, (150), 29 states have return successors, (212), 148 states have call predecessors, (212), 149 states have call successors, (212) [2022-07-13 22:42:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 661 transitions. [2022-07-13 22:42:19,057 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 661 transitions. Word has length 145 [2022-07-13 22:42:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:19,057 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 661 transitions. [2022-07-13 22:42:19,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-13 22:42:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 661 transitions. [2022-07-13 22:42:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-13 22:42:19,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:19,059 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:42:19,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:42:19,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1764210556, now seen corresponding path program 1 times [2022-07-13 22:42:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:19,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218006973] [2022-07-13 22:42:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:42:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:42:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:42:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:42:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:42:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:42:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:42:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:42:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:42:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-07-13 22:42:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218006973] [2022-07-13 22:42:19,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218006973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992747383] [2022-07-13 22:42:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:19,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:19,452 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:42:19,453 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:42:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 2825 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:42:19,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 22:42:19,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:19,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992747383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:19,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:19,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 13 [2022-07-13 22:42:19,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942457583] [2022-07-13 22:42:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:19,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:42:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:42:19,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:42:19,892 INFO L87 Difference]: Start difference. First operand 435 states and 661 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-13 22:42:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:20,066 INFO L93 Difference]: Finished difference Result 746 states and 1137 transitions. [2022-07-13 22:42:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:42:20,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 154 [2022-07-13 22:42:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:20,069 INFO L225 Difference]: With dead ends: 746 [2022-07-13 22:42:20,069 INFO L226 Difference]: Without dead ends: 435 [2022-07-13 22:42:20,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:42:20,073 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 12 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:20,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1424 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:42:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-13 22:42:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-07-13 22:42:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 255 states have (on average 1.1725490196078432) internal successors, (299), 263 states have internal predecessors, (299), 150 states have call successors, (150), 23 states have call predecessors, (150), 29 states have return successors, (208), 148 states have call predecessors, (208), 149 states have call successors, (208) [2022-07-13 22:42:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 657 transitions. [2022-07-13 22:42:20,102 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 657 transitions. Word has length 154 [2022-07-13 22:42:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:20,102 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 657 transitions. [2022-07-13 22:42:20,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-13 22:42:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 657 transitions. [2022-07-13 22:42:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 22:42:20,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:20,104 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:42:20,126 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:42:20,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:20,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash -386866604, now seen corresponding path program 1 times [2022-07-13 22:42:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839932339] [2022-07-13 22:42:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:42:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:42:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:42:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:42:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:42:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:42:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:42:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:42:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:42:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-13 22:42:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839932339] [2022-07-13 22:42:20,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839932339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:20,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:20,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:42:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924656367] [2022-07-13 22:42:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:20,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:42:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:20,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:42:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:42:20,612 INFO L87 Difference]: Start difference. First operand 435 states and 657 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-13 22:42:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:21,235 INFO L93 Difference]: Finished difference Result 451 states and 677 transitions. [2022-07-13 22:42:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:42:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2022-07-13 22:42:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:21,237 INFO L225 Difference]: With dead ends: 451 [2022-07-13 22:42:21,237 INFO L226 Difference]: Without dead ends: 449 [2022-07-13 22:42:21,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:42:21,238 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 151 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:21,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 640 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:42:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-07-13 22:42:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2022-07-13 22:42:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 258 states have (on average 1.1705426356589148) internal successors, (302), 266 states have internal predecessors, (302), 155 states have call successors, (155), 24 states have call predecessors, (155), 30 states have return successors, (213), 153 states have call predecessors, (213), 154 states have call successors, (213) [2022-07-13 22:42:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 670 transitions. [2022-07-13 22:42:21,269 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 670 transitions. Word has length 153 [2022-07-13 22:42:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:21,270 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 670 transitions. [2022-07-13 22:42:21,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-13 22:42:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 670 transitions. [2022-07-13 22:42:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 22:42:21,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:21,272 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:21,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:42:21,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1630309929, now seen corresponding path program 1 times [2022-07-13 22:42:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:21,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578343901] [2022-07-13 22:42:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:42:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:42:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:42:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:42:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:42:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:42:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:42:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:42:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-13 22:42:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:21,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578343901] [2022-07-13 22:42:21,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578343901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:21,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328031238] [2022-07-13 22:42:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:21,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:21,634 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:42:21,635 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:42:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:22,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 2830 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 22:42:22,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-13 22:42:22,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:22,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328031238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:22,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:22,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2022-07-13 22:42:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260045092] [2022-07-13 22:42:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:22,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:42:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:42:22,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:42:22,162 INFO L87 Difference]: Start difference. First operand 444 states and 670 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-13 22:42:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:22,325 INFO L93 Difference]: Finished difference Result 823 states and 1278 transitions. [2022-07-13 22:42:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:42:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 156 [2022-07-13 22:42:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:22,328 INFO L225 Difference]: With dead ends: 823 [2022-07-13 22:42:22,328 INFO L226 Difference]: Without dead ends: 444 [2022-07-13 22:42:22,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:42:22,331 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 15 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:22,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 696 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-07-13 22:42:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-13 22:42:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2022-07-13 22:42:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 258 states have (on average 1.1627906976744187) internal successors, (300), 266 states have internal predecessors, (300), 155 states have call successors, (155), 24 states have call predecessors, (155), 30 states have return successors, (213), 153 states have call predecessors, (213), 154 states have call successors, (213) [2022-07-13 22:42:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 668 transitions. [2022-07-13 22:42:22,361 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 668 transitions. Word has length 156 [2022-07-13 22:42:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:22,361 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 668 transitions. [2022-07-13 22:42:22,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-13 22:42:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-07-13 22:42:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 22:42:22,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:22,363 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:22,386 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:42:22,584 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,SelfDestructingSolverStorable10 [2022-07-13 22:42:22,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1137683755, now seen corresponding path program 1 times [2022-07-13 22:42:22,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:22,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54482202] [2022-07-13 22:42:22,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:22,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:42:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:42:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:42:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:42:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:42:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:42:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:42:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:42:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-13 22:42:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:23,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54482202] [2022-07-13 22:42:23,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54482202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:23,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971470191] [2022-07-13 22:42:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:23,702 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:42:23,732 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:42:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:24,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 22:42:24,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:24,595 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-13 22:42:24,596 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 2 case distinctions, treesize of input 30 treesize of output 39 [2022-07-13 22:42:24,699 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 22:42:24,699 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 34 treesize of output 18 [2022-07-13 22:42:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 160 proven. 12 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-13 22:42:24,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:25,144 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:42:25,215 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:42:25,216 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:42:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-07-13 22:42:25,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971470191] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:25,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:25,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13, 11] total 41 [2022-07-13 22:42:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812890480] [2022-07-13 22:42:25,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:25,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 22:42:25,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:25,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 22:42:25,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 22:42:25,245 INFO L87 Difference]: Start difference. First operand 444 states and 668 transitions. Second operand has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) [2022-07-13 22:42:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:30,945 INFO L93 Difference]: Finished difference Result 937 states and 1448 transitions. [2022-07-13 22:42:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 22:42:30,946 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) Word has length 156 [2022-07-13 22:42:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:30,949 INFO L225 Difference]: With dead ends: 937 [2022-07-13 22:42:30,949 INFO L226 Difference]: Without dead ends: 652 [2022-07-13 22:42:30,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 331 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=487, Invalid=5063, Unknown=0, NotChecked=0, Total=5550 [2022-07-13 22:42:30,962 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 277 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 7788 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 8673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 7788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:30,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1683 Invalid, 8673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 7788 Invalid, 0 Unknown, 578 Unchecked, 4.3s Time] [2022-07-13 22:42:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-07-13 22:42:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 533. [2022-07-13 22:42:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 309 states have (on average 1.1715210355987056) internal successors, (362), 315 states have internal predecessors, (362), 191 states have call successors, (191), 28 states have call predecessors, (191), 32 states have return successors, (258), 189 states have call predecessors, (258), 190 states have call successors, (258) [2022-07-13 22:42:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 811 transitions. [2022-07-13 22:42:31,008 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 811 transitions. Word has length 156 [2022-07-13 22:42:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:31,008 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 811 transitions. [2022-07-13 22:42:31,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) [2022-07-13 22:42:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 811 transitions. [2022-07-13 22:42:31,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 22:42:31,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:31,011 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:31,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 22:42:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:31,231 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1267128233, now seen corresponding path program 2 times [2022-07-13 22:42:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:31,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174405296] [2022-07-13 22:42:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:31,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:42:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:42:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:42:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:42:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:42:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:42:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:42:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:42:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:42:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-13 22:42:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:31,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174405296] [2022-07-13 22:42:31,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174405296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323115827] [2022-07-13 22:42:31,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:42:31,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:31,947 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:42:31,948 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:42:32,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:42:32,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:42:32,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-13 22:42:32,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 133 proven. 9 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-13 22:42:33,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-13 22:42:34,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323115827] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:34,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:34,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 15] total 52 [2022-07-13 22:42:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422734098] [2022-07-13 22:42:34,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:34,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-13 22:42:34,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:34,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-13 22:42:34,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2485, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 22:42:34,617 INFO L87 Difference]: Start difference. First operand 533 states and 811 transitions. Second operand has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) [2022-07-13 22:42:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:39,625 INFO L93 Difference]: Finished difference Result 834 states and 1265 transitions. [2022-07-13 22:42:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 22:42:39,625 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) Word has length 156 [2022-07-13 22:42:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:39,628 INFO L225 Difference]: With dead ends: 834 [2022-07-13 22:42:39,628 INFO L226 Difference]: Without dead ends: 612 [2022-07-13 22:42:39,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 325 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=716, Invalid=9184, Unknown=0, NotChecked=0, Total=9900 [2022-07-13 22:42:39,631 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 423 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 6605 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 7982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 6605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 962 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:39,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1670 Invalid, 7982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 6605 Invalid, 0 Unknown, 962 Unchecked, 3.3s Time] [2022-07-13 22:42:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-07-13 22:42:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 571. [2022-07-13 22:42:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 341 states have (on average 1.1759530791788857) internal successors, (401), 347 states have internal predecessors, (401), 193 states have call successors, (193), 32 states have call predecessors, (193), 36 states have return successors, (280), 191 states have call predecessors, (280), 192 states have call successors, (280) [2022-07-13 22:42:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 874 transitions. [2022-07-13 22:42:39,666 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 874 transitions. Word has length 156 [2022-07-13 22:42:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:39,667 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 874 transitions. [2022-07-13 22:42:39,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) [2022-07-13 22:42:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 874 transitions. [2022-07-13 22:42:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 22:42:39,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:39,669 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 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:42:39,698 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:42:39,889 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,SelfDestructingSolverStorable12 [2022-07-13 22:42:39,889 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1021216476, now seen corresponding path program 1 times [2022-07-13 22:42:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:39,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059091268] [2022-07-13 22:42:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:42:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:42:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:42:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:42:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:42:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:42:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:42:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:42:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:42:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-07-13 22:42:40,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:40,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059091268] [2022-07-13 22:42:40,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059091268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:40,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397240275] [2022-07-13 22:42:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:40,408 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:42:40,409 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:42:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:40,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-13 22:42:40,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:40,951 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 13 treesize of output 9 [2022-07-13 22:42:41,313 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 17 treesize of output 13 [2022-07-13 22:42:41,325 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 22 treesize of output 14 [2022-07-13 22:42:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-13 22:42:42,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:42,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397240275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:42,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:42,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16] total 32 [2022-07-13 22:42:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039473146] [2022-07-13 22:42:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 22:42:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 22:42:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2022-07-13 22:42:42,515 INFO L87 Difference]: Start difference. First operand 571 states and 874 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-13 22:42:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:43,395 INFO L93 Difference]: Finished difference Result 878 states and 1297 transitions. [2022-07-13 22:42:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 22:42:43,397 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 157 [2022-07-13 22:42:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:43,400 INFO L225 Difference]: With dead ends: 878 [2022-07-13 22:42:43,400 INFO L226 Difference]: Without dead ends: 673 [2022-07-13 22:42:43,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 161 SyntacticMatches, 28 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2022-07-13 22:42:43,402 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 156 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:43,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 884 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1240 Invalid, 0 Unknown, 766 Unchecked, 0.6s Time] [2022-07-13 22:42:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-13 22:42:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 652. [2022-07-13 22:42:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 396 states have (on average 1.1717171717171717) internal successors, (464), 403 states have internal predecessors, (464), 211 states have call successors, (211), 39 states have call predecessors, (211), 44 states have return successors, (306), 209 states have call predecessors, (306), 210 states have call successors, (306) [2022-07-13 22:42:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 981 transitions. [2022-07-13 22:42:43,480 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 981 transitions. Word has length 157 [2022-07-13 22:42:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:43,480 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 981 transitions. [2022-07-13 22:42:43,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-13 22:42:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 981 transitions. [2022-07-13 22:42:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 22:42:43,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:43,482 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 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:42:43,527 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:42:43,697 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,SelfDestructingSolverStorable13 [2022-07-13 22:42:43,697 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1279381914, now seen corresponding path program 1 times [2022-07-13 22:42:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:43,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926608183] [2022-07-13 22:42:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:42:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:42:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:42:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:42:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:42:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:42:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:42:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:42:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:42:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-13 22:42:43,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:43,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926608183] [2022-07-13 22:42:43,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926608183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:43,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:43,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:42:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037272989] [2022-07-13 22:42:43,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:43,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:42:43,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:43,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:42:43,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:42:43,976 INFO L87 Difference]: Start difference. First operand 652 states and 981 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-13 22:42:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:44,412 INFO L93 Difference]: Finished difference Result 1252 states and 1929 transitions. [2022-07-13 22:42:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:42:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2022-07-13 22:42:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:44,418 INFO L225 Difference]: With dead ends: 1252 [2022-07-13 22:42:44,418 INFO L226 Difference]: Without dead ends: 635 [2022-07-13 22:42:44,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:42:44,422 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 202 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:44,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 343 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:42:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-13 22:42:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2022-07-13 22:42:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 384 states have (on average 1.1588541666666667) internal successors, (445), 389 states have internal predecessors, (445), 208 states have call successors, (208), 39 states have call predecessors, (208), 42 states have return successors, (278), 206 states have call predecessors, (278), 207 states have call successors, (278) [2022-07-13 22:42:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 931 transitions. [2022-07-13 22:42:44,466 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 931 transitions. Word has length 157 [2022-07-13 22:42:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:44,466 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 931 transitions. [2022-07-13 22:42:44,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-13 22:42:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 931 transitions. [2022-07-13 22:42:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-13 22:42:44,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:44,468 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 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:42:44,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 22:42:44,469 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:44,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1258471427, now seen corresponding path program 1 times [2022-07-13 22:42:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:44,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872668866] [2022-07-13 22:42:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:42:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:42:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:42:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:42:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:42:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:42:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:42:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:42:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:42:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:42:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-13 22:42:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:44,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872668866] [2022-07-13 22:42:44,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872668866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:44,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:44,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 22:42:44,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485437402] [2022-07-13 22:42:44,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:44,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:42:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:42:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:42:44,800 INFO L87 Difference]: Start difference. First operand 635 states and 931 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-13 22:42:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:45,852 INFO L93 Difference]: Finished difference Result 658 states and 959 transitions. [2022-07-13 22:42:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:42:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2022-07-13 22:42:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:45,856 INFO L225 Difference]: With dead ends: 658 [2022-07-13 22:42:45,856 INFO L226 Difference]: Without dead ends: 656 [2022-07-13 22:42:45,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:42:45,857 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 227 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:45,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 899 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 22:42:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-13 22:42:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 645. [2022-07-13 22:42:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 387 states have (on average 1.1576227390180878) internal successors, (448), 392 states have internal predecessors, (448), 214 states have call successors, (214), 40 states have call predecessors, (214), 43 states have return successors, (284), 212 states have call predecessors, (284), 213 states have call successors, (284) [2022-07-13 22:42:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 946 transitions. [2022-07-13 22:42:45,898 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 946 transitions. Word has length 159 [2022-07-13 22:42:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:45,899 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 946 transitions. [2022-07-13 22:42:45,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-13 22:42:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 946 transitions. [2022-07-13 22:42:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-13 22:42:45,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:45,902 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:45,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 22:42:45,902 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1665943078, now seen corresponding path program 1 times [2022-07-13 22:42:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:45,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421647668] [2022-07-13 22:42:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:42:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:42:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:42:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:42:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:42:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:42:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:42:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:42:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-13 22:42:46,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421647668] [2022-07-13 22:42:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421647668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:46,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:46,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:42:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109790894] [2022-07-13 22:42:46,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:46,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:42:46,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:46,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:42:46,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:42:46,257 INFO L87 Difference]: Start difference. First operand 645 states and 946 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-13 22:42:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:46,611 INFO L93 Difference]: Finished difference Result 957 states and 1406 transitions. [2022-07-13 22:42:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:42:46,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2022-07-13 22:42:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:46,615 INFO L225 Difference]: With dead ends: 957 [2022-07-13 22:42:46,615 INFO L226 Difference]: Without dead ends: 669 [2022-07-13 22:42:46,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:42:46,616 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 131 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:46,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:42:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-13 22:42:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 663. [2022-07-13 22:42:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 400 states have (on average 1.1525) internal successors, (461), 406 states have internal predecessors, (461), 214 states have call successors, (214), 40 states have call predecessors, (214), 48 states have return successors, (292), 216 states have call predecessors, (292), 213 states have call successors, (292) [2022-07-13 22:42:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 967 transitions. [2022-07-13 22:42:46,657 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 967 transitions. Word has length 164 [2022-07-13 22:42:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:46,657 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 967 transitions. [2022-07-13 22:42:46,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-13 22:42:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 967 transitions. [2022-07-13 22:42:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 22:42:46,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:46,659 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 22:42:46,660 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:46,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash -448225397, now seen corresponding path program 1 times [2022-07-13 22:42:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:46,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080760521] [2022-07-13 22:42:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:46,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:42:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:42:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:42:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:42:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:42:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:42:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:42:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:42:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:42:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:42:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 22:42:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-07-13 22:42:47,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:47,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080760521] [2022-07-13 22:42:47,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080760521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:47,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293995031] [2022-07-13 22:42:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:47,225 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:42:47,267 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:42:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 2820 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-13 22:42:47,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:47,871 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 13 treesize of output 9 [2022-07-13 22:42:48,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:42:48,603 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-13 22:42:48,603 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 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-13 22:42:48,607 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 17 treesize of output 13 [2022-07-13 22:42:48,610 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 22 treesize of output 14 [2022-07-13 22:42:48,751 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 22:42:48,751 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 35 treesize of output 19 [2022-07-13 22:42:48,754 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 20 treesize of output 8 [2022-07-13 22:42:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 22:42:48,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:49,400 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 33 treesize of output 25 [2022-07-13 22:42:49,597 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:42:49,598 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:42:49,727 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 40 treesize of output 34 [2022-07-13 22:42:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-07-13 22:42:49,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293995031] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:49,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:49,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 18] total 53 [2022-07-13 22:42:49,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612522739] [2022-07-13 22:42:49,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:49,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 22:42:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 22:42:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2551, Unknown=0, NotChecked=0, Total=2756 [2022-07-13 22:42:49,910 INFO L87 Difference]: Start difference. First operand 663 states and 967 transitions. Second operand has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) [2022-07-13 22:42:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:53,049 INFO L93 Difference]: Finished difference Result 936 states and 1299 transitions. [2022-07-13 22:42:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-13 22:42:53,050 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) Word has length 163 [2022-07-13 22:42:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:53,053 INFO L225 Difference]: With dead ends: 936 [2022-07-13 22:42:53,053 INFO L226 Difference]: Without dead ends: 682 [2022-07-13 22:42:53,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 341 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=673, Invalid=6809, Unknown=0, NotChecked=0, Total=7482 [2022-07-13 22:42:53,055 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 467 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 4618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 754 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:53,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1416 Invalid, 4618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 3476 Invalid, 0 Unknown, 754 Unchecked, 2.0s Time] [2022-07-13 22:42:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-07-13 22:42:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 609. [2022-07-13 22:42:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 382 states have (on average 1.143979057591623) internal successors, (437), 387 states have internal predecessors, (437), 177 states have call successors, (177), 43 states have call predecessors, (177), 49 states have return successors, (238), 178 states have call predecessors, (238), 176 states have call successors, (238) [2022-07-13 22:42:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 852 transitions. [2022-07-13 22:42:53,089 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 852 transitions. Word has length 163 [2022-07-13 22:42:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:53,089 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 852 transitions. [2022-07-13 22:42:53,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) [2022-07-13 22:42:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 852 transitions. [2022-07-13 22:42:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-13 22:42:53,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:53,091 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,111 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:42:53,311 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:42:53,311 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1049417710, now seen corresponding path program 1 times [2022-07-13 22:42:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:53,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793503652] [2022-07-13 22:42:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:53,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:53,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:42:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:42:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:42:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:42:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:42:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:42:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:42:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:42:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:42:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:42:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:42:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 7 proven. 87 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-13 22:42:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:54,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793503652] [2022-07-13 22:42:54,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793503652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:54,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046460124] [2022-07-13 22:42:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:54,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:54,441 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:42:54,442 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:42:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:54,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 2817 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 22:42:54,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:54,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 22:42:55,471 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 22:42:55,472 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 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-13 22:42:59,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-07-13 22:42:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-13 22:42:59,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046460124] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:22,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:43:22,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21] total 49 [2022-07-13 22:43:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45950040] [2022-07-13 22:43:22,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:22,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-13 22:43:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 22:43:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2633, Unknown=10, NotChecked=0, Total=2862 [2022-07-13 22:43:22,648 INFO L87 Difference]: Start difference. First operand 609 states and 852 transitions. Second operand has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) [2022-07-13 22:43:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:35,551 INFO L93 Difference]: Finished difference Result 822 states and 1124 transitions. [2022-07-13 22:43:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-13 22:43:35,552 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) Word has length 165 [2022-07-13 22:43:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:35,555 INFO L225 Difference]: With dead ends: 822 [2022-07-13 22:43:35,555 INFO L226 Difference]: Without dead ends: 752 [2022-07-13 22:43:35,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 304 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=750, Invalid=9330, Unknown=20, NotChecked=0, Total=10100 [2022-07-13 22:43:35,557 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 570 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 5200 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 7104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 5200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1421 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:35,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1707 Invalid, 7104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 5200 Invalid, 0 Unknown, 1421 Unchecked, 3.3s Time] [2022-07-13 22:43:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-13 22:43:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 665. [2022-07-13 22:43:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 419 states have (on average 1.1288782816229117) internal successors, (473), 423 states have internal predecessors, (473), 189 states have call successors, (189), 51 states have call predecessors, (189), 56 states have return successors, (250), 190 states have call predecessors, (250), 188 states have call successors, (250) [2022-07-13 22:43:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 912 transitions. [2022-07-13 22:43:35,621 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 912 transitions. Word has length 165 [2022-07-13 22:43:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:35,621 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 912 transitions. [2022-07-13 22:43:35,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) [2022-07-13 22:43:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 912 transitions. [2022-07-13 22:43:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-13 22:43:35,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:35,623 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,655 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:43:35,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:35,839 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -260269898, now seen corresponding path program 1 times [2022-07-13 22:43:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:35,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677186784] [2022-07-13 22:43:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:43:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:43:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:43:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:43:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:43:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:43:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:43:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:43:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:43:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:43:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:43:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:43:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 22:43:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 22:43:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-13 22:43:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677186784] [2022-07-13 22:43:36,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677186784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843427526] [2022-07-13 22:43:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:36,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:36,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:36,740 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:43:36,782 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:43:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:37,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 2857 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:43:37,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-13 22:43:37,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:37,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843427526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:37,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:37,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [32] total 38 [2022-07-13 22:43:37,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745360570] [2022-07-13 22:43:37,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:37,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:43:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:43:37,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 22:43:37,343 INFO L87 Difference]: Start difference. First operand 665 states and 912 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-13 22:43:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:37,522 INFO L93 Difference]: Finished difference Result 1044 states and 1453 transitions. [2022-07-13 22:43:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:43:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 168 [2022-07-13 22:43:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:37,526 INFO L225 Difference]: With dead ends: 1044 [2022-07-13 22:43:37,526 INFO L226 Difference]: Without dead ends: 665 [2022-07-13 22:43:37,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1526, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 22:43:37,530 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 10 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:37,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1398 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:43:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-13 22:43:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2022-07-13 22:43:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 419 states have (on average 1.126491646778043) internal successors, (472), 423 states have internal predecessors, (472), 189 states have call successors, (189), 51 states have call predecessors, (189), 56 states have return successors, (250), 190 states have call predecessors, (250), 188 states have call successors, (250) [2022-07-13 22:43:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 911 transitions. [2022-07-13 22:43:37,639 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 911 transitions. Word has length 168 [2022-07-13 22:43:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:37,640 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 911 transitions. [2022-07-13 22:43:37,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-13 22:43:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 911 transitions. [2022-07-13 22:43:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-13 22:43:37,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:37,645 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:37,667 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:43:37,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:37,865 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash 719923375, now seen corresponding path program 1 times [2022-07-13 22:43:37,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:37,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307431666] [2022-07-13 22:43:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:43:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:43:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:43:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:43:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:43:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:43:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:43:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:43:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:43:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:43:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:43:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:43:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-13 22:43:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307431666] [2022-07-13 22:43:38,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307431666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312688037] [2022-07-13 22:43:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:38,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:38,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:38,839 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:43:38,840 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:43:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:39,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 2867 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-13 22:43:39,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:39,312 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:43:39,312 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 22:43:39,719 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 13 treesize of output 9 [2022-07-13 22:43:39,770 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-13 22:43:39,771 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 18 treesize of output 20 [2022-07-13 22:43:40,770 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 17 treesize of output 13 [2022-07-13 22:43:40,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:40,781 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 22:43:40,782 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 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 22:43:40,785 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 31 treesize of output 19 [2022-07-13 22:43:40,877 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-13 22:43:40,878 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 22 treesize of output 24 [2022-07-13 22:43:41,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:43:41,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:43:41,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-13 22:43:41,168 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_1 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_arrayElimArr_1))) (exists ((v_ArrVal_1772 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_1772)))) is different from true [2022-07-13 22:43:41,180 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 27 treesize of output 27 [2022-07-13 22:43:41,192 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 22:43:41,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2022-07-13 22:43:41,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 22:43:41,258 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:43:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 171 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 2 not checked. [2022-07-13 22:43:41,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:42,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:42,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 22:43:42,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#old_byte_from_lhs~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| 8)) 0))) is different from false [2022-07-13 22:43:42,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312688037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:42,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:43:42,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 59 [2022-07-13 22:43:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352167732] [2022-07-13 22:43:42,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:42,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-13 22:43:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-13 22:43:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=4428, Unknown=3, NotChecked=270, Total=4970 [2022-07-13 22:43:42,360 INFO L87 Difference]: Start difference. First operand 665 states and 911 transitions. Second operand has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) [2022-07-13 22:43:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:49,871 INFO L93 Difference]: Finished difference Result 1447 states and 2093 transitions. [2022-07-13 22:43:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-07-13 22:43:49,872 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) Word has length 170 [2022-07-13 22:43:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:49,876 INFO L225 Difference]: With dead ends: 1447 [2022-07-13 22:43:49,876 INFO L226 Difference]: Without dead ends: 1079 [2022-07-13 22:43:49,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 272 SyntacticMatches, 9 SemanticMatches, 135 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5350 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1249, Invalid=16815, Unknown=34, NotChecked=534, Total=18632 [2022-07-13 22:43:49,878 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 905 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 8554 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 12712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 8554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3119 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:49,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1743 Invalid, 12712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 8554 Invalid, 0 Unknown, 3119 Unchecked, 4.8s Time] [2022-07-13 22:43:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-07-13 22:43:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 973. [2022-07-13 22:43:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 587 states have (on average 1.1465076660988074) internal successors, (673), 589 states have internal predecessors, (673), 315 states have call successors, (315), 64 states have call predecessors, (315), 70 states have return successors, (422), 319 states have call predecessors, (422), 313 states have call successors, (422) [2022-07-13 22:43:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1410 transitions. [2022-07-13 22:43:49,963 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1410 transitions. Word has length 170 [2022-07-13 22:43:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:49,964 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1410 transitions. [2022-07-13 22:43:49,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) [2022-07-13 22:43:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1410 transitions. [2022-07-13 22:43:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-13 22:43:49,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:49,966 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:50,003 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:43:50,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:50,180 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1773315023, now seen corresponding path program 2 times [2022-07-13 22:43:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559317919] [2022-07-13 22:43:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:43:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:43:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:43:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:43:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:43:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:43:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:43:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:43:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:43:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:43:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:43:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:43:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:43:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-07-13 22:43:50,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:50,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559317919] [2022-07-13 22:43:50,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559317919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:50,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62613128] [2022-07-13 22:43:50,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:43:50,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:50,604 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:43:50,605 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:43:51,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:43:51,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:43:51,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 2867 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-13 22:43:51,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:51,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 22:43:51,594 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 13 treesize of output 9 [2022-07-13 22:43:52,223 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 22:43:52,224 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 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 22:43:52,231 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:43:52,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2022-07-13 22:43:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-13 22:43:52,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:52,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62613128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:52,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:52,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [15] total 34 [2022-07-13 22:43:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129949967] [2022-07-13 22:43:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:52,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 22:43:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:52,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 22:43:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 22:43:52,420 INFO L87 Difference]: Start difference. First operand 973 states and 1410 transitions. Second operand has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-13 22:43:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:53,788 INFO L93 Difference]: Finished difference Result 1660 states and 2398 transitions. [2022-07-13 22:43:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 22:43:53,789 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 170 [2022-07-13 22:43:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:53,794 INFO L225 Difference]: With dead ends: 1660 [2022-07-13 22:43:53,794 INFO L226 Difference]: Without dead ends: 1492 [2022-07-13 22:43:53,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2022-07-13 22:43:53,797 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 210 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 679 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:53,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1047 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1938 Invalid, 0 Unknown, 679 Unchecked, 1.0s Time] [2022-07-13 22:43:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-07-13 22:43:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1476. [2022-07-13 22:43:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 889 states have (on average 1.1496062992125984) internal successors, (1022), 893 states have internal predecessors, (1022), 480 states have call successors, (480), 96 states have call predecessors, (480), 106 states have return successors, (652), 486 states have call predecessors, (652), 476 states have call successors, (652) [2022-07-13 22:43:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2154 transitions. [2022-07-13 22:43:53,910 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2154 transitions. Word has length 170 [2022-07-13 22:43:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:53,910 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 2154 transitions. [2022-07-13 22:43:53,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-13 22:43:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2154 transitions. [2022-07-13 22:43:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-13 22:43:53,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:53,914 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:53,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-13 22:43:54,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 22:43:54,135 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash 906081946, now seen corresponding path program 1 times [2022-07-13 22:43:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:54,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890191202] [2022-07-13 22:43:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:54,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:43:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:43:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:43:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:43:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:43:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:43:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:43:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:43:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:43:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:43:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 22:43:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-13 22:43:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890191202] [2022-07-13 22:43:54,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890191202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:54,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732426078] [2022-07-13 22:43:54,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:54,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:54,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:54,545 INFO L229 MonitoredProcess]: Starting monitored process 18 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:43:54,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 22:43:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:55,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-13 22:43:55,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:55,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:43:55,196 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 13 treesize of output 9 [2022-07-13 22:43:55,816 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 30 treesize of output 18 [2022-07-13 22:43:55,818 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 13 treesize of output 9 [2022-07-13 22:43:55,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:55,839 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-13 22:43:55,839 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 1 case distinctions, treesize of input 30 treesize of output 39 [2022-07-13 22:44:14,861 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 22:44:14,862 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 53 treesize of output 29 [2022-07-13 22:44:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 31 proven. 127 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-13 22:44:14,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:44:35,948 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 58 treesize of output 46 [2022-07-13 22:44:36,033 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 46 treesize of output 40 [2022-07-13 22:44:36,077 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 46 treesize of output 40 [2022-07-13 22:44:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-07-13 22:44:36,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732426078] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:44:36,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:44:36,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28, 21] total 63 [2022-07-13 22:44:36,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787364748] [2022-07-13 22:44:36,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:44:36,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-13 22:44:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-13 22:44:36,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3645, Unknown=5, NotChecked=0, Total=3906 [2022-07-13 22:44:36,331 INFO L87 Difference]: Start difference. First operand 1476 states and 2154 transitions. Second operand has 63 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 22 states have call successors, (66), 13 states have call predecessors, (66), 17 states have return successors, (63), 15 states have call predecessors, (63), 20 states have call successors, (63) [2022-07-13 22:45:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:47,359 INFO L93 Difference]: Finished difference Result 2348 states and 3389 transitions. [2022-07-13 22:45:47,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-07-13 22:45:47,360 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 22 states have call successors, (66), 13 states have call predecessors, (66), 17 states have return successors, (63), 15 states have call predecessors, (63), 20 states have call successors, (63) Word has length 172 [2022-07-13 22:45:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:47,367 INFO L225 Difference]: With dead ends: 2348 [2022-07-13 22:45:47,368 INFO L226 Difference]: Without dead ends: 2189 [2022-07-13 22:45:47,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 354 SyntacticMatches, 11 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=1097, Invalid=18051, Unknown=34, NotChecked=0, Total=19182 [2022-07-13 22:45:47,370 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 429 mSDsluCounter, 3912 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 8291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2987 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:47,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 4141 Invalid, 8291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 5098 Invalid, 0 Unknown, 2987 Unchecked, 2.8s Time] [2022-07-13 22:45:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-07-13 22:45:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2044. [2022-07-13 22:45:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1244 states have (on average 1.1334405144694535) internal successors, (1410), 1256 states have internal predecessors, (1410), 650 states have call successors, (650), 142 states have call predecessors, (650), 149 states have return successors, (900), 645 states have call predecessors, (900), 646 states have call successors, (900) [2022-07-13 22:45:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2960 transitions. [2022-07-13 22:45:47,496 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2960 transitions. Word has length 172 [2022-07-13 22:45:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:47,496 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2960 transitions. [2022-07-13 22:45:47,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 22 states have call successors, (66), 13 states have call predecessors, (66), 17 states have return successors, (63), 15 states have call predecessors, (63), 20 states have call successors, (63) [2022-07-13 22:45:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2960 transitions. [2022-07-13 22:45:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-13 22:45:47,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:47,501 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 22:45:47,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:47,739 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1555390476, now seen corresponding path program 1 times [2022-07-13 22:45:47,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:47,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400763522] [2022-07-13 22:45:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:47,834 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 2 [2022-07-13 22:45:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:45:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:45:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:45:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:45:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:45:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:45:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:45:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:45:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:45:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:45:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:45:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:45:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:45:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:45:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:45:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:45:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:45:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:45:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:47,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:45:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:45:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:45:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 22:45:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:45:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:45:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 22:45:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 22:45:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 22:45:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 22:45:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 22:45:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2022-07-13 22:45:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:48,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400763522] [2022-07-13 22:45:48,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400763522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:48,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315675542] [2022-07-13 22:45:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:48,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:48,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:48,041 INFO L229 MonitoredProcess]: Starting monitored process 19 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:48,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 22:45:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:48,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-13 22:45:48,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:45:48,603 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:45:48,606 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:45:48,755 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:45:48,757 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:45:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 299 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 22:45:48,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:45:49,056 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 38 treesize of output 32 [2022-07-13 22:45:49,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:45:49,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:45:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-13 22:45:49,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315675542] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:45:49,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:45:49,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 25 [2022-07-13 22:45:49,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719048166] [2022-07-13 22:45:49,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:45:49,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 22:45:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:49,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 22:45:49,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:45:49,114 INFO L87 Difference]: Start difference. First operand 2044 states and 2960 transitions. Second operand has 25 states, 23 states have (on average 5.695652173913044) internal successors, (131), 18 states have internal predecessors, (131), 9 states have call successors, (75), 7 states have call predecessors, (75), 7 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) [2022-07-13 22:45:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:51,427 INFO L93 Difference]: Finished difference Result 3486 states and 5112 transitions. [2022-07-13 22:45:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 22:45:51,428 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 5.695652173913044) internal successors, (131), 18 states have internal predecessors, (131), 9 states have call successors, (75), 7 states have call predecessors, (75), 7 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) Word has length 204 [2022-07-13 22:45:51,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:51,435 INFO L225 Difference]: With dead ends: 3486 [2022-07-13 22:45:51,435 INFO L226 Difference]: Without dead ends: 2095 [2022-07-13 22:45:51,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 449 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1839, Unknown=0, NotChecked=0, Total=2070 [2022-07-13 22:45:51,439 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 178 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 3304 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 3304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:51,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1150 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 3304 Invalid, 0 Unknown, 289 Unchecked, 1.7s Time] [2022-07-13 22:45:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-07-13 22:45:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1787. [2022-07-13 22:45:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1108 states have (on average 1.114620938628159) internal successors, (1235), 1118 states have internal predecessors, (1235), 535 states have call successors, (535), 138 states have call predecessors, (535), 143 states have return successors, (730), 530 states have call predecessors, (730), 531 states have call successors, (730) [2022-07-13 22:45:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2500 transitions. [2022-07-13 22:45:51,553 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2500 transitions. Word has length 204 [2022-07-13 22:45:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:51,554 INFO L495 AbstractCegarLoop]: Abstraction has 1787 states and 2500 transitions. [2022-07-13 22:45:51,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 5.695652173913044) internal successors, (131), 18 states have internal predecessors, (131), 9 states have call successors, (75), 7 states have call predecessors, (75), 7 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) [2022-07-13 22:45:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2500 transitions. [2022-07-13 22:45:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-13 22:45:51,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:51,559 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 22:45:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:51,781 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -431353651, now seen corresponding path program 1 times [2022-07-13 22:45:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:51,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469013839] [2022-07-13 22:45:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:45:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:45:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:45:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:45:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:45:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:45:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:45:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:45:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:45:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:45:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:45:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:45:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:45:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:45:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:51,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:45:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:45:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:45:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:45:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:45:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:45:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 22:45:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:45:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 22:45:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2022-07-13 22:45:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469013839] [2022-07-13 22:45:52,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469013839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904090141] [2022-07-13 22:45:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:52,108 INFO L229 MonitoredProcess]: Starting monitored process 20 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:52,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 22:45:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:52,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 2910 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-13 22:45:52,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:45:52,621 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 22:45:52,622 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 19 treesize of output 18 [2022-07-13 22:45:52,883 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 13 treesize of output 9 [2022-07-13 22:45:52,923 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 22:45:52,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-07-13 22:45:53,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 23 [2022-07-13 22:45:53,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:45:53,475 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 6 treesize of output 5 [2022-07-13 22:45:53,528 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-07-13 22:45:53,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2022-07-13 22:45:53,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2022-07-13 22:45:54,543 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 11 treesize of output 7 [2022-07-13 22:45:54,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:45:56,299 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2337 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int) (aux_div_v_ArrVal_2335_40 Int) (aux_mod_v_ArrVal_2335_40 Int) (v_ArrVal_2338 Int)) (and (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| (store (store (select |c_old(#memory_int)| |save_byte_from_array_~storage#1.base|) |c_save_byte_from_array_#in~storage#1.offset| (+ (* 18446744073709551616 aux_div_v_ArrVal_2335_40) aux_mod_v_ArrVal_2335_40)) (+ |c_save_byte_from_array_#in~storage#1.offset| 8) v_ArrVal_2338)) |c_#memory_int|) (<= 0 aux_mod_v_ArrVal_2335_40) (< aux_mod_v_ArrVal_2335_40 (mod |c_save_byte_from_array_#in~size#1| 18446744073709551616)) (= (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_2337) |c_#memory_$Pointer$.base|))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base_BEFORE_CALL_95| Int) (|v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base_BEFORE_CALL_71| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base_BEFORE_CALL_71|) 1) (= (select |c_#valid| |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base_BEFORE_CALL_95|) 1) (not (= |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base_BEFORE_CALL_71| |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base_BEFORE_CALL_95|))))) is different from true [2022-07-13 22:45:56,332 INFO L356 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-07-13 22:45:56,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2022-07-13 22:45:56,346 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:45:56,346 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 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-13 22:45:56,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-13 22:45:57,429 INFO L356 Elim1Store]: treesize reduction 8, result has 91.8 percent of original size [2022-07-13 22:45:57,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 124 [2022-07-13 22:45:57,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:45:57,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:45:57,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2341 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2341) |c_#memory_int|)) (exists ((v_ArrVal_2342 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2342) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 22:45:57,921 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 22:45:57,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 66 [2022-07-13 22:45:57,926 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 22:45:57,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0