./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_buf_eq_c_str_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 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:56:29,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:56:29,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:56:29,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:56:29,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:56:29,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:56:29,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:56:29,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:56:29,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:56:29,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:56:29,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:56:29,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:56:29,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:56:29,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:56:29,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:56:29,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:56:29,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:56:29,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:56:29,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:56:29,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:56:29,497 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:56:29,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:56:29,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:56:29,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:56:29,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:56:29,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:56:29,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:56:29,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:56:29,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:56:29,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:56:29,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:56:29,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:56:29,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:56:29,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:56:29,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:56:29,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:56:29,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:56:29,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:56:29,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:56:29,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:56:29,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:56:29,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:56:29,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 21:56:29,530 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:56:29,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:56:29,530 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:56:29,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:56:29,531 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:56:29,531 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:56:29,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:56:29,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:56:29,532 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:56:29,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:56:29,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:56:29,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:56:29,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:56:29,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:56:29,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:56:29,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:56:29,534 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:56:29,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:56:29,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:56:29,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:56:29,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:56:29,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:56:29,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:56:29,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:56:29,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:56:29,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:56:29,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:56:29,536 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:56:29,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:56:29,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:56:29,536 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 -> 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 [2022-07-19 21:56:29,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:56:29,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:56:29,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:56:29,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:56:29,734 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:56:29,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i [2022-07-19 21:56:29,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c54087ff/383d271c067e4aa3859374b8f33d2108/FLAGe2309f833 [2022-07-19 21:56:30,401 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:56:30,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i [2022-07-19 21:56:30,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c54087ff/383d271c067e4aa3859374b8f33d2108/FLAGe2309f833 [2022-07-19 21:56:30,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c54087ff/383d271c067e4aa3859374b8f33d2108 [2022-07-19 21:56:30,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:56:30,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:56:30,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:56:30,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:56:30,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:56:30,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:56:30" (1/1) ... [2022-07-19 21:56:30,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0d88b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:30, skipping insertion in model container [2022-07-19 21:56:30,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:56:30" (1/1) ... [2022-07-19 21:56:30,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:56:30,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:56:30,855 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_buf_eq_c_str_harness.i[4495,4508] [2022-07-19 21:56:30,860 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_buf_eq_c_str_harness.i[4555,4568] [2022-07-19 21:56:31,518 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,520 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,521 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,522 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,523 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,539 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,540 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,542 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,542 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:31,795 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:56:31,796 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:56:31,797 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:56:31,797 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:56:31,798 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:56:31,799 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:56:31,799 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:56:31,801 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:56:31,801 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:56:31,802 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:56:31,907 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:56:32,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:56:32,095 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:56:32,121 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_buf_eq_c_str_harness.i[4495,4508] [2022-07-19 21:56:32,123 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_buf_eq_c_str_harness.i[4555,4568] [2022-07-19 21:56:32,139 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,139 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,139 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,140 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,140 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,142 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,143 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,143 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,144 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:56:32,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:56:32,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:56:32,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:56:32,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:56:32,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:56:32,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:56:32,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:56:32,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:56:32,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:56:32,184 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:56:32,232 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,233 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:56:32,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:56:32,457 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:56:32,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32 WrapperNode [2022-07-19 21:56:32,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:56:32,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:56:32,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:56:32,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:56:32,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,624 INFO L137 Inliner]: procedures = 691, calls = 2639, calls flagged for inlining = 64, calls inlined = 10, statements flattened = 904 [2022-07-19 21:56:32,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:56:32,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:56:32,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:56:32,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:56:32,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:56:32,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:56:32,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:56:32,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:56:32,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (1/1) ... [2022-07-19 21:56:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:56:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:32,738 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-19 21:56:32,756 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-19 21:56:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2022-07-19 21:56:32,782 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2022-07-19 21:56:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-19 21:56:32,782 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-19 21:56:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:56:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 21:56:32,783 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 21:56:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:56:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 21:56:32,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 21:56:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:56:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:56:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-19 21:56:32,784 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-19 21:56:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 21:56:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:56:32,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:56:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 21:56:32,784 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 21:56:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-19 21:56:32,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-19 21:56:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 21:56:32,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 21:56:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:56:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 21:56:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 21:56:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 21:56:32,785 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 21:56:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 21:56:32,785 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 21:56:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:56:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:56:32,972 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:56:32,973 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:56:33,788 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:56:33,798 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:56:33,798 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 21:56:33,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:56:33 BoogieIcfgContainer [2022-07-19 21:56:33,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:56:33,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:56:33,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:56:33,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:56:33,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:56:30" (1/3) ... [2022-07-19 21:56:33,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fcbc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:56:33, skipping insertion in model container [2022-07-19 21:56:33,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:56:32" (2/3) ... [2022-07-19 21:56:33,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fcbc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:56:33, skipping insertion in model container [2022-07-19 21:56:33,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:56:33" (3/3) ... [2022-07-19 21:56:33,808 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_c_str_harness.i [2022-07-19 21:56:33,820 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:56:33,820 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:56:33,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:56:33,882 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@75da4641, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@598faf83 [2022-07-19 21:56:33,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 21:56:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 96 states have internal predecessors, (118), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-07-19 21:56:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 21:56:33,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:33,898 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 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] [2022-07-19 21:56:33,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1244186500, now seen corresponding path program 1 times [2022-07-19 21:56:33,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:33,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119093206] [2022-07-19 21:56:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 21:56:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:56:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:56:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:56:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:56:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-19 21:56:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:34,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119093206] [2022-07-19 21:56:34,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119093206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:34,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:56:34,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:56:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673090211] [2022-07-19 21:56:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:34,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:56:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:34,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:56:34,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:56:34,625 INFO L87 Difference]: Start difference. First operand has 142 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 96 states have internal predecessors, (118), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:34,982 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2022-07-19 21:56:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:56:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-19 21:56:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:34,997 INFO L225 Difference]: With dead ends: 281 [2022-07-19 21:56:34,997 INFO L226 Difference]: Without dead ends: 139 [2022-07-19 21:56:35,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:56:35,008 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 119 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:35,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 254 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:56:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-19 21:56:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-07-19 21:56:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 91 states have internal predecessors, (110), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-19 21:56:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2022-07-19 21:56:35,058 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 127 [2022-07-19 21:56:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:35,058 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2022-07-19 21:56:35,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2022-07-19 21:56:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 21:56:35,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:35,065 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 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] [2022-07-19 21:56:35,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:56:35,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1259852002, now seen corresponding path program 1 times [2022-07-19 21:56:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:35,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274555304] [2022-07-19 21:56:35,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 21:56:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:56:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:56:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:56:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:56:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-19 21:56:35,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:35,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274555304] [2022-07-19 21:56:35,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274555304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:35,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469291754] [2022-07-19 21:56:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:35,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:35,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:35,391 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-19 21:56:35,427 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-19 21:56:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:56:35,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-19 21:56:35,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:35,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469291754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:35,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:35,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-19 21:56:35,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353245887] [2022-07-19 21:56:35,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:35,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:56:35,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:35,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:56:35,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:56:35,972 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:56:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:36,108 INFO L93 Difference]: Finished difference Result 244 states and 327 transitions. [2022-07-19 21:56:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:56:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 127 [2022-07-19 21:56:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:36,110 INFO L225 Difference]: With dead ends: 244 [2022-07-19 21:56:36,110 INFO L226 Difference]: Without dead ends: 140 [2022-07-19 21:56:36,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:56:36,111 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 208 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:36,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 368 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:56:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-19 21:56:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-19 21:56:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 94 states have internal predecessors, (112), 36 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (37), 35 states have call predecessors, (37), 35 states have call successors, (37) [2022-07-19 21:56:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2022-07-19 21:56:36,123 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 127 [2022-07-19 21:56:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:36,124 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2022-07-19 21:56:36,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:56:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2022-07-19 21:56:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-19 21:56:36,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:36,125 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 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] [2022-07-19 21:56:36,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:36,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:36,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2087307667, now seen corresponding path program 1 times [2022-07-19 21:56:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:36,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786781492] [2022-07-19 21:56:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:56:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:56:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 21:56:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-19 21:56:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:36,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786781492] [2022-07-19 21:56:36,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786781492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:36,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50835267] [2022-07-19 21:56:36,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:36,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:36,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:36,683 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-19 21:56:36,684 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-19 21:56:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:56:37,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-19 21:56:37,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:37,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50835267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:37,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:37,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-19 21:56:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546146655] [2022-07-19 21:56:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:37,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:56:37,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:56:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:56:37,170 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 21:56:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:37,349 INFO L93 Difference]: Finished difference Result 231 states and 306 transitions. [2022-07-19 21:56:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:56:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 133 [2022-07-19 21:56:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:37,351 INFO L225 Difference]: With dead ends: 231 [2022-07-19 21:56:37,352 INFO L226 Difference]: Without dead ends: 137 [2022-07-19 21:56:37,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:56:37,353 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 232 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:37,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 589 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:56:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-19 21:56:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-19 21:56:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.211111111111111) internal successors, (109), 91 states have internal predecessors, (109), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-19 21:56:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2022-07-19 21:56:37,361 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 133 [2022-07-19 21:56:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:37,361 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2022-07-19 21:56:37,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 21:56:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2022-07-19 21:56:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-19 21:56:37,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:37,363 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 21:56:37,385 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-19 21:56:37,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-19 21:56:37,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash 388826435, now seen corresponding path program 1 times [2022-07-19 21:56:37,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:37,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975840453] [2022-07-19 21:56:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:56:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:56:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 21:56:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-07-19 21:56:37,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975840453] [2022-07-19 21:56:37,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975840453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:37,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:56:37,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:56:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121740274] [2022-07-19 21:56:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:37,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:56:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:56:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:56:37,966 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 21:56:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:38,487 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2022-07-19 21:56:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:56:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2022-07-19 21:56:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:38,489 INFO L225 Difference]: With dead ends: 151 [2022-07-19 21:56:38,489 INFO L226 Difference]: Without dead ends: 149 [2022-07-19 21:56:38,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:56:38,489 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 147 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:38,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 692 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:56:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-19 21:56:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-07-19 21:56:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 98 states have internal predecessors, (115), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2022-07-19 21:56:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2022-07-19 21:56:38,498 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 145 [2022-07-19 21:56:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:38,498 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2022-07-19 21:56:38,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 21:56:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2022-07-19 21:56:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 21:56:38,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:38,500 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 21:56:38,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:56:38,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1495986421, now seen corresponding path program 1 times [2022-07-19 21:56:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:38,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910528654] [2022-07-19 21:56:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:56:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:56:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 21:56:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-19 21:56:38,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:38,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910528654] [2022-07-19 21:56:38,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910528654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:38,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:56:38,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:56:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128750119] [2022-07-19 21:56:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:38,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:56:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:56:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:56:38,912 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 21:56:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:39,296 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2022-07-19 21:56:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:56:39,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2022-07-19 21:56:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:39,298 INFO L225 Difference]: With dead ends: 286 [2022-07-19 21:56:39,298 INFO L226 Difference]: Without dead ends: 173 [2022-07-19 21:56:39,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:56:39,299 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 214 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:39,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 381 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:56:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-19 21:56:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 151. [2022-07-19 21:56:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2022-07-19 21:56:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2022-07-19 21:56:39,308 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 149 [2022-07-19 21:56:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:39,308 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2022-07-19 21:56:39,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 21:56:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2022-07-19 21:56:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 21:56:39,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:39,310 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 21:56:39,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:56:39,310 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1237820983, now seen corresponding path program 1 times [2022-07-19 21:56:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:39,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838195545] [2022-07-19 21:56:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:56:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:56:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 21:56:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-19 21:56:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:39,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838195545] [2022-07-19 21:56:39,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838195545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:39,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807070449] [2022-07-19 21:56:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:39,784 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-19 21:56:39,795 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-19 21:56:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:40,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 2786 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 21:56:40,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:40,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 21:56:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-19 21:56:40,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:40,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807070449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:40,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:40,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 21 [2022-07-19 21:56:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128682948] [2022-07-19 21:56:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:40,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:56:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:56:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-07-19 21:56:40,609 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-19 21:56:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:41,107 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2022-07-19 21:56:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 21:56:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 149 [2022-07-19 21:56:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:41,109 INFO L225 Difference]: With dead ends: 425 [2022-07-19 21:56:41,110 INFO L226 Difference]: Without dead ends: 323 [2022-07-19 21:56:41,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 176 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2022-07-19 21:56:41,111 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 210 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:41,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1204 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 831 Invalid, 0 Unknown, 354 Unchecked, 0.4s Time] [2022-07-19 21:56:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-19 21:56:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 189. [2022-07-19 21:56:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 131 states have (on average 1.2213740458015268) internal successors, (160), 135 states have internal predecessors, (160), 41 states have call successors, (41), 13 states have call predecessors, (41), 16 states have return successors, (50), 40 states have call predecessors, (50), 40 states have call successors, (50) [2022-07-19 21:56:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 251 transitions. [2022-07-19 21:56:41,132 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 251 transitions. Word has length 149 [2022-07-19 21:56:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:41,132 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 251 transitions. [2022-07-19 21:56:41,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-19 21:56:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 251 transitions. [2022-07-19 21:56:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 21:56:41,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:41,133 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 21:56:41,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 21:56:41,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:41,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 23096267, now seen corresponding path program 1 times [2022-07-19 21:56:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:41,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512842529] [2022-07-19 21:56:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:56:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:56:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 21:56:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-19 21:56:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:41,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512842529] [2022-07-19 21:56:41,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512842529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:41,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957181863] [2022-07-19 21:56:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:41,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:41,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:41,548 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-19 21:56:41,586 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-19 21:56:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:41,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:56:41,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-19 21:56:41,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:41,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957181863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:41,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:41,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 21:56:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144764394] [2022-07-19 21:56:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:41,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:56:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:56:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:56:41,934 INFO L87 Difference]: Start difference. First operand 189 states and 251 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:41,953 INFO L93 Difference]: Finished difference Result 351 states and 471 transitions. [2022-07-19 21:56:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:56:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2022-07-19 21:56:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:41,955 INFO L225 Difference]: With dead ends: 351 [2022-07-19 21:56:41,955 INFO L226 Difference]: Without dead ends: 198 [2022-07-19 21:56:41,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:56:41,956 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 20 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:41,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:56:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-19 21:56:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2022-07-19 21:56:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.2109375) internal successors, (155), 131 states have internal predecessors, (155), 41 states have call successors, (41), 13 states have call predecessors, (41), 15 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-19 21:56:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 244 transitions. [2022-07-19 21:56:41,968 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 244 transitions. Word has length 149 [2022-07-19 21:56:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:41,969 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 244 transitions. [2022-07-19 21:56:41,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2022-07-19 21:56:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 21:56:41,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:41,970 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 21:56:41,990 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-19 21:56:42,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:42,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1116974037, now seen corresponding path program 1 times [2022-07-19 21:56:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:42,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325388374] [2022-07-19 21:56:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:56:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:56:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 21:56:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 21:56:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:56:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:56:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 21:56:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-19 21:56:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325388374] [2022-07-19 21:56:42,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325388374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170991313] [2022-07-19 21:56:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:42,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:42,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:42,930 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-19 21:56:42,931 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-19 21:56:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:43,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 2831 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 21:56:43,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:43,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 21:56:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-19 21:56:43,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:43,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170991313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:43,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:43,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2022-07-19 21:56:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107589888] [2022-07-19 21:56:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:43,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:56:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:56:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:56:43,565 INFO L87 Difference]: Start difference. First operand 185 states and 244 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 10 states have internal predecessors, (74), 5 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2022-07-19 21:56:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:43,733 INFO L93 Difference]: Finished difference Result 325 states and 425 transitions. [2022-07-19 21:56:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:56:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 10 states have internal predecessors, (74), 5 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 156 [2022-07-19 21:56:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:43,735 INFO L225 Difference]: With dead ends: 325 [2022-07-19 21:56:43,735 INFO L226 Difference]: Without dead ends: 172 [2022-07-19 21:56:43,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:56:43,736 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 88 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:43,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1016 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-07-19 21:56:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-19 21:56:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-19 21:56:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 113 states have internal predecessors, (136), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (39), 36 states have call predecessors, (39), 36 states have call successors, (39) [2022-07-19 21:56:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2022-07-19 21:56:43,744 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 156 [2022-07-19 21:56:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:43,745 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2022-07-19 21:56:43,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 10 states have internal predecessors, (74), 5 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2022-07-19 21:56:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2022-07-19 21:56:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 21:56:43,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:43,746 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:56:43,784 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-19 21:56:43,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:43,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:43,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1622537167, now seen corresponding path program 2 times [2022-07-19 21:56:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:43,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542703858] [2022-07-19 21:56:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:56:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:56:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 21:56:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 21:56:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 21:56:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:56:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 21:56:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 21:56:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 21:56:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:44,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542703858] [2022-07-19 21:56:44,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542703858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562508140] [2022-07-19 21:56:44,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:56:44,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:44,288 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-19 21:56:44,326 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-19 21:56:44,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:56:44,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:56:44,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 21:56:44,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-19 21:56:44,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:44,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562508140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:44,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:44,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-19 21:56:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658193037] [2022-07-19 21:56:44,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:44,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:56:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:44,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:56:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:56:44,751 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:56:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:44,869 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2022-07-19 21:56:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:56:44,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2022-07-19 21:56:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:44,870 INFO L225 Difference]: With dead ends: 289 [2022-07-19 21:56:44,870 INFO L226 Difference]: Without dead ends: 167 [2022-07-19 21:56:44,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:56:44,871 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 12 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:44,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1291 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:56:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-19 21:56:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-19 21:56:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.206896551724138) internal successors, (140), 118 states have internal predecessors, (140), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-19 21:56:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 219 transitions. [2022-07-19 21:56:44,879 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 219 transitions. Word has length 153 [2022-07-19 21:56:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:44,879 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 219 transitions. [2022-07-19 21:56:44,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:56:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 219 transitions. [2022-07-19 21:56:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 21:56:44,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:44,880 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:56:44,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:45,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:45,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:45,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash -251458092, now seen corresponding path program 1 times [2022-07-19 21:56:45,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:45,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272859873] [2022-07-19 21:56:45,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:56:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:56:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:56:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:56:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 21:56:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-07-19 21:56:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:45,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272859873] [2022-07-19 21:56:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272859873] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:45,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849375778] [2022-07-19 21:56:45,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:45,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:45,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:45,336 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-19 21:56:45,337 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-19 21:56:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:45,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:56:45,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-19 21:56:45,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:45,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849375778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:45,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:45,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 21:56:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085133687] [2022-07-19 21:56:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:45,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:56:45,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:45,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:56:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:56:45,727 INFO L87 Difference]: Start difference. First operand 167 states and 219 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:45,748 INFO L93 Difference]: Finished difference Result 299 states and 397 transitions. [2022-07-19 21:56:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:56:45,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-07-19 21:56:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:45,749 INFO L225 Difference]: With dead ends: 299 [2022-07-19 21:56:45,750 INFO L226 Difference]: Without dead ends: 170 [2022-07-19 21:56:45,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:56:45,750 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:45,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 525 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:56:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-19 21:56:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2022-07-19 21:56:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 118 states have internal predecessors, (138), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-19 21:56:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 217 transitions. [2022-07-19 21:56:45,758 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 217 transitions. Word has length 155 [2022-07-19 21:56:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:45,759 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 217 transitions. [2022-07-19 21:56:45,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 217 transitions. [2022-07-19 21:56:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 21:56:45,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:45,760 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:56:45,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-19 21:56:45,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:45,980 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1378113304, now seen corresponding path program 1 times [2022-07-19 21:56:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:45,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171496474] [2022-07-19 21:56:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:56:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:56:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:56:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:56:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 21:56:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 21:56:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:46,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171496474] [2022-07-19 21:56:46,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171496474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:46,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612061510] [2022-07-19 21:56:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:46,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:46,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:46,204 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-19 21:56:46,220 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-19 21:56:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:46,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 2800 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:56:46,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-19 21:56:46,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:46,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612061510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:46,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:46,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 21:56:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444184218] [2022-07-19 21:56:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:46,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:56:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:46,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:56:46,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:56:46,624 INFO L87 Difference]: Start difference. First operand 167 states and 217 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:46,643 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2022-07-19 21:56:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:56:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-07-19 21:56:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:46,644 INFO L225 Difference]: With dead ends: 305 [2022-07-19 21:56:46,644 INFO L226 Difference]: Without dead ends: 176 [2022-07-19 21:56:46,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:56:46,645 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 34 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:46,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 523 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:56:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-19 21:56:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 163. [2022-07-19 21:56:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 112 states have (on average 1.1696428571428572) internal successors, (131), 114 states have internal predecessors, (131), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-19 21:56:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2022-07-19 21:56:46,652 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 155 [2022-07-19 21:56:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:46,653 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2022-07-19 21:56:46,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:56:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2022-07-19 21:56:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 21:56:46,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:46,654 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:56:46,681 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-19 21:56:46,859 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-19 21:56:46,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1565468774, now seen corresponding path program 1 times [2022-07-19 21:56:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:46,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483474498] [2022-07-19 21:56:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:56:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:56:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:56:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:56:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 21:56:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-19 21:56:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483474498] [2022-07-19 21:56:47,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483474498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402925754] [2022-07-19 21:56:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:47,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:47,379 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-19 21:56:47,424 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-19 21:56:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:47,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 21:56:47,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:47,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 21:56:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-19 21:56:48,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:48,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402925754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:48,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:48,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 21 [2022-07-19 21:56:48,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318526085] [2022-07-19 21:56:48,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:48,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:56:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:48,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:56:48,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-07-19 21:56:48,277 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-19 21:56:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:48,806 INFO L93 Difference]: Finished difference Result 372 states and 489 transitions. [2022-07-19 21:56:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 21:56:48,807 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 155 [2022-07-19 21:56:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:48,808 INFO L225 Difference]: With dead ends: 372 [2022-07-19 21:56:48,808 INFO L226 Difference]: Without dead ends: 257 [2022-07-19 21:56:48,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 187 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2022-07-19 21:56:48,809 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 118 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:48,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1043 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 643 Invalid, 0 Unknown, 459 Unchecked, 0.4s Time] [2022-07-19 21:56:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-19 21:56:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 204. [2022-07-19 21:56:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 147 states have (on average 1.1700680272108843) internal successors, (172), 151 states have internal predecessors, (172), 39 states have call successors, (39), 14 states have call predecessors, (39), 17 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2022-07-19 21:56:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2022-07-19 21:56:48,824 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 261 transitions. Word has length 155 [2022-07-19 21:56:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:48,828 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 261 transitions. [2022-07-19 21:56:48,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-19 21:56:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 261 transitions. [2022-07-19 21:56:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 21:56:48,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:48,830 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:56:48,853 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-19 21:56:49,051 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-19 21:56:49,051 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1596313372, now seen corresponding path program 1 times [2022-07-19 21:56:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456991626] [2022-07-19 21:56:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:56:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:56:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:56:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:56:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:56:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:56:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:56:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:56:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:56:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:56:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:56:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:56:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 21:56:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-07-19 21:56:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456991626] [2022-07-19 21:56:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456991626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059066615] [2022-07-19 21:56:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:49,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:49,767 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-19 21:56:49,780 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-19 21:56:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:50,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 21:56:50,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:50,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:56:50,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 21:56:50,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:56:50,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 21:56:50,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 21:56:50,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:56:50,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 21:56:50,718 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-19 21:56:51,057 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 21:56:51,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 21:56:51,107 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 10 treesize of output 6 [2022-07-19 21:56:51,244 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 21:56:51,244 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 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 21:56:51,352 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-19 21:56:51,376 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_831 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_831) |c_#memory_int|)) is different from true [2022-07-19 21:56:51,382 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 19 treesize of output 21 [2022-07-19 21:57:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 74 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 2 not checked. [2022-07-19 21:57:02,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:57:02,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-19 21:57:02,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059066615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:02,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:57:02,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 29] total 41 [2022-07-19 21:57:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149022659] [2022-07-19 21:57:02,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:57:02,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 21:57:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:02,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 21:57:02,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1816, Unknown=4, NotChecked=174, Total=2162 [2022-07-19 21:57:02,657 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand has 41 states, 38 states have (on average 4.421052631578948) internal successors, (168), 34 states have internal predecessors, (168), 16 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2022-07-19 21:57:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:11,891 INFO L93 Difference]: Finished difference Result 522 states and 710 transitions. [2022-07-19 21:57:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-19 21:57:11,892 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 4.421052631578948) internal successors, (168), 34 states have internal predecessors, (168), 16 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) Word has length 162 [2022-07-19 21:57:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:11,894 INFO L225 Difference]: With dead ends: 522 [2022-07-19 21:57:11,894 INFO L226 Difference]: Without dead ends: 434 [2022-07-19 21:57:11,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 227 SyntacticMatches, 20 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2362 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=814, Invalid=6840, Unknown=10, NotChecked=346, Total=8010 [2022-07-19 21:57:11,896 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 342 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 4279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2212 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:11,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2010 Invalid, 4279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1898 Invalid, 0 Unknown, 2212 Unchecked, 1.3s Time] [2022-07-19 21:57:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-19 21:57:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 331. [2022-07-19 21:57:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 240 states have (on average 1.15) internal successors, (276), 248 states have internal predecessors, (276), 61 states have call successors, (61), 23 states have call predecessors, (61), 29 states have return successors, (94), 59 states have call predecessors, (94), 60 states have call successors, (94) [2022-07-19 21:57:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 431 transitions. [2022-07-19 21:57:11,911 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 431 transitions. Word has length 162 [2022-07-19 21:57:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:11,912 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 431 transitions. [2022-07-19 21:57:11,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 4.421052631578948) internal successors, (168), 34 states have internal predecessors, (168), 16 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2022-07-19 21:57:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 431 transitions. [2022-07-19 21:57:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 21:57:11,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:11,914 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:57:11,940 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-19 21:57:12,127 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-19 21:57:12,127 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1418790246, now seen corresponding path program 2 times [2022-07-19 21:57:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:12,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127001154] [2022-07-19 21:57:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:57:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:57:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:57:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:57:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:57:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:57:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:57:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:57:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:57:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:57:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:57:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:57:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 21:57:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-07-19 21:57:12,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:12,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127001154] [2022-07-19 21:57:12,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127001154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:12,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:57:12,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 21:57:12,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086186679] [2022-07-19 21:57:12,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:12,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:57:12,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:12,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:57:12,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:57:12,653 INFO L87 Difference]: Start difference. First operand 331 states and 431 transitions. Second operand has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-19 21:57:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:13,744 INFO L93 Difference]: Finished difference Result 499 states and 666 transitions. [2022-07-19 21:57:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:57:13,745 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2022-07-19 21:57:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:13,747 INFO L225 Difference]: With dead ends: 499 [2022-07-19 21:57:13,747 INFO L226 Difference]: Without dead ends: 403 [2022-07-19 21:57:13,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:57:13,748 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 235 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:13,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 912 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 21:57:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-07-19 21:57:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 348. [2022-07-19 21:57:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 252 states have (on average 1.1468253968253967) internal successors, (289), 262 states have internal predecessors, (289), 64 states have call successors, (64), 23 states have call predecessors, (64), 31 states have return successors, (111), 62 states have call predecessors, (111), 63 states have call successors, (111) [2022-07-19 21:57:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2022-07-19 21:57:13,767 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 162 [2022-07-19 21:57:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:13,767 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2022-07-19 21:57:13,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-19 21:57:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2022-07-19 21:57:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 21:57:13,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:13,769 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:57:13,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 21:57:13,770 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:13,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash -427723094, now seen corresponding path program 1 times [2022-07-19 21:57:13,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:13,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848367249] [2022-07-19 21:57:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:57:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:57:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:57:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:57:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:57:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:57:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:57:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:57:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:57:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:57:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:57:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:57:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 21:57:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-07-19 21:57:14,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:14,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848367249] [2022-07-19 21:57:14,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848367249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:14,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:57:14,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 21:57:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401004544] [2022-07-19 21:57:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:14,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:57:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:57:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:57:14,237 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-19 21:57:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:15,364 INFO L93 Difference]: Finished difference Result 501 states and 675 transitions. [2022-07-19 21:57:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:57:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2022-07-19 21:57:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:15,367 INFO L225 Difference]: With dead ends: 501 [2022-07-19 21:57:15,367 INFO L226 Difference]: Without dead ends: 398 [2022-07-19 21:57:15,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:57:15,368 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 234 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:15,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 849 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 21:57:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-19 21:57:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 353. [2022-07-19 21:57:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 256 states have (on average 1.14453125) internal successors, (293), 267 states have internal predecessors, (293), 64 states have call successors, (64), 23 states have call predecessors, (64), 32 states have return successors, (118), 62 states have call predecessors, (118), 63 states have call successors, (118) [2022-07-19 21:57:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 475 transitions. [2022-07-19 21:57:15,387 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 475 transitions. Word has length 162 [2022-07-19 21:57:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:15,388 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 475 transitions. [2022-07-19 21:57:15,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-19 21:57:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 475 transitions. [2022-07-19 21:57:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 21:57:15,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:15,390 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:57:15,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 21:57:15,390 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash -169557656, now seen corresponding path program 3 times [2022-07-19 21:57:15,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:15,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122202832] [2022-07-19 21:57:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:15,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:57:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:57:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:57:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:57:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:57:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:57:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:57:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:57:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:57:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:57:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:57:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:57:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 21:57:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-07-19 21:57:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:15,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122202832] [2022-07-19 21:57:15,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122202832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:15,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:57:15,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:57:15,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903219110] [2022-07-19 21:57:15,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:15,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:57:15,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:15,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:57:15,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:57:15,770 INFO L87 Difference]: Start difference. First operand 353 states and 475 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 21:57:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:16,170 INFO L93 Difference]: Finished difference Result 495 states and 657 transitions. [2022-07-19 21:57:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:57:16,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2022-07-19 21:57:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:16,172 INFO L225 Difference]: With dead ends: 495 [2022-07-19 21:57:16,172 INFO L226 Difference]: Without dead ends: 351 [2022-07-19 21:57:16,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:57:16,173 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 159 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:16,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 384 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:57:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-19 21:57:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2022-07-19 21:57:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 250 states have (on average 1.136) internal successors, (284), 260 states have internal predecessors, (284), 64 states have call successors, (64), 23 states have call predecessors, (64), 31 states have return successors, (108), 62 states have call predecessors, (108), 63 states have call successors, (108) [2022-07-19 21:57:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 456 transitions. [2022-07-19 21:57:16,190 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 456 transitions. Word has length 162 [2022-07-19 21:57:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:16,190 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 456 transitions. [2022-07-19 21:57:16,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 21:57:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 456 transitions. [2022-07-19 21:57:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 21:57:16,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:16,192 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:57:16,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 21:57:16,192 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1998554157, now seen corresponding path program 1 times [2022-07-19 21:57:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:16,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347688729] [2022-07-19 21:57:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:57:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:57:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:57:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:57:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:57:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:57:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:57:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:57:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:57:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:57:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:57:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:57:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 21:57:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-19 21:57:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:16,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347688729] [2022-07-19 21:57:16,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347688729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:16,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175985921] [2022-07-19 21:57:16,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:16,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:57:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:16,617 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-19 21:57:16,619 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-19 21:57:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:17,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 2839 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-19 21:57:17,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:17,116 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-19 21:57:17,436 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1142 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1142))) is different from true [2022-07-19 21:57:17,438 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-19 21:57:17,446 WARN L855 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1143 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_1143))) is different from true [2022-07-19 21:57:17,473 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:57:17,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-07-19 21:57:17,478 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 15 treesize of output 11 [2022-07-19 21:57:17,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 21:57:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 94 proven. 32 refuted. 0 times theorem prover too weak. 138 trivial. 2 not checked. [2022-07-19 21:57:17,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:57:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-19 21:57:18,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175985921] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:57:18,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:57:18,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 10] total 30 [2022-07-19 21:57:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013548046] [2022-07-19 21:57:18,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:57:18,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 21:57:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 21:57:18,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=679, Unknown=2, NotChecked=106, Total=870 [2022-07-19 21:57:18,248 INFO L87 Difference]: Start difference. First operand 346 states and 456 transitions. Second operand has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 14 states have call successors, (45), 6 states have call predecessors, (45), 7 states have return successors, (40), 11 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-19 21:57:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:22,742 INFO L93 Difference]: Finished difference Result 934 states and 1364 transitions. [2022-07-19 21:57:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 21:57:22,743 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 14 states have call successors, (45), 6 states have call predecessors, (45), 7 states have return successors, (40), 11 states have call predecessors, (40), 14 states have call successors, (40) Word has length 162 [2022-07-19 21:57:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:22,747 INFO L225 Difference]: With dead ends: 934 [2022-07-19 21:57:22,747 INFO L226 Difference]: Without dead ends: 756 [2022-07-19 21:57:22,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 342 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=381, Invalid=2573, Unknown=24, NotChecked=214, Total=3192 [2022-07-19 21:57:22,764 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 542 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 5055 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 6979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 5055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1439 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:22,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1911 Invalid, 6979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 5055 Invalid, 0 Unknown, 1439 Unchecked, 3.5s Time] [2022-07-19 21:57:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-19 21:57:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 444. [2022-07-19 21:57:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 324 states have (on average 1.126543209876543) internal successors, (365), 333 states have internal predecessors, (365), 83 states have call successors, (83), 29 states have call predecessors, (83), 36 states have return successors, (150), 81 states have call predecessors, (150), 82 states have call successors, (150) [2022-07-19 21:57:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 598 transitions. [2022-07-19 21:57:22,804 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 598 transitions. Word has length 162 [2022-07-19 21:57:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:22,805 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 598 transitions. [2022-07-19 21:57:22,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 14 states have call successors, (45), 6 states have call predecessors, (45), 7 states have return successors, (40), 11 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-19 21:57:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 598 transitions. [2022-07-19 21:57:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-19 21:57:22,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:22,807 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 21:57:22,836 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-19 21:57:23,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 21:57:23,023 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1609847333, now seen corresponding path program 1 times [2022-07-19 21:57:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:23,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666342258] [2022-07-19 21:57:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:57:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:57:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:57:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:57:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:57:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:57:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:57:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:57:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:57:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 21:57:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 21:57:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 21:57:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 21:57:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-19 21:57:23,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666342258] [2022-07-19 21:57:23,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666342258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:23,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79418225] [2022-07-19 21:57:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:23,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:57:23,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:23,968 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-19 21:57:23,969 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-19 21:57:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:24,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 2841 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 21:57:24,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:24,519 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-19 21:57:26,574 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-19 21:57:28,580 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1260 Int) (|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1263 Int)) (= (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| v_ArrVal_1260) (+ |c_save_byte_from_array_#in~storage#1.offset| 8) v_ArrVal_1263)) |c_#memory_int|)) is different from true [2022-07-19 21:57:28,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:57:28,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:57:28,598 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-19 21:57:28,598 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 36 treesize of output 46 [2022-07-19 21:57:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 135 proven. 47 refuted. 0 times theorem prover too weak. 90 trivial. 2 not checked. [2022-07-19 21:57:59,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:58:00,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79418225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:00,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:58:00,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 53 [2022-07-19 21:58:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156122170] [2022-07-19 21:58:00,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:58:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-19 21:58:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-19 21:58:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3212, Unknown=8, NotChecked=114, Total=3540 [2022-07-19 21:58:00,399 INFO L87 Difference]: Start difference. First operand 444 states and 598 transitions. Second operand has 53 states, 46 states have (on average 3.3043478260869565) internal successors, (152), 46 states have internal predecessors, (152), 24 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 22 states have call predecessors, (40), 24 states have call successors, (40) [2022-07-19 21:59:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:16,659 INFO L93 Difference]: Finished difference Result 859 states and 1174 transitions. [2022-07-19 21:59:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-19 21:59:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 46 states have (on average 3.3043478260869565) internal successors, (152), 46 states have internal predecessors, (152), 24 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 22 states have call predecessors, (40), 24 states have call successors, (40) Word has length 166 [2022-07-19 21:59:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:16,663 INFO L225 Difference]: With dead ends: 859 [2022-07-19 21:59:16,663 INFO L226 Difference]: Without dead ends: 704 [2022-07-19 21:59:16,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 198 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 107.9s TimeCoverageRelationStatistics Valid=827, Invalid=10453, Unknown=66, NotChecked=210, Total=11556 [2022-07-19 21:59:16,666 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 477 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 6643 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 9306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 6643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2283 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:16,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2445 Invalid, 9306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 6643 Invalid, 0 Unknown, 2283 Unchecked, 4.0s Time] [2022-07-19 21:59:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-07-19 21:59:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 538. [2022-07-19 21:59:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 396 states have (on average 1.1262626262626263) internal successors, (446), 409 states have internal predecessors, (446), 96 states have call successors, (96), 34 states have call predecessors, (96), 45 states have return successors, (174), 94 states have call predecessors, (174), 95 states have call successors, (174) [2022-07-19 21:59:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 716 transitions. [2022-07-19 21:59:16,703 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 716 transitions. Word has length 166 [2022-07-19 21:59:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:16,704 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 716 transitions. [2022-07-19 21:59:16,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 46 states have (on average 3.3043478260869565) internal successors, (152), 46 states have internal predecessors, (152), 24 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 22 states have call predecessors, (40), 24 states have call successors, (40) [2022-07-19 21:59:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 716 transitions. [2022-07-19 21:59:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-19 21:59:16,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:16,707 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:59:16,727 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-19 21:59:16,927 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-19 21:59:16,927 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1758298720, now seen corresponding path program 1 times [2022-07-19 21:59:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:16,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423569586] [2022-07-19 21:59:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:59:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:59:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:59:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:59:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:59:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:59:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:59:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:59:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:59:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:59:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 21:59:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 21:59:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 21:59:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-19 21:59:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:17,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423569586] [2022-07-19 21:59:17,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423569586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:17,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112697123] [2022-07-19 21:59:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:17,281 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-19 21:59:17,282 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-19 21:59:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:17,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 21:59:17,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:17,785 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-19 21:59:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 117 proven. 27 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-19 21:59:18,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-19 21:59:19,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112697123] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:19,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:19,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 11] total 32 [2022-07-19 21:59:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665302984] [2022-07-19 21:59:19,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:19,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 21:59:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 21:59:19,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-07-19 21:59:19,223 INFO L87 Difference]: Start difference. First operand 538 states and 716 transitions. Second operand has 32 states, 30 states have (on average 5.733333333333333) internal successors, (172), 29 states have internal predecessors, (172), 11 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-07-19 21:59:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:23,787 INFO L93 Difference]: Finished difference Result 1062 states and 1441 transitions. [2022-07-19 21:59:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-19 21:59:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 5.733333333333333) internal successors, (172), 29 states have internal predecessors, (172), 11 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 159 [2022-07-19 21:59:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:23,791 INFO L225 Difference]: With dead ends: 1062 [2022-07-19 21:59:23,791 INFO L226 Difference]: Without dead ends: 713 [2022-07-19 21:59:23,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 328 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=616, Invalid=4783, Unknown=3, NotChecked=0, Total=5402 [2022-07-19 21:59:23,795 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 368 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 5315 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 3510 SdHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 5315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 669 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:23,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 3510 Invalid, 6249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 5315 Invalid, 0 Unknown, 669 Unchecked, 3.1s Time] [2022-07-19 21:59:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-07-19 21:59:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 500. [2022-07-19 21:59:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 354 states have (on average 1.115819209039548) internal successors, (395), 361 states have internal predecessors, (395), 102 states have call successors, (102), 38 states have call predecessors, (102), 43 states have return successors, (153), 100 states have call predecessors, (153), 101 states have call successors, (153) [2022-07-19 21:59:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 650 transitions. [2022-07-19 21:59:23,873 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 650 transitions. Word has length 159 [2022-07-19 21:59:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:23,874 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 650 transitions. [2022-07-19 21:59:23,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 5.733333333333333) internal successors, (172), 29 states have internal predecessors, (172), 11 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-07-19 21:59:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 650 transitions. [2022-07-19 21:59:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-19 21:59:23,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:23,876 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 21:59:23,900 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-19 21:59:24,077 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-19 21:59:24,077 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:24,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:24,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1181025098, now seen corresponding path program 1 times [2022-07-19 21:59:24,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:24,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561307928] [2022-07-19 21:59:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:59:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:59:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:59:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 21:59:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 21:59:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:59:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:59:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:59:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:59:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:59:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:59:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 21:59:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-19 21:59:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-19 21:59:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:24,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561307928] [2022-07-19 21:59:24,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561307928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:24,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176336673] [2022-07-19 21:59:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:24,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:24,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:24,995 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-19 21:59:25,015 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-19 21:59:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 2857 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-19 21:59:25,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:25,820 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1438 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1438) |c_#memory_int|)) is different from true [2022-07-19 21:59:25,821 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-19 21:59:25,828 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1439 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int)) (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_1439) |c_#memory_int|)) is different from true [2022-07-19 21:59:25,841 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:25,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 21:59:25,845 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 7 treesize of output 5 [2022-07-19 21:59:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 135 proven. 40 refuted. 0 times theorem prover too weak. 99 trivial. 2 not checked. [2022-07-19 21:59:43,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-07-19 21:59:44,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176336673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:44,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:44,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 12] total 57 [2022-07-19 21:59:44,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259370] [2022-07-19 21:59:44,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:44,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-19 21:59:44,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-19 21:59:44,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2784, Unknown=4, NotChecked=214, Total=3192 [2022-07-19 21:59:44,441 INFO L87 Difference]: Start difference. First operand 500 states and 650 transitions. Second operand has 57 states, 52 states have (on average 4.0) internal successors, (208), 53 states have internal predecessors, (208), 20 states have call successors, (60), 7 states have call predecessors, (60), 15 states have return successors, (59), 18 states have call predecessors, (59), 20 states have call successors, (59) [2022-07-19 22:00:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:05,078 INFO L93 Difference]: Finished difference Result 1195 states and 1659 transitions. [2022-07-19 22:00:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-19 22:00:05,086 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 4.0) internal successors, (208), 53 states have internal predecessors, (208), 20 states have call successors, (60), 7 states have call predecessors, (60), 15 states have return successors, (59), 18 states have call predecessors, (59), 20 states have call successors, (59) Word has length 169 [2022-07-19 22:00:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:05,091 INFO L225 Difference]: With dead ends: 1195 [2022-07-19 22:00:05,092 INFO L226 Difference]: Without dead ends: 989 [2022-07-19 22:00:05,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 360 SyntacticMatches, 16 SemanticMatches, 128 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4431 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=1304, Invalid=14934, Unknown=26, NotChecked=506, Total=16770 [2022-07-19 22:00:05,097 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 1418 mSDsluCounter, 3974 mSDsCounter, 0 mSdLazyCounter, 13906 mSolverCounterSat, 1657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 19006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1657 IncrementalHoareTripleChecker+Valid, 13906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3443 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:05,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 4267 Invalid, 19006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1657 Valid, 13906 Invalid, 0 Unknown, 3443 Unchecked, 10.0s Time] [2022-07-19 22:00:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-07-19 22:00:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 537. [2022-07-19 22:00:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 383 states have (on average 1.1018276762402088) internal successors, (422), 388 states have internal predecessors, (422), 108 states have call successors, (108), 42 states have call predecessors, (108), 45 states have return successors, (147), 106 states have call predecessors, (147), 107 states have call successors, (147) [2022-07-19 22:00:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 677 transitions. [2022-07-19 22:00:05,152 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 677 transitions. Word has length 169 [2022-07-19 22:00:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:05,152 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 677 transitions. [2022-07-19 22:00:05,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 4.0) internal successors, (208), 53 states have internal predecessors, (208), 20 states have call successors, (60), 7 states have call predecessors, (60), 15 states have return successors, (59), 18 states have call predecessors, (59), 20 states have call successors, (59) [2022-07-19 22:00:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 677 transitions. [2022-07-19 22:00:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-19 22:00:05,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:05,155 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:00:05,176 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-19 22:00:05,375 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-19 22:00:05,375 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash -61569311, now seen corresponding path program 1 times [2022-07-19 22:00:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:05,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773485500] [2022-07-19 22:00:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:00:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:00:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:00:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:00:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 22:00:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:00:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:00:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:00:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:00:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:00:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 22:00:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:00:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:00:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 22:00:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 22:00:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:00:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:00:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-07-19 22:00:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:06,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773485500] [2022-07-19 22:00:06,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773485500] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:06,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280614564] [2022-07-19 22:00:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:06,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:06,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:00:06,508 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-19 22:00:06,510 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-19 22:00:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:06,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 2853 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-19 22:00:06,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:00:06,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:00:07,151 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:00:07,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:00:07,475 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:00:07,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:00:07,482 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-19 22:00:07,831 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 22:00:07,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 22:00:07,883 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 10 treesize of output 6 [2022-07-19 22:00:08,028 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 22:00:08,028 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 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 22:00:08,144 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-19 22:00:08,151 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1563 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_1563) |c_#memory_int|)) is different from true [2022-07-19 22:00:08,156 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 19 treesize of output 21 [2022-07-19 22:00:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 86 proven. 124 refuted. 0 times theorem prover too weak. 54 trivial. 2 not checked. [2022-07-19 22:00:29,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:00:29,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1567 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.base| v_ArrVal_1567) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-19 22:00:29,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280614564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:29,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:00:29,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 40 [2022-07-19 22:00:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020264656] [2022-07-19 22:00:29,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:00:29,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 22:00:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 22:00:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1741, Unknown=5, NotChecked=170, Total=2070 [2022-07-19 22:00:29,294 INFO L87 Difference]: Start difference. First operand 537 states and 677 transitions. Second operand has 40 states, 36 states have (on average 4.833333333333333) internal successors, (174), 35 states have internal predecessors, (174), 17 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (42), 14 states have call predecessors, (42), 16 states have call successors, (42) [2022-07-19 22:00:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:35,813 INFO L93 Difference]: Finished difference Result 921 states and 1212 transitions. [2022-07-19 22:00:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-19 22:00:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 4.833333333333333) internal successors, (174), 35 states have internal predecessors, (174), 17 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (42), 14 states have call predecessors, (42), 16 states have call successors, (42) Word has length 167 [2022-07-19 22:00:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:35,817 INFO L225 Difference]: With dead ends: 921 [2022-07-19 22:00:35,817 INFO L226 Difference]: Without dead ends: 757 [2022-07-19 22:00:35,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 231 SyntacticMatches, 25 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1930 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=450, Invalid=5710, Unknown=10, NotChecked=310, Total=6480 [2022-07-19 22:00:35,819 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 453 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 5473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2218 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:35,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3007 Invalid, 5473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2881 Invalid, 0 Unknown, 2218 Unchecked, 1.4s Time] [2022-07-19 22:00:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-07-19 22:00:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 482. [2022-07-19 22:00:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 348 states have (on average 1.1005747126436782) internal successors, (383), 353 states have internal predecessors, (383), 88 states have call successors, (88), 42 states have call predecessors, (88), 45 states have return successors, (110), 86 states have call predecessors, (110), 87 states have call successors, (110) [2022-07-19 22:00:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 581 transitions. [2022-07-19 22:00:35,859 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 581 transitions. Word has length 167 [2022-07-19 22:00:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:35,859 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 581 transitions. [2022-07-19 22:00:35,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 4.833333333333333) internal successors, (174), 35 states have internal predecessors, (174), 17 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (42), 14 states have call predecessors, (42), 16 states have call successors, (42) [2022-07-19 22:00:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 581 transitions. [2022-07-19 22:00:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-19 22:00:35,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:35,861 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:00:35,895 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-19 22:00:36,095 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-19 22:00:36,096 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2050665169, now seen corresponding path program 1 times [2022-07-19 22:00:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:36,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063010761] [2022-07-19 22:00:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:00:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:00:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:00:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:00:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 22:00:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:00:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:00:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:00:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:00:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:00:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:00:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:00:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:00:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:00:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:00:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:00:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-19 22:00:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:36,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063010761] [2022-07-19 22:00:36,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063010761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:00:36,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:00:36,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 22:00:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863470805] [2022-07-19 22:00:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:00:36,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 22:00:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:36,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 22:00:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:00:36,355 INFO L87 Difference]: Start difference. First operand 482 states and 581 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 22:00:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:36,900 INFO L93 Difference]: Finished difference Result 490 states and 589 transitions. [2022-07-19 22:00:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:00:36,904 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2022-07-19 22:00:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:36,906 INFO L225 Difference]: With dead ends: 490 [2022-07-19 22:00:36,906 INFO L226 Difference]: Without dead ends: 488 [2022-07-19 22:00:36,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:00:36,907 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 154 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:36,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 845 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:00:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-07-19 22:00:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 481. [2022-07-19 22:00:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 348 states have (on average 1.1005747126436782) internal successors, (383), 353 states have internal predecessors, (383), 87 states have call successors, (87), 42 states have call predecessors, (87), 45 states have return successors, (109), 85 states have call predecessors, (109), 86 states have call successors, (109) [2022-07-19 22:00:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 579 transitions. [2022-07-19 22:00:36,959 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 579 transitions. Word has length 164 [2022-07-19 22:00:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:36,959 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 579 transitions. [2022-07-19 22:00:36,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 22:00:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 579 transitions. [2022-07-19 22:00:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-19 22:00:36,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:36,962 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-07-19 22:00:36,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 22:00:36,962 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash 969726479, now seen corresponding path program 1 times [2022-07-19 22:00:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:36,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823563162] [2022-07-19 22:00:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:00:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:00:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:00:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:00:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 22:00:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:00:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:00:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:00:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:00:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:00:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:00:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:00:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:00:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:00:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:00:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:00:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:00:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-19 22:00:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:37,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823563162] [2022-07-19 22:00:37,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823563162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:37,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067749042] [2022-07-19 22:00:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:37,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:37,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:00:37,969 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-19 22:00:37,973 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-19 22:00:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:38,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 2849 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-19 22:00:38,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:00:38,559 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-19 22:00:38,562 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-19 22:00:52,162 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-19 22:00:52,164 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-19 22:00:52,174 WARN L855 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1751 (Array Int Int)) (v_ArrVal_1752 Int) (v_ArrVal_1747 Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_1751)) (= (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| v_ArrVal_1747) (+ |c_save_byte_from_array_#in~storage#1.offset| 8) v_ArrVal_1752)) |c_#memory_int|))) is different from true [2022-07-19 22:00:52,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:52,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:52,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-19 22:00:52,199 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:00:52,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21