./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_next_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 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:13:15,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:13:15,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:13:15,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:13:15,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:13:15,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:13:15,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:13:15,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:13:15,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:13:15,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:13:15,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:13:15,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:13:15,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:13:15,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:13:15,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:13:15,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:13:15,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:13:15,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:13:15,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:13:15,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:13:15,496 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:13:15,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:13:15,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:13:15,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:13:15,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:13:15,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:13:15,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:13:15,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:13:15,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:13:15,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:13:15,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:13:15,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:13:15,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:13:15,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:13:15,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:13:15,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:13:15,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:13:15,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:13:15,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:13:15,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:13:15,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:13:15,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:13:15,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:13:15,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:13:15,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:13:15,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:13:15,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:13:15,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:13:15,545 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:13:15,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:13:15,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:13:15,546 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:13:15,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:13:15,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:13:15,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:13:15,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:13:15,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:13:15,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:13:15,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:13:15,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:13:15,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:13:15,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:13:15,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:13:15,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:13:15,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:13:15,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:13:15,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:13:15,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:13:15,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:13:15,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:13:15,550 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:13:15,550 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:13:15,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:13:15,551 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 -> 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e [2022-07-19 22:13:15,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:13:15,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:13:15,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:13:15,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:13:15,786 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:13:15,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2022-07-19 22:13:15,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2386e1cf1/526b5324079f421e8b4b0d06eec1e0fd/FLAG4bc07fd6e [2022-07-19 22:13:16,366 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:13:16,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2022-07-19 22:13:16,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2386e1cf1/526b5324079f421e8b4b0d06eec1e0fd/FLAG4bc07fd6e [2022-07-19 22:13:16,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2386e1cf1/526b5324079f421e8b4b0d06eec1e0fd [2022-07-19 22:13:16,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:13:16,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:13:16,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:13:16,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:13:16,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:13:16,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:13:16" (1/1) ... [2022-07-19 22:13:16,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69fd0bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:16, skipping insertion in model container [2022-07-19 22:13:16,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:13:16" (1/1) ... [2022-07-19 22:13:16,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:13:16,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:13:17,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2022-07-19 22:13:17,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2022-07-19 22:13:17,506 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,507 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,507 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,508 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,509 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,517 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,517 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,518 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,519 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,520 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,521 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,521 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,521 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,671 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:13:17,672 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:13:17,673 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:13:17,674 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:13:17,675 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:13:17,675 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:13:17,675 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:13:17,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:13:17,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:13:17,677 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:13:17,743 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:13:17,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:13:17,777 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:13:17,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2022-07-19 22:13:17,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2022-07-19 22:13:17,845 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,846 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,847 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,847 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,850 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,868 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,868 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,869 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,869 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,870 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,870 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,870 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,871 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:13:17,925 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:13:17,926 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:13:17,927 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:13:17,927 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:13:17,930 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:13:17,931 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:13:17,931 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:13:17,932 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:13:17,932 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:13:17,933 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:13:17,950 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:13:17,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:13:18,067 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:13:18,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18 WrapperNode [2022-07-19 22:13:18,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:13:18,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:13:18,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:13:18,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:13:18,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,138 INFO L137 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 58 [2022-07-19 22:13:18,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:13:18,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:13:18,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:13:18,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:13:18,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:13:18,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:13:18,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:13:18,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:13:18,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (1/1) ... [2022-07-19 22:13:18,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:13:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:18,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:13:18,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:13:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:13:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:13:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:13:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-19 22:13:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-19 22:13:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:13:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:13:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:13:18,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:13:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:13:18,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:13:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:13:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:13:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:13:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-07-19 22:13:18,231 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-07-19 22:13:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:13:18,380 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:13:18,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:13:18,500 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:13:18,524 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:13:18,524 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 22:13:18,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:13:18 BoogieIcfgContainer [2022-07-19 22:13:18,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:13:18,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:13:18,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:13:18,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:13:18,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:13:16" (1/3) ... [2022-07-19 22:13:18,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f3872e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:13:18, skipping insertion in model container [2022-07-19 22:13:18,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:13:18" (2/3) ... [2022-07-19 22:13:18,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f3872e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:13:18, skipping insertion in model container [2022-07-19 22:13:18,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:13:18" (3/3) ... [2022-07-19 22:13:18,531 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2022-07-19 22:13:18,540 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:13:18,540 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:13:18,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:13:18,573 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@157b0af7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26610080 [2022-07-19 22:13:18,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:13:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-19 22:13:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:13:18,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:18,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:18,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash 829036907, now seen corresponding path program 1 times [2022-07-19 22:13:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:18,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246534852] [2022-07-19 22:13:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:18,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:18,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:13:18,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:18,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246534852] [2022-07-19 22:13:18,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246534852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:18,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:18,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:13:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142542580] [2022-07-19 22:13:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:18,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 22:13:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:18,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 22:13:18,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 22:13:18,953 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 22:13:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:18,976 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-07-19 22:13:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 22:13:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 22:13:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:18,984 INFO L225 Difference]: With dead ends: 94 [2022-07-19 22:13:18,985 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 22:13:18,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 22:13:18,992 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:18,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:13:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 22:13:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-19 22:13:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:13:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-07-19 22:13:19,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-07-19 22:13:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:19,036 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-07-19 22:13:19,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 22:13:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-07-19 22:13:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:13:19,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:19,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:19,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:13:19,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash -192031447, now seen corresponding path program 1 times [2022-07-19 22:13:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834509501] [2022-07-19 22:13:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:13:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:19,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834509501] [2022-07-19 22:13:19,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834509501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:19,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:19,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:13:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896800120] [2022-07-19 22:13:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:19,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:13:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:13:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:13:19,457 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:13:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:19,697 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-07-19 22:13:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:13:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-19 22:13:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:19,702 INFO L225 Difference]: With dead ends: 56 [2022-07-19 22:13:19,702 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 22:13:19,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:13:19,704 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:19,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 262 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:13:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 22:13:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-07-19 22:13:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:13:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-07-19 22:13:19,718 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2022-07-19 22:13:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:19,718 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-07-19 22:13:19,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:13:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-07-19 22:13:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:13:19,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:19,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:19,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:13:19,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1001378073, now seen corresponding path program 1 times [2022-07-19 22:13:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:19,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205536637] [2022-07-19 22:13:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 22:13:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:19,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205536637] [2022-07-19 22:13:19,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205536637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:13:19,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830471635] [2022-07-19 22:13:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:19,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:19,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:13:19,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:13:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:20,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 22:13:20,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:20,112 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 22:13:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:20,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 22:13:20,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:13:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:13:20,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:13:20,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830471635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:20,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:13:20,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2022-07-19 22:13:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389520846] [2022-07-19 22:13:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:20,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:13:20,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:13:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:13:20,657 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:13:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:20,734 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2022-07-19 22:13:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:13:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-19 22:13:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:20,736 INFO L225 Difference]: With dead ends: 113 [2022-07-19 22:13:20,736 INFO L226 Difference]: Without dead ends: 75 [2022-07-19 22:13:20,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:13:20,737 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 22 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:20,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 306 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-07-19 22:13:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-19 22:13:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-07-19 22:13:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-19 22:13:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-07-19 22:13:20,744 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 28 [2022-07-19 22:13:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:20,744 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-07-19 22:13:20,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:13:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-07-19 22:13:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:13:20,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:20,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:20,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 22:13:20,959 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-19 22:13:20,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1394405083, now seen corresponding path program 1 times [2022-07-19 22:13:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354806911] [2022-07-19 22:13:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:13:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:21,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354806911] [2022-07-19 22:13:21,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354806911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:21,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:21,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:13:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297389772] [2022-07-19 22:13:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:21,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:13:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:21,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:13:21,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:13:21,049 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:13:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:21,074 INFO L93 Difference]: Finished difference Result 141 states and 168 transitions. [2022-07-19 22:13:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:13:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-19 22:13:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:21,075 INFO L225 Difference]: With dead ends: 141 [2022-07-19 22:13:21,075 INFO L226 Difference]: Without dead ends: 66 [2022-07-19 22:13:21,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:13:21,076 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 12 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:21,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 189 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:13:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-19 22:13:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2022-07-19 22:13:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:13:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-07-19 22:13:21,082 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 28 [2022-07-19 22:13:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:21,082 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-07-19 22:13:21,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:13:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-07-19 22:13:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 22:13:21,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:21,083 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:13:21,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:13:21,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 854159971, now seen corresponding path program 1 times [2022-07-19 22:13:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:21,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633760588] [2022-07-19 22:13:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:13:21,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:21,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633760588] [2022-07-19 22:13:21,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633760588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:21,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:21,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:13:21,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772305384] [2022-07-19 22:13:21,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:21,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:13:21,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:21,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:13:21,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:13:21,318 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:13:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:21,516 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-19 22:13:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:13:21,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-07-19 22:13:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:21,517 INFO L225 Difference]: With dead ends: 70 [2022-07-19 22:13:21,517 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 22:13:21,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:13:21,518 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:21,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 292 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:13:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 22:13:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-07-19 22:13:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:13:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-07-19 22:13:21,524 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 42 [2022-07-19 22:13:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:21,524 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-07-19 22:13:21,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:13:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-07-19 22:13:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 22:13:21,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:21,526 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:13:21,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:13:21,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash 44813345, now seen corresponding path program 1 times [2022-07-19 22:13:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:21,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538071850] [2022-07-19 22:13:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:13:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:21,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538071850] [2022-07-19 22:13:21,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538071850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:21,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:21,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:13:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541425642] [2022-07-19 22:13:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:21,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:13:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:13:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:13:21,735 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:13:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:21,919 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-07-19 22:13:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:13:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-07-19 22:13:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:21,921 INFO L225 Difference]: With dead ends: 108 [2022-07-19 22:13:21,921 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 22:13:21,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:13:21,922 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:21,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 165 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:13:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 22:13:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-07-19 22:13:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-07-19 22:13:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-07-19 22:13:21,928 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 42 [2022-07-19 22:13:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:21,928 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-07-19 22:13:21,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:13:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-07-19 22:13:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 22:13:21,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:21,929 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 22:13:21,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:13:21,929 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash -348213665, now seen corresponding path program 1 times [2022-07-19 22:13:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:21,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741786869] [2022-07-19 22:13:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:13:22,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741786869] [2022-07-19 22:13:22,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741786869] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:13:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289486607] [2022-07-19 22:13:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:22,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:22,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:13:22,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:13:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 22:13:22,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:22,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 22:13:22,262 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 22:13:22,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:13:22,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:22,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 22:13:22,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:13:22,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-19 22:13:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:13:22,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:13:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289486607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:22,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:13:22,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2022-07-19 22:13:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714217171] [2022-07-19 22:13:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:22,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 22:13:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 22:13:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:13:22,571 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:13:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:22,615 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2022-07-19 22:13:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:13:22,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-07-19 22:13:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:22,616 INFO L225 Difference]: With dead ends: 149 [2022-07-19 22:13:22,616 INFO L226 Difference]: Without dead ends: 104 [2022-07-19 22:13:22,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:13:22,617 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 14 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:22,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 277 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2022-07-19 22:13:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-19 22:13:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-07-19 22:13:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 66 states have internal predecessors, (69), 17 states have call successors, (17), 9 states have call predecessors, (17), 13 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-07-19 22:13:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2022-07-19 22:13:22,624 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 42 [2022-07-19 22:13:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:22,624 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2022-07-19 22:13:22,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:13:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-07-19 22:13:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 22:13:22,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:22,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:22,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:13:22,832 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,SelfDestructingSolverStorable6 [2022-07-19 22:13:22,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -742580451, now seen corresponding path program 1 times [2022-07-19 22:13:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:22,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763880748] [2022-07-19 22:13:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 22:13:22,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:22,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763880748] [2022-07-19 22:13:22,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763880748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:13:22,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357814072] [2022-07-19 22:13:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:22,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:22,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:22,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:13:22,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:13:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:23,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-19 22:13:23,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:23,065 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 22:13:23,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:23,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 22:13:23,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:13:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 22:13:23,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:13:23,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-19 22:13:23,848 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 22:13:23,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-07-19 22:13:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:13:23,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357814072] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:13:23,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:13:23,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 30 [2022-07-19 22:13:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950645484] [2022-07-19 22:13:23,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:13:23,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 22:13:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 22:13:23,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2022-07-19 22:13:23,889 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (11), 3 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 22:13:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:24,483 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2022-07-19 22:13:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 22:13:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (11), 3 states have call predecessors, (11), 6 states have call successors, (11) Word has length 42 [2022-07-19 22:13:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:24,484 INFO L225 Difference]: With dead ends: 161 [2022-07-19 22:13:24,484 INFO L226 Difference]: Without dead ends: 86 [2022-07-19 22:13:24,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 22:13:24,485 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:24,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 581 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-07-19 22:13:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-19 22:13:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2022-07-19 22:13:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:13:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-07-19 22:13:24,490 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 42 [2022-07-19 22:13:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:24,490 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-07-19 22:13:24,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (11), 3 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 22:13:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-07-19 22:13:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 22:13:24,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:24,491 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:24,510 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-19 22:13:24,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:24,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash -541770688, now seen corresponding path program 1 times [2022-07-19 22:13:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:24,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184375376] [2022-07-19 22:13:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:13:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:24,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184375376] [2022-07-19 22:13:24,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184375376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:24,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:24,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:13:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212526992] [2022-07-19 22:13:24,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:24,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:13:24,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:24,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:13:24,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:13:24,828 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:13:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:24,891 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-07-19 22:13:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:13:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-19 22:13:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:24,892 INFO L225 Difference]: With dead ends: 71 [2022-07-19 22:13:24,892 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 22:13:24,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:13:24,893 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:24,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:13:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 22:13:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-19 22:13:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:13:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2022-07-19 22:13:24,898 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 48 [2022-07-19 22:13:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:24,898 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2022-07-19 22:13:24,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:13:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-07-19 22:13:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:13:24,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:24,899 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:24,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:13:24,900 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash -266250434, now seen corresponding path program 1 times [2022-07-19 22:13:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:24,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254545452] [2022-07-19 22:13:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:13:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 22:13:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:25,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254545452] [2022-07-19 22:13:25,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254545452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:13:25,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354618450] [2022-07-19 22:13:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:25,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:25,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:25,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:13:25,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 22:13:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:25,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-19 22:13:25,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:25,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:25,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:25,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 22:13:25,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:25,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 22:13:25,458 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 8 treesize of output 7 [2022-07-19 22:13:25,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:25,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-07-19 22:13:25,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-19 22:13:26,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:13:26,727 INFO L356 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2022-07-19 22:13:26,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 98 [2022-07-19 22:13:26,739 INFO L356 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2022-07-19 22:13:26,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 37 [2022-07-19 22:13:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 22:13:26,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:13:39,301 WARN L233 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 22:13:49,526 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 22:13:49,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:13:49,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:13:49,698 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 22:13:49,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 1 [2022-07-19 22:13:49,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:13:49,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:13:49,705 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 22:13:49,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 1 [2022-07-19 22:13:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 22:13:49,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354618450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:13:49,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:13:49,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 13] total 38 [2022-07-19 22:13:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560949998] [2022-07-19 22:13:49,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:13:49,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 22:13:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 22:13:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1259, Unknown=1, NotChecked=0, Total=1406 [2022-07-19 22:13:49,709 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 38 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 14 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-19 22:13:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:50,080 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-07-19 22:13:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 22:13:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 14 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24) Word has length 63 [2022-07-19 22:13:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:50,081 INFO L225 Difference]: With dead ends: 90 [2022-07-19 22:13:50,081 INFO L226 Difference]: Without dead ends: 83 [2022-07-19 22:13:50,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 107 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=215, Invalid=1676, Unknown=1, NotChecked=0, Total=1892 [2022-07-19 22:13:50,082 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:50,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 658 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2022-07-19 22:13:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-19 22:13:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-19 22:13:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 13 states have call successors, (13), 10 states have call predecessors, (13), 10 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-19 22:13:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-19 22:13:50,087 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 63 [2022-07-19 22:13:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:50,088 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-19 22:13:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 14 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-19 22:13:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-19 22:13:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:13:50,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:50,088 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:50,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 22:13:50,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:50,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1075597060, now seen corresponding path program 1 times [2022-07-19 22:13:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:50,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476999460] [2022-07-19 22:13:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:13:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 22:13:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:50,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476999460] [2022-07-19 22:13:50,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476999460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:13:50,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091892679] [2022-07-19 22:13:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:50,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:13:50,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 22:13:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:50,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-19 22:13:50,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:50,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 22:13:50,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 22:13:50,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:13:50,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:13:50,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 22:13:50,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:13:51,034 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 22:13:51,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 22:13:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 22:13:51,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:13:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 22:13:51,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091892679] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:13:51,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:13:51,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 32 [2022-07-19 22:13:51,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161179565] [2022-07-19 22:13:51,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:13:51,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 22:13:51,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:51,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 22:13:51,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2022-07-19 22:13:51,892 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-07-19 22:13:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:52,338 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-07-19 22:13:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:13:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 63 [2022-07-19 22:13:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:52,339 INFO L225 Difference]: With dead ends: 105 [2022-07-19 22:13:52,339 INFO L226 Difference]: Without dead ends: 83 [2022-07-19 22:13:52,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 109 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 22:13:52,341 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:52,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 387 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-07-19 22:13:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-19 22:13:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2022-07-19 22:13:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 13 states have call successors, (13), 10 states have call predecessors, (13), 10 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-19 22:13:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2022-07-19 22:13:52,346 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 63 [2022-07-19 22:13:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:52,346 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2022-07-19 22:13:52,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-07-19 22:13:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-07-19 22:13:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:13:52,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:52,347 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:52,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 22:13:52,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 22:13:52,563 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1468624070, now seen corresponding path program 1 times [2022-07-19 22:13:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:52,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683860006] [2022-07-19 22:13:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:13:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 22:13:52,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:52,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683860006] [2022-07-19 22:13:52,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683860006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:52,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:52,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:13:52,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055760431] [2022-07-19 22:13:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:52,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:13:52,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:13:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:13:52,666 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 22:13:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:52,683 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-07-19 22:13:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:13:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2022-07-19 22:13:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:52,684 INFO L225 Difference]: With dead ends: 103 [2022-07-19 22:13:52,684 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 22:13:52,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:13:52,685 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:52,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 192 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:13:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 22:13:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-19 22:13:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:13:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-07-19 22:13:52,689 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 63 [2022-07-19 22:13:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:52,690 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-07-19 22:13:52,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 22:13:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-07-19 22:13:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 22:13:52,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:52,691 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:52,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:13:52,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 763050350, now seen corresponding path program 1 times [2022-07-19 22:13:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:52,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663106213] [2022-07-19 22:13:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:13:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:13:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:13:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 22:13:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:53,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663106213] [2022-07-19 22:13:53,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663106213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:53,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:53,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:13:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798540654] [2022-07-19 22:13:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:53,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:13:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:53,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:13:53,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:13:53,032 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 22:13:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:53,469 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-07-19 22:13:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:13:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2022-07-19 22:13:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:53,470 INFO L225 Difference]: With dead ends: 84 [2022-07-19 22:13:53,470 INFO L226 Difference]: Without dead ends: 82 [2022-07-19 22:13:53,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:13:53,471 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:53,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 312 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:13:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-19 22:13:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-07-19 22:13:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 57 states have internal predecessors, (59), 13 states have call successors, (13), 11 states have call predecessors, (13), 11 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-19 22:13:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-07-19 22:13:53,476 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 77 [2022-07-19 22:13:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:53,476 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-07-19 22:13:53,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 22:13:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-07-19 22:13:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 22:13:53,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:53,477 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:53,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 22:13:53,477 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash -46296276, now seen corresponding path program 1 times [2022-07-19 22:13:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:53,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500856846] [2022-07-19 22:13:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:13:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:13:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:13:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 22:13:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:53,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500856846] [2022-07-19 22:13:53,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500856846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:53,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:53,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:13:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104511801] [2022-07-19 22:13:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:53,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:13:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:13:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:13:53,724 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 22:13:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:54,046 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-19 22:13:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:13:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2022-07-19 22:13:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:54,047 INFO L225 Difference]: With dead ends: 96 [2022-07-19 22:13:54,047 INFO L226 Difference]: Without dead ends: 84 [2022-07-19 22:13:54,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:13:54,047 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 32 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:54,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 217 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:13:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-19 22:13:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-07-19 22:13:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 13 states have call successors, (13), 11 states have call predecessors, (13), 11 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-19 22:13:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-07-19 22:13:54,052 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 77 [2022-07-19 22:13:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:54,053 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-07-19 22:13:54,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 22:13:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-07-19 22:13:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 22:13:54,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:54,053 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:54,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 22:13:54,053 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:54,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -439323286, now seen corresponding path program 1 times [2022-07-19 22:13:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:54,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564346091] [2022-07-19 22:13:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:13:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:13:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:13:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 22:13:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:54,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564346091] [2022-07-19 22:13:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564346091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:13:54,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211121861] [2022-07-19 22:13:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:54,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:13:54,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:13:54,298 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:13:54,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 22:13:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:54,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 22:13:54,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:13:54,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 22:13:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:13:54,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:13:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 22:13:54,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211121861] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:13:54,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:13:54,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 15 [2022-07-19 22:13:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286592541] [2022-07-19 22:13:54,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:13:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:13:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:13:54,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:13:54,757 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-19 22:13:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:55,094 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-07-19 22:13:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:13:55,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 77 [2022-07-19 22:13:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:55,095 INFO L225 Difference]: With dead ends: 99 [2022-07-19 22:13:55,095 INFO L226 Difference]: Without dead ends: 77 [2022-07-19 22:13:55,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:13:55,096 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:55,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 315 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:13:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-19 22:13:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-19 22:13:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:13:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-07-19 22:13:55,100 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 77 [2022-07-19 22:13:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:55,101 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-07-19 22:13:55,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-19 22:13:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-07-19 22:13:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-19 22:13:55,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:13:55,102 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:55,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 22:13:55,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 22:13:55,312 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:13:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:13:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 958151681, now seen corresponding path program 1 times [2022-07-19 22:13:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:13:55,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371427433] [2022-07-19 22:13:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:13:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:13:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:13:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:13:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:13:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:13:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:13:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:13:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:13:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:13:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:13:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:13:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:13:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:13:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-19 22:13:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:13:55,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371427433] [2022-07-19 22:13:55,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371427433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:13:55,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:13:55,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:13:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165879451] [2022-07-19 22:13:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:13:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:13:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:13:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:13:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:13:55,571 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:13:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:13:55,727 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-07-19 22:13:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:13:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 83 [2022-07-19 22:13:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:13:55,728 INFO L225 Difference]: With dead ends: 79 [2022-07-19 22:13:55,728 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:13:55,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:13:55,729 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:13:55,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 225 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:13:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:13:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:13:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 22:13:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:13:55,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-07-19 22:13:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:13:55,731 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:13:55,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:13:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:13:55,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:13:55,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:13:55,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 22:13:55,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2022-07-19 22:13:57,198 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2022-07-19 22:13:57,198 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2022-07-19 22:13:57,199 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-07-19 22:13:57,199 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2022-07-19 22:13:57,199 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2022-07-19 22:13:57,200 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2022-07-19 22:13:57,200 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2022-07-19 22:13:57,200 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2022-07-19 22:13:57,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:13:57,200 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-07-19 22:13:57,200 INFO L902 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2022-07-19 22:13:57,200 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-07-19 22:13:57,200 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret675#1| 1) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret675#1|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-07-19 22:13:57,200 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-07-19 22:13:57,200 INFO L895 garLoopResultBuilder]: At program point L4842(lines 4836 4843) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-07-19 22:13:57,201 INFO L895 garLoopResultBuilder]: At program point L4840-1(line 4840) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| .cse1) (= .cse2 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse2 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret332#1| 1) (= 0 .cse1) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret332#1|))) [2022-07-19 22:13:57,201 INFO L899 garLoopResultBuilder]: For program point L4840-2(line 4840) no Hoare annotation was computed. [2022-07-19 22:13:57,201 INFO L895 garLoopResultBuilder]: At program point L4840(line 4840) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| (select .cse0 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select .cse0 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-07-19 22:13:57,201 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-07-19 22:13:57,201 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:13:57,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:13:57,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:13:57,201 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-07-19 22:13:57,201 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret676#1| 1) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret676#1|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-07-19 22:13:57,201 INFO L899 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2022-07-19 22:13:57,201 INFO L895 garLoopResultBuilder]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) (let ((.cse2 (select .cse0 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (< 1 (select .cse0 0)) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| (select .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= .cse2 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse2 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select .cse1 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse3)) (= (select (select |#memory_$Pointer$.offset| .cse3) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|)))) [2022-07-19 22:13:57,201 INFO L895 garLoopResultBuilder]: At program point L4839-1(line 4839) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret331#1| 1) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| (select .cse0 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret331#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select .cse0 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-07-19 22:13:57,202 INFO L895 garLoopResultBuilder]: At program point L4841(line 4841) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| |ULTIMATE.start_aws_linked_list_next_#t~mem333#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#t~mem333#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) |ULTIMATE.start_aws_linked_list_next_#t~mem333#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem333#1.base| .cse0))) [2022-07-19 22:13:57,202 INFO L899 garLoopResultBuilder]: For program point L4841-1(line 4841) no Hoare annotation was computed. [2022-07-19 22:13:57,202 INFO L899 garLoopResultBuilder]: For program point L4837-2(line 4837) no Hoare annotation was computed. [2022-07-19 22:13:57,202 INFO L895 garLoopResultBuilder]: At program point L4837(line 4837) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) (let ((.cse2 (select .cse0 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (< 1 (select .cse0 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| (select .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse2 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select .cse1 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse3)) (= (select (select |#memory_$Pointer$.offset| .cse3) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (< 0 |#StackHeapBarrier|)))) [2022-07-19 22:13:57,202 INFO L899 garLoopResultBuilder]: For program point L4839-2(line 4839) no Hoare annotation was computed. [2022-07-19 22:13:57,202 INFO L895 garLoopResultBuilder]: At program point L4837-1(line 4837) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) (let ((.cse2 (select .cse0 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (< 1 (select .cse0 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| (select .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse2 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select .cse1 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse3)) (= (select (select |#memory_$Pointer$.offset| .cse3) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)))) [2022-07-19 22:13:57,202 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:13:57,203 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 22:13:57,203 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 22:13:57,203 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:13:57,203 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 22:13:57,203 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 22:13:57,203 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 22:13:57,203 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:13:57,203 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:13:57,203 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 22:13:57,206 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:57,207 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:13:57,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:13:57 BoogieIcfgContainer [2022-07-19 22:13:57,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:13:57,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:13:57,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:13:57,221 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:13:57,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:13:18" (3/4) ... [2022-07-19 22:13:57,223 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:13:57,227 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-07-19 22:13:57,227 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-07-19 22:13:57,228 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 22:13:57,228 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 22:13:57,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-19 22:13:57,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 22:13:57,231 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 22:13:57,231 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:13:57,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((node == node && node == 0) && node == 0) && #memory_$Pointer$[node][node] == rval) && !(rval == 0)) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && after == \result) && #memory_$Pointer$[node][0] == 0) && \result == after) && !(node == #memory_$Pointer$[node][node])) && #memory_$Pointer$[#memory_$Pointer$[node][node]][8] == node) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) [2022-07-19 22:13:57,254 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:13:57,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:13:57,255 INFO L158 Benchmark]: Toolchain (without parser) took 40388.98ms. Allocated memory was 113.2MB in the beginning and 287.3MB in the end (delta: 174.1MB). Free memory was 79.9MB in the beginning and 178.6MB in the end (delta: -98.7MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2022-07-19 22:13:57,255 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:13:57,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1201.21ms. Allocated memory was 113.2MB in the beginning and 159.4MB in the end (delta: 46.1MB). Free memory was 79.6MB in the beginning and 103.4MB in the end (delta: -23.8MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2022-07-19 22:13:57,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.42ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 98.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 22:13:57,255 INFO L158 Benchmark]: Boogie Preprocessor took 25.95ms. Allocated memory is still 159.4MB. Free memory was 98.3MB in the beginning and 95.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 22:13:57,256 INFO L158 Benchmark]: RCFGBuilder took 359.76ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 79.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 22:13:57,256 INFO L158 Benchmark]: TraceAbstraction took 38694.19ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 78.2MB in the beginning and 181.7MB in the end (delta: -103.5MB). Peak memory consumption was 132.4MB. Max. memory is 16.1GB. [2022-07-19 22:13:57,256 INFO L158 Benchmark]: Witness Printer took 33.17ms. Allocated memory is still 287.3MB. Free memory was 181.7MB in the beginning and 178.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 22:13:57,257 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1201.21ms. Allocated memory was 113.2MB in the beginning and 159.4MB in the end (delta: 46.1MB). Free memory was 79.6MB in the beginning and 103.4MB in the end (delta: -23.8MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.42ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 98.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.95ms. Allocated memory is still 159.4MB. Free memory was 98.3MB in the beginning and 95.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.76ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 79.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 38694.19ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 78.2MB in the beginning and 181.7MB in the end (delta: -103.5MB). Peak memory consumption was 132.4MB. Max. memory is 16.1GB. * Witness Printer took 33.17ms. Allocated memory is still 287.3MB. Free memory was 181.7MB in the beginning and 178.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.6s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 4649 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 457 IncrementalHoareTripleChecker+Unchecked, 3829 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2488 IncrementalHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 820 mSDtfsCounter, 2488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 974 GetRequests, 662 SyntacticMatches, 39 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=7, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 63 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 98 PreInvPairs, 113 NumberOfFragments, 1116 HoareAnnotationTreeSize, 98 FomulaSimplifications, 238 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 5231 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 30.8s InterpolantComputationTime, 1146 NumberOfCodeBlocks, 1146 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1365 ConstructedInterpolants, 145 QuantifiedInterpolants, 12791 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1668 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 668/764 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4836]: Loop Invariant [2022-07-19 22:13:57,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:57,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:57,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((node == node && node == 0) && node == 0) && #memory_$Pointer$[node][node] == rval) && !(rval == 0)) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && after == \result) && #memory_$Pointer$[node][0] == 0) && \result == after) && !(node == #memory_$Pointer$[node][node])) && #memory_$Pointer$[#memory_$Pointer$[node][node]][8] == node) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) RESULT: Ultimate proved your program to be correct! [2022-07-19 22:13:57,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE