./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_array_eq_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 c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:03:33,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:03:33,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:03:33,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:03:33,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:03:33,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:03:33,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:03:33,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:03:33,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:03:33,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:03:33,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:03:33,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:03:33,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:03:33,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:03:33,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:03:33,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:03:33,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:03:33,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:03:33,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:03:33,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:03:33,663 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:03:33,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:03:33,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:03:33,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:03:33,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:03:33,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:03:33,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:03:33,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:03:33,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:03:33,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:03:33,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:03:33,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:03:33,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:03:33,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:03:33,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:03:33,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:03:33,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:03:33,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:03:33,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:03:33,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:03:33,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:03:33,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:03:33,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:03:33,715 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:03:33,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:03:33,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:03:33,716 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:03:33,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:03:33,717 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:03:33,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:03:33,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:03:33,718 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:03:33,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:03:33,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:03:33,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:03:33,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:03:33,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:03:33,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:03:33,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:03:33,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:03:33,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:03:33,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:03:33,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:03:33,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:03:33,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:03:33,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:03:33,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:03:33,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:03:33,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:03:33,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:03:33,722 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:03:33,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:03:33,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:03:33,723 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 -> c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 [2022-07-22 22:03:33,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:03:33,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:03:33,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:03:33,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:03:33,970 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:03:33,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2022-07-22 22:03:34,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4304fb765/1f4a58159f1c4971b328d5b631205d8c/FLAG44e6bfdf7 [2022-07-22 22:03:34,654 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:03:34,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2022-07-22 22:03:34,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4304fb765/1f4a58159f1c4971b328d5b631205d8c/FLAG44e6bfdf7 [2022-07-22 22:03:35,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4304fb765/1f4a58159f1c4971b328d5b631205d8c [2022-07-22 22:03:35,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:03:35,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:03:35,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:03:35,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:03:35,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:03:35,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:03:35" (1/1) ... [2022-07-22 22:03:35,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28266a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:35, skipping insertion in model container [2022-07-22 22:03:35,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:03:35" (1/1) ... [2022-07-22 22:03:35,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:03:35,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:03:35,357 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_array_eq_harness.i[4486,4499] [2022-07-22 22:03:35,363 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_array_eq_harness.i[4546,4559] [2022-07-22 22:03:35,972 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,973 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,974 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,974 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,975 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,988 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:35,988 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,227 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:03:36,229 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:03:36,231 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:03:36,233 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:03:36,237 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:03:36,238 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:03:36,241 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:03:36,242 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:03:36,243 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:03:36,245 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:03:36,360 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:03:36,449 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,450 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:03:36,560 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:03:36,571 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_array_eq_harness.i[4486,4499] [2022-07-22 22:03:36,572 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_array_eq_harness.i[4546,4559] [2022-07-22 22:03:36,614 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,615 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,615 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,616 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,616 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,633 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,635 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,635 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,636 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,671 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:03:36,672 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:03:36,672 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:03:36,673 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:03:36,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:03:36,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:03:36,677 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:03:36,677 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:03:36,677 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:03:36,678 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:03:36,706 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:03:36,788 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,788 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:03:36,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:03:37,025 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:03:37,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37 WrapperNode [2022-07-22 22:03:37,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:03:37,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:03:37,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:03:37,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:03:37,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,215 INFO L137 Inliner]: procedures = 691, calls = 2616, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 790 [2022-07-22 22:03:37,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:03:37,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:03:37,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:03:37,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:03:37,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:03:37,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:03:37,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:03:37,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:03:37,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (1/1) ... [2022-07-22 22:03:37,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:03:37,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:03:37,360 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-22 22:03:37,387 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-22 22:03:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-22 22:03:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:03:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:03:37,402 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:03:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:03:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:03:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:03:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:03:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:03:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-22 22:03:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-22 22:03:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:03:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:03:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:03:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:03:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-22 22:03:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-22 22:03:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-22 22:03:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-22 22:03:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:03:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:03:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:03:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-22 22:03:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-22 22:03:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:03:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:03:37,408 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:03:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:03:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:03:37,636 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:03:37,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:03:38,491 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:03:38,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:03:38,503 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 22:03:38,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:03:38 BoogieIcfgContainer [2022-07-22 22:03:38,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:03:38,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:03:38,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:03:38,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:03:38,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:03:35" (1/3) ... [2022-07-22 22:03:38,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2048cc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:03:38, skipping insertion in model container [2022-07-22 22:03:38,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:03:37" (2/3) ... [2022-07-22 22:03:38,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2048cc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:03:38, skipping insertion in model container [2022-07-22 22:03:38,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:03:38" (3/3) ... [2022-07-22 22:03:38,514 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_harness.i [2022-07-22 22:03:38,527 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:03:38,528 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:03:38,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:03:38,597 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@4493b183, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1990b60d [2022-07-22 22:03:38,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:03:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-22 22:03:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 22:03:38,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:38,612 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:03:38,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1074851773, now seen corresponding path program 1 times [2022-07-22 22:03:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:38,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038259456] [2022-07-22 22:03:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:03:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:03:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:03:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:03:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038259456] [2022-07-22 22:03:39,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038259456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:39,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:03:39,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:03:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130904491] [2022-07-22 22:03:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:39,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:03:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:03:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:03:39,501 INFO L87 Difference]: Start difference. First operand has 87 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:03:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:39,822 INFO L93 Difference]: Finished difference Result 176 states and 252 transitions. [2022-07-22 22:03:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:03:39,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 65 [2022-07-22 22:03:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:39,832 INFO L225 Difference]: With dead ends: 176 [2022-07-22 22:03:39,832 INFO L226 Difference]: Without dead ends: 87 [2022-07-22 22:03:39,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:03:39,839 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:39,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 149 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:03:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-22 22:03:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-07-22 22:03:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 50 states have internal predecessors, (59), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-22 22:03:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-07-22 22:03:39,916 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 65 [2022-07-22 22:03:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:39,916 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-07-22 22:03:39,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:03:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-07-22 22:03:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 22:03:39,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:39,920 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:03:39,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:03:39,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash 401511231, now seen corresponding path program 1 times [2022-07-22 22:03:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:39,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669347664] [2022-07-22 22:03:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:03:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:03:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:03:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:03:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:40,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669347664] [2022-07-22 22:03:40,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669347664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:40,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:03:40,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:03:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746366403] [2022-07-22 22:03:40,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:40,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:03:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:40,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:03:40,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:03:40,349 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-22 22:03:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:40,688 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2022-07-22 22:03:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:03:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 65 [2022-07-22 22:03:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:40,697 INFO L225 Difference]: With dead ends: 124 [2022-07-22 22:03:40,697 INFO L226 Difference]: Without dead ends: 90 [2022-07-22 22:03:40,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:03:40,700 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 74 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:40,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 203 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:03:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-22 22:03:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-22 22:03:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-07-22 22:03:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2022-07-22 22:03:40,718 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 65 [2022-07-22 22:03:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:40,718 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2022-07-22 22:03:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-22 22:03:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-07-22 22:03:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 22:03:40,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:40,721 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-22 22:03:40,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:03:40,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash 560902053, now seen corresponding path program 1 times [2022-07-22 22:03:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:40,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508437038] [2022-07-22 22:03:40,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:40,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:03:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:03:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:03:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 22:03:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:41,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508437038] [2022-07-22 22:03:41,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508437038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:03:41,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259927163] [2022-07-22 22:03:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:03:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:03:41,586 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-22 22:03:41,619 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-22 22:03:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 2451 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 22:03:42,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:03:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:03:42,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:03:42,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259927163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:42,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:03:42,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2022-07-22 22:03:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775122628] [2022-07-22 22:03:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:42,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:03:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:03:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:03:42,203 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:03:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:42,330 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2022-07-22 22:03:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:03:42,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 66 [2022-07-22 22:03:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:42,333 INFO L225 Difference]: With dead ends: 132 [2022-07-22 22:03:42,333 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 22:03:42,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:03:42,335 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 18 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:42,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 513 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:03:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 22:03:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-07-22 22:03:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (33), 30 states have call predecessors, (33), 29 states have call successors, (33) [2022-07-22 22:03:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2022-07-22 22:03:42,348 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 66 [2022-07-22 22:03:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:42,349 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2022-07-22 22:03:42,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:03:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2022-07-22 22:03:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 22:03:42,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:42,356 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-22 22:03:42,388 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-22 22:03:42,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:03:42,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1220340855, now seen corresponding path program 1 times [2022-07-22 22:03:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:42,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724313662] [2022-07-22 22:03:42,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:42,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:03:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:03:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:03:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:03:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724313662] [2022-07-22 22:03:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724313662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:03:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:03:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606361654] [2022-07-22 22:03:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:42,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:03:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:42,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:03:42,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:03:42,907 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:03:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:43,411 INFO L93 Difference]: Finished difference Result 168 states and 238 transitions. [2022-07-22 22:03:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:03:43,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 69 [2022-07-22 22:03:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:43,414 INFO L225 Difference]: With dead ends: 168 [2022-07-22 22:03:43,414 INFO L226 Difference]: Without dead ends: 136 [2022-07-22 22:03:43,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:03:43,415 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:43,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 249 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:03:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-22 22:03:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2022-07-22 22:03:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 75 states have internal predecessors, (88), 45 states have call successors, (45), 10 states have call predecessors, (45), 13 states have return successors, (55), 47 states have call predecessors, (55), 44 states have call successors, (55) [2022-07-22 22:03:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2022-07-22 22:03:43,445 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 69 [2022-07-22 22:03:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:43,446 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2022-07-22 22:03:43,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:03:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2022-07-22 22:03:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-22 22:03:43,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:43,456 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:03:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:03:43,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1527144091, now seen corresponding path program 1 times [2022-07-22 22:03:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:43,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738863890] [2022-07-22 22:03:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:03:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:03:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:03:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:03:43,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:43,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738863890] [2022-07-22 22:03:43,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738863890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:43,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:03:43,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:03:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716281583] [2022-07-22 22:03:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:43,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:03:43,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:03:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:03:43,829 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:03:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:44,394 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2022-07-22 22:03:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:03:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2022-07-22 22:03:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:44,396 INFO L225 Difference]: With dead ends: 153 [2022-07-22 22:03:44,396 INFO L226 Difference]: Without dead ends: 126 [2022-07-22 22:03:44,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:03:44,398 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 88 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:44,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 288 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 22:03:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-22 22:03:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-07-22 22:03:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 39 states have call successors, (39), 10 states have call predecessors, (39), 13 states have return successors, (47), 41 states have call predecessors, (47), 38 states have call successors, (47) [2022-07-22 22:03:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2022-07-22 22:03:44,410 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 70 [2022-07-22 22:03:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:44,411 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2022-07-22 22:03:44,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 22:03:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2022-07-22 22:03:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 22:03:44,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:44,412 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-22 22:03:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:03:44,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -343504052, now seen corresponding path program 1 times [2022-07-22 22:03:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:44,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470832472] [2022-07-22 22:03:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:03:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:03:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:03:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:03:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:03:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:03:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:45,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 22:03:45,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:45,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470832472] [2022-07-22 22:03:45,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470832472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:03:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169677180] [2022-07-22 22:03:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:03:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:03:45,040 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-22 22:03:45,071 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-22 22:03:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:45,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 22:03:45,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:03:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-22 22:03:45,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:03:45,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169677180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:45,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:03:45,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 21 [2022-07-22 22:03:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125941335] [2022-07-22 22:03:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:45,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:03:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:03:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:03:45,685 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:03:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:45,877 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2022-07-22 22:03:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:03:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2022-07-22 22:03:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:45,883 INFO L225 Difference]: With dead ends: 173 [2022-07-22 22:03:45,883 INFO L226 Difference]: Without dead ends: 119 [2022-07-22 22:03:45,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:03:45,884 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:45,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 713 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:03:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-22 22:03:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-22 22:03:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 69 states have internal predecessors, (79), 39 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (44), 40 states have call predecessors, (44), 38 states have call successors, (44) [2022-07-22 22:03:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2022-07-22 22:03:45,898 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 82 [2022-07-22 22:03:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:45,898 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2022-07-22 22:03:45,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:03:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2022-07-22 22:03:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 22:03:45,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:45,900 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-22 22:03:45,921 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-22 22:03:46,103 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,SelfDestructingSolverStorable5 [2022-07-22 22:03:46,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1399306283, now seen corresponding path program 1 times [2022-07-22 22:03:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:46,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327865454] [2022-07-22 22:03:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:03:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:03:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:03:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:03:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:03:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:03:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 22:03:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:46,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327865454] [2022-07-22 22:03:46,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327865454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:03:46,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619015078] [2022-07-22 22:03:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:46,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:03:46,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:03:46,559 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-22 22:03:46,560 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-22 22:03:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:46,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 22:03:46,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:03:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 22:03:47,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:03:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 22:03:48,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619015078] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:03:48,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:03:48,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 26 [2022-07-22 22:03:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964091751] [2022-07-22 22:03:48,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:03:48,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 22:03:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 22:03:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2022-07-22 22:03:48,110 INFO L87 Difference]: Start difference. First operand 119 states and 162 transitions. Second operand has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-22 22:03:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:49,935 INFO L93 Difference]: Finished difference Result 189 states and 261 transitions. [2022-07-22 22:03:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 22:03:49,936 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) Word has length 82 [2022-07-22 22:03:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:49,938 INFO L225 Difference]: With dead ends: 189 [2022-07-22 22:03:49,938 INFO L226 Difference]: Without dead ends: 144 [2022-07-22 22:03:49,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 176 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2022-07-22 22:03:49,940 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 167 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:49,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 681 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-22 22:03:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-22 22:03:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2022-07-22 22:03:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 75 states have internal predecessors, (83), 39 states have call successors, (39), 11 states have call predecessors, (39), 14 states have return successors, (49), 39 states have call predecessors, (49), 38 states have call successors, (49) [2022-07-22 22:03:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 171 transitions. [2022-07-22 22:03:49,953 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 171 transitions. Word has length 82 [2022-07-22 22:03:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:49,957 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 171 transitions. [2022-07-22 22:03:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-22 22:03:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 171 transitions. [2022-07-22 22:03:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-22 22:03:49,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:49,960 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2022-07-22 22:03:49,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 22:03:50,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:03:50,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:50,167 INFO L85 PathProgramCache]: Analyzing trace with hash 207953017, now seen corresponding path program 1 times [2022-07-22 22:03:50,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:50,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358600531] [2022-07-22 22:03:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:50,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:03:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:03:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:03:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:03:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:03:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:03:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-22 22:03:50,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:50,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358600531] [2022-07-22 22:03:50,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358600531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:50,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:03:50,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 22:03:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793006112] [2022-07-22 22:03:50,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:50,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:03:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:50,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:03:50,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:03:50,669 INFO L87 Difference]: Start difference. First operand 125 states and 171 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-22 22:03:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:51,814 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2022-07-22 22:03:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:03:51,815 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 87 [2022-07-22 22:03:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:51,818 INFO L225 Difference]: With dead ends: 206 [2022-07-22 22:03:51,818 INFO L226 Difference]: Without dead ends: 174 [2022-07-22 22:03:51,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2022-07-22 22:03:51,820 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 138 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:51,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 430 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 22:03:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-22 22:03:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2022-07-22 22:03:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 43 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (54), 44 states have call predecessors, (54), 42 states have call successors, (54) [2022-07-22 22:03:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2022-07-22 22:03:51,839 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 87 [2022-07-22 22:03:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:51,840 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2022-07-22 22:03:51,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-22 22:03:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2022-07-22 22:03:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-22 22:03:51,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:51,842 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:03:51,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:03:51,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571299, now seen corresponding path program 1 times [2022-07-22 22:03:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:51,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326529390] [2022-07-22 22:03:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:51,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:03:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:03:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:03:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:03:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:03:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:03:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-22 22:03:52,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:52,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326529390] [2022-07-22 22:03:52,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326529390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:03:52,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554318684] [2022-07-22 22:03:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:52,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:03:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:03:52,292 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-22 22:03:52,294 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-22 22:03:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:52,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 22:03:52,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:03:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 22:03:52,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:03:52,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554318684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:52,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:03:52,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 16 [2022-07-22 22:03:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921984048] [2022-07-22 22:03:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:52,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:03:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:03:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:03:52,819 INFO L87 Difference]: Start difference. First operand 131 states and 183 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 22:03:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:53,013 INFO L93 Difference]: Finished difference Result 177 states and 247 transitions. [2022-07-22 22:03:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:03:53,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 88 [2022-07-22 22:03:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:53,016 INFO L225 Difference]: With dead ends: 177 [2022-07-22 22:03:53,016 INFO L226 Difference]: Without dead ends: 149 [2022-07-22 22:03:53,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:03:53,018 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 46 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:53,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 918 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:03:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-22 22:03:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2022-07-22 22:03:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 81 states have internal predecessors, (92), 43 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (51), 45 states have call predecessors, (51), 42 states have call successors, (51) [2022-07-22 22:03:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2022-07-22 22:03:53,036 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 88 [2022-07-22 22:03:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:53,037 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2022-07-22 22:03:53,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 22:03:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2022-07-22 22:03:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 22:03:53,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:53,039 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-22 22:03:53,071 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-22 22:03:53,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:03:53,255 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1562553972, now seen corresponding path program 1 times [2022-07-22 22:03:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:53,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990242851] [2022-07-22 22:03:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:03:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:03:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 22:03:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:03:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:03:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:03:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 22:03:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:03:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 22:03:53,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:53,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990242851] [2022-07-22 22:03:53,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990242851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:53,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:03:53,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:03:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073060401] [2022-07-22 22:03:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:53,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:03:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:03:53,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:03:53,529 INFO L87 Difference]: Start difference. First operand 137 states and 186 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:03:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:53,980 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2022-07-22 22:03:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:03:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2022-07-22 22:03:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:53,982 INFO L225 Difference]: With dead ends: 184 [2022-07-22 22:03:53,982 INFO L226 Difference]: Without dead ends: 160 [2022-07-22 22:03:53,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:03:53,983 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 78 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:53,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 391 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:03:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-22 22:03:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-22 22:03:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.164835164835165) internal successors, (106), 92 states have internal predecessors, (106), 54 states have call successors, (54), 11 states have call predecessors, (54), 14 states have return successors, (62), 57 states have call predecessors, (62), 52 states have call successors, (62) [2022-07-22 22:03:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 222 transitions. [2022-07-22 22:03:53,999 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 222 transitions. Word has length 86 [2022-07-22 22:03:54,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:54,000 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 222 transitions. [2022-07-22 22:03:54,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:03:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 222 transitions. [2022-07-22 22:03:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-22 22:03:54,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:54,002 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-22 22:03:54,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 22:03:54,002 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1066644358, now seen corresponding path program 1 times [2022-07-22 22:03:54,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:54,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599816050] [2022-07-22 22:03:54,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:03:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:03:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:03:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:03:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:03:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:03:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:03:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:03:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:03:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:03:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:03:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:03:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:03:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-22 22:03:54,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:03:54,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599816050] [2022-07-22 22:03:54,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599816050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:03:54,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:03:54,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:03:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277246580] [2022-07-22 22:03:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:03:54,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:03:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:03:54,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:03:54,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:03:54,564 INFO L87 Difference]: Start difference. First operand 160 states and 222 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 22:03:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:03:54,977 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2022-07-22 22:03:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:03:54,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 94 [2022-07-22 22:03:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:03:54,979 INFO L225 Difference]: With dead ends: 179 [2022-07-22 22:03:54,979 INFO L226 Difference]: Without dead ends: 162 [2022-07-22 22:03:54,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:03:54,980 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 88 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:03:54,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 222 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:03:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-22 22:03:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2022-07-22 22:03:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 54 states have call successors, (54), 11 states have call predecessors, (54), 14 states have return successors, (61), 56 states have call predecessors, (61), 52 states have call successors, (61) [2022-07-22 22:03:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 220 transitions. [2022-07-22 22:03:54,993 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 220 transitions. Word has length 94 [2022-07-22 22:03:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:03:54,994 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 220 transitions. [2022-07-22 22:03:54,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 22:03:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 220 transitions. [2022-07-22 22:03:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-22 22:03:54,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:03:54,995 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-22 22:03:54,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 22:03:54,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:03:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:03:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1470452839, now seen corresponding path program 1 times [2022-07-22 22:03:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:03:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095185251] [2022-07-22 22:03:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:03:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:03:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:04:23,570 WARN L233 SmtUtils]: Spent 13.09s on a formula simplification. DAG size of input: 154 DAG size of output: 137 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:05:03,957 WARN L233 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 146 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:05:38,002 WARN L233 SmtUtils]: Spent 10.46s on a formula simplification. DAG size of input: 141 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:06:00,660 WARN L233 SmtUtils]: Spent 9.89s on a formula simplification. DAG size of input: 125 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:06:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:06:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:06:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:06:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:06:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:06:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:06:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:01,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:06:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:06:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:06:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:06:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:06:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:06:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:06:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:06:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:06:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 22:06:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:06:03,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095185251] [2022-07-22 22:06:03,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095185251] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:06:03,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967011631] [2022-07-22 22:06:03,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:06:03,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:06:03,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:06:03,611 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-22 22:06:03,640 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-22 22:06:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:06:04,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-22 22:06:04,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:06:04,487 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-22 22:06:04,728 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-22 22:06:04,833 INFO L356 Elim1Store]: treesize reduction 88, result has 32.3 percent of original size [2022-07-22 22:06:04,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 86 [2022-07-22 22:06:07,343 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 22:06:07,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 22:06:07,841 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-22 22:06:07,853 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_343 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_343))) is different from true [2022-07-22 22:06:07,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:06:07,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:06:07,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2022-07-22 22:06:11,242 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|))) (let ((.cse0 (mod (select .cse1 0) 18446744073709551616))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15|) .cse0) (select .cse1 8)) (<= .cse0 9223372036854775807) (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 0)))) (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|))) (let ((.cse2 (mod (select .cse3 0) 18446744073709551616))) (and (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15|) (+ (- 18446744073709551616) .cse2)) (select .cse3 8)) (not (<= .cse2 9223372036854775807)))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 0))))) is different from true [2022-07-22 22:06:21,456 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:06:29,616 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:06:32,028 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6|))) (let ((.cse0 (mod (select .cse1 0) 18446744073709551616))) (and (<= .cse0 9223372036854775807) (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6|) (= (select .cse1 8) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16|) .cse0)))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6|))) (let ((.cse3 (mod (select .cse2 0) 18446744073709551616))) (and (= (select .cse2 8) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16|) (+ .cse3 (- 18446744073709551616)))) (not (<= .cse3 9223372036854775807)) (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6|))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| 0))))) is different from true [2022-07-22 22:06:36,673 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|))) (let ((.cse0 (mod (select .cse1 0) 18446744073709551616))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17|) (+ (- 18446744073709551616) .cse0)) (select .cse1 8)) (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|) (not (<= .cse0 9223372036854775807)))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 0)))) (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|))) (let ((.cse3 (mod (select .cse2 0) 18446744073709551616))) (and (= (select .cse2 8) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17|) .cse3)) (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|) (<= .cse3 9223372036854775807))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 0))))) is different from true [2022-07-22 22:06:38,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:06:38,830 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 22:06:38,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 56 [2022-07-22 22:06:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 35 not checked. [2022-07-22 22:06:38,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:06:47,140 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse3 (mod (select .cse0 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse3)))) (<= (div (+ (mod (select .cse0 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256) (* (- 1) .cse1)) (- 256)) (+ (div (+ (- 256) .cse1) 256) 1))) (not (<= .cse3 9223372036854775807))))))) (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse4 (mod (select .cse6 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (<= .cse4 9223372036854775807) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ (- 18446744073709551616) |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse4)))) (<= (div (+ (- 1) (* (- 1) .cse5)) (- 256)) (+ (div (+ .cse5 (* (- 1) (mod (select .cse6 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256))) 256) 1)))))))) (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse8 (mod (select .cse10 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (<= .cse8 9223372036854775807) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ (- 18446744073709551616) |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse8)))) (<= (div (+ (- 1) .cse9 (* (- 1) (mod (select .cse10 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256))) 256) (div (+ .cse9 (- 256)) 256)))))))) (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse15 (mod (select .cse13 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (let ((.cse12 (* (- 1) (select (select .cse14 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse15))))) (<= (div (+ (- 1) .cse12) (- 256)) (div (+ (- 1) (mod (select .cse13 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256) .cse12) (- 256)))) (not (<= .cse15 9223372036854775807)))))))) is different from false [2022-07-22 22:06:47,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967011631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:06:47,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:06:47,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 56 [2022-07-22 22:06:47,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401471869] [2022-07-22 22:06:47,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:06:47,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-22 22:06:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:06:47,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-22 22:06:47,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3136, Unknown=14, NotChecked=580, Total=3906 [2022-07-22 22:06:47,148 INFO L87 Difference]: Start difference. First operand 159 states and 220 transitions. Second operand has 56 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 41 states have internal predecessors, (86), 16 states have call successors, (30), 11 states have call predecessors, (30), 14 states have return successors, (28), 17 states have call predecessors, (28), 15 states have call successors, (28) [2022-07-22 22:07:34,662 WARN L233 SmtUtils]: Spent 27.88s on a formula simplification. DAG size of input: 157 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:07:36,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []