./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_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 4ed07f4e0ea596aa18bb1f969a7cd7a46fb7ca4022e0f40df55654d88ab6e7f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:47:08,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:47:08,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:47:08,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:47:08,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:47:08,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:47:08,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:47:08,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:47:08,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:47:08,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:47:08,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:47:08,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:47:08,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:47:08,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:47:08,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:47:08,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:47:08,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:47:08,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:47:08,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:47:08,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:47:08,326 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:47:08,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:47:08,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:47:08,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:47:08,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:47:08,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:47:08,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:47:08,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:47:08,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:47:08,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:47:08,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:47:08,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:47:08,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:47:08,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:47:08,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:47:08,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:47:08,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:47:08,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:47:08,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:47:08,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:47:08,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:47:08,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:47:08,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 10:47:08,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:47:08,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:47:08,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:47:08,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:47:08,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:47:08,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:47:08,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:47:08,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:47:08,383 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:47:08,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:47:08,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:47:08,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:47:08,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:47:08,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:47:08,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:47:08,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:47:08,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:47:08,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:47:08,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:47:08,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:47:08,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:47:08,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:47:08,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:47:08,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:47:08,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:47:08,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:47:08,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:47:08,387 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:47:08,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:47:08,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:47:08,387 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 -> 4ed07f4e0ea596aa18bb1f969a7cd7a46fb7ca4022e0f40df55654d88ab6e7f3 [2022-07-12 10:47:08,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:47:08,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:47:08,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:47:08,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:47:08,653 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:47:08,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i [2022-07-12 10:47:08,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8dd8e7e4/0edc05a155fe4c469ad318aeeba66a68/FLAGbe81090bf [2022-07-12 10:47:09,317 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:47:09,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i [2022-07-12 10:47:09,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8dd8e7e4/0edc05a155fe4c469ad318aeeba66a68/FLAGbe81090bf [2022-07-12 10:47:09,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8dd8e7e4/0edc05a155fe4c469ad318aeeba66a68 [2022-07-12 10:47:09,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:47:09,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:47:09,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:47:09,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:47:09,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:47:09,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:47:09" (1/1) ... [2022-07-12 10:47:09,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f72a302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:09, skipping insertion in model container [2022-07-12 10:47:09,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:47:09" (1/1) ... [2022-07-12 10:47:09,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:47:09,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:47:09,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i[4506,4519] [2022-07-12 10:47:09,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i[4566,4579] [2022-07-12 10:47:10,385 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,386 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,386 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,387 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,388 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,395 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,396 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,398 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,400 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,402 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,403 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,403 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,404 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,633 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:47:10,634 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:47:10,634 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:47:10,635 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:47:10,636 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:47:10,636 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:47:10,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:47:10,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:47:10,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:47:10,638 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:47:10,769 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:47:10,782 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,786 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,828 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,828 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:47:10,911 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:47:10,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i[4506,4519] [2022-07-12 10:47:10,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i[4566,4579] [2022-07-12 10:47:10,939 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,944 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,944 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,945 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,945 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,949 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,950 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,957 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,958 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,959 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,959 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,959 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,959 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:10,980 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:47:10,982 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:47:10,983 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:47:10,984 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:47:10,985 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:47:10,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:47:10,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:47:10,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:47:10,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:47:10,987 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:47:11,014 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:47:11,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:11,077 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:11,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:11,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:11,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:47:11,424 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:47:11,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11 WrapperNode [2022-07-12 10:47:11,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:47:11,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:47:11,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:47:11,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:47:11,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,632 INFO L137 Inliner]: procedures = 695, calls = 3019, calls flagged for inlining = 67, calls inlined = 7, statements flattened = 907 [2022-07-12 10:47:11,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:47:11,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:47:11,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:47:11,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:47:11,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:47:11,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:47:11,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:47:11,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:47:11,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (1/1) ... [2022-07-12 10:47:11,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:47:11,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:47:11,737 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-12 10:47:11,789 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-12 10:47:11,816 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-12 10:47:11,817 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-12 10:47:11,817 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-12 10:47:11,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-12 10:47:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 10:47:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:47:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:47:11,818 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:47:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:47:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:47:11,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:47:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:47:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:47:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:47:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:47:11,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:47:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:47:11,820 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:47:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 10:47:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-12 10:47:11,821 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-12 10:47:11,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:47:11,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:47:11,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:47:11,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:47:11,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:47:11,821 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 10:47:11,821 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 10:47:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 10:47:11,822 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 10:47:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:47:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:47:12,064 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:47:12,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:47:12,838 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:47:12,846 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:47:12,846 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:47:12,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:47:12 BoogieIcfgContainer [2022-07-12 10:47:12,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:47:12,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:47:12,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:47:12,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:47:12,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:47:09" (1/3) ... [2022-07-12 10:47:12,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5ece8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:47:12, skipping insertion in model container [2022-07-12 10:47:12,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:11" (2/3) ... [2022-07-12 10:47:12,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5ece8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:47:12, skipping insertion in model container [2022-07-12 10:47:12,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:47:12" (3/3) ... [2022-07-12 10:47:12,854 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_comparator_string_harness.i [2022-07-12 10:47:12,863 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:47:12,863 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:47:12,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:47:12,923 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@6e962336, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6abbcfc9 [2022-07-12 10:47:12,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:47:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 79 states have internal predecessors, (102), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-12 10:47:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 10:47:12,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:12,936 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:12,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1328878926, now seen corresponding path program 1 times [2022-07-12 10:47:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:12,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943228159] [2022-07-12 10:47:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:13,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943228159] [2022-07-12 10:47:13,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943228159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:13,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:13,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:47:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711942344] [2022-07-12 10:47:13,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:13,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:47:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:47:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:47:13,570 INFO L87 Difference]: Start difference. First operand has 116 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 79 states have internal predecessors, (102), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:13,775 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2022-07-12 10:47:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:47:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2022-07-12 10:47:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:13,789 INFO L225 Difference]: With dead ends: 229 [2022-07-12 10:47:13,789 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 10:47:13,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:47:13,800 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:13,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 214 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:47:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 10:47:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-12 10:47:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 73 states have internal predecessors, (91), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 10:47:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2022-07-12 10:47:13,830 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 63 [2022-07-12 10:47:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:13,831 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2022-07-12 10:47:13,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2022-07-12 10:47:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 10:47:13,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:13,834 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:13,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:47:13,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:13,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1839926738, now seen corresponding path program 1 times [2022-07-12 10:47:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:13,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856443573] [2022-07-12 10:47:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856443573] [2022-07-12 10:47:14,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856443573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:14,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:14,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:47:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020025726] [2022-07-12 10:47:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:14,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:47:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:47:14,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:47:14,171 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 10:47:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:14,718 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2022-07-12 10:47:14,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:47:14,718 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 63 [2022-07-12 10:47:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:14,735 INFO L225 Difference]: With dead ends: 209 [2022-07-12 10:47:14,735 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 10:47:14,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:47:14,737 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 395 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:14,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 565 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:47:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 10:47:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2022-07-12 10:47:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 10:47:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2022-07-12 10:47:14,749 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 63 [2022-07-12 10:47:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:14,750 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2022-07-12 10:47:14,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 10:47:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2022-07-12 10:47:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 10:47:14,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:14,767 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:14,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:47:14,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2062013548, now seen corresponding path program 1 times [2022-07-12 10:47:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:14,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626125002] [2022-07-12 10:47:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:15,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626125002] [2022-07-12 10:47:15,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626125002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:15,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:15,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:47:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538024876] [2022-07-12 10:47:15,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:15,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:47:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:47:15,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:47:15,074 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:15,391 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2022-07-12 10:47:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:47:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2022-07-12 10:47:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:15,393 INFO L225 Difference]: With dead ends: 209 [2022-07-12 10:47:15,393 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 10:47:15,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:47:15,394 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 225 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:15,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 565 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:47:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 10:47:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2022-07-12 10:47:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 10:47:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2022-07-12 10:47:15,405 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 63 [2022-07-12 10:47:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:15,406 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2022-07-12 10:47:15,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2022-07-12 10:47:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 10:47:15,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:15,407 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:15,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:47:15,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1138862160, now seen corresponding path program 1 times [2022-07-12 10:47:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287022530] [2022-07-12 10:47:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:15,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:15,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287022530] [2022-07-12 10:47:15,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287022530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:15,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:15,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:47:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741330997] [2022-07-12 10:47:15,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:15,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:47:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:47:15,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:47:15,594 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:15,957 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2022-07-12 10:47:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:47:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2022-07-12 10:47:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:15,959 INFO L225 Difference]: With dead ends: 209 [2022-07-12 10:47:15,959 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 10:47:15,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:47:15,960 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 254 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:15,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 651 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:47:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 10:47:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2022-07-12 10:47:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 10:47:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2022-07-12 10:47:15,970 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 63 [2022-07-12 10:47:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:15,971 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2022-07-12 10:47:15,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2022-07-12 10:47:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 10:47:15,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:15,972 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:15,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:47:15,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:15,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1531889170, now seen corresponding path program 1 times [2022-07-12 10:47:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:15,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395532499] [2022-07-12 10:47:15,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:16,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:16,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395532499] [2022-07-12 10:47:16,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395532499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:16,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:16,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:47:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73999911] [2022-07-12 10:47:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:16,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:47:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:47:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:47:16,126 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 10:47:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:16,332 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2022-07-12 10:47:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:47:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2022-07-12 10:47:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:16,334 INFO L225 Difference]: With dead ends: 167 [2022-07-12 10:47:16,334 INFO L226 Difference]: Without dead ends: 139 [2022-07-12 10:47:16,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-12 10:47:16,335 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 62 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:16,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 428 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:47:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-12 10:47:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-07-12 10:47:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 92 states have internal predecessors, (112), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-12 10:47:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-07-12 10:47:16,345 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 63 [2022-07-12 10:47:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:16,345 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-07-12 10:47:16,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 10:47:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-07-12 10:47:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 10:47:16,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:16,346 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:16,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:47:16,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:16,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -103923128, now seen corresponding path program 1 times [2022-07-12 10:47:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:16,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871756103] [2022-07-12 10:47:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:16,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871756103] [2022-07-12 10:47:16,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871756103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:16,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:16,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:47:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381728280] [2022-07-12 10:47:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:16,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:47:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:47:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:47:16,510 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:16,728 INFO L93 Difference]: Finished difference Result 160 states and 207 transitions. [2022-07-12 10:47:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:47:16,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-12 10:47:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:16,729 INFO L225 Difference]: With dead ends: 160 [2022-07-12 10:47:16,729 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 10:47:16,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:47:16,730 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 163 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:16,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 334 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:47:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 10:47:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-12 10:47:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 92 states have internal predecessors, (111), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-12 10:47:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-07-12 10:47:16,739 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 64 [2022-07-12 10:47:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:16,739 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-07-12 10:47:16,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-07-12 10:47:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 10:47:16,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:16,740 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:16,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:47:16,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:16,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1998268983, now seen corresponding path program 1 times [2022-07-12 10:47:16,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:16,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882470442] [2022-07-12 10:47:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:16,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:16,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882470442] [2022-07-12 10:47:16,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882470442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:16,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:16,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:47:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221716359] [2022-07-12 10:47:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:16,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:47:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:16,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:47:16,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:47:16,911 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:17,184 INFO L93 Difference]: Finished difference Result 229 states and 310 transitions. [2022-07-12 10:47:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:47:17,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2022-07-12 10:47:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:17,186 INFO L225 Difference]: With dead ends: 229 [2022-07-12 10:47:17,186 INFO L226 Difference]: Without dead ends: 206 [2022-07-12 10:47:17,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:47:17,187 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 154 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:17,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 543 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:47:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-12 10:47:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 141. [2022-07-12 10:47:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 96 states have internal predecessors, (115), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-12 10:47:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 187 transitions. [2022-07-12 10:47:17,203 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 187 transitions. Word has length 65 [2022-07-12 10:47:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:17,204 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 187 transitions. [2022-07-12 10:47:17,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:47:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 187 transitions. [2022-07-12 10:47:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 10:47:17,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:17,205 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:17,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:47:17,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1740103545, now seen corresponding path program 1 times [2022-07-12 10:47:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:17,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358054377] [2022-07-12 10:47:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 10:47:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:17,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358054377] [2022-07-12 10:47:17,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358054377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:17,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:17,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:47:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011114034] [2022-07-12 10:47:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:17,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:47:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:47:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:47:17,351 INFO L87 Difference]: Start difference. First operand 141 states and 187 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 10:47:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:17,534 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-07-12 10:47:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:47:17,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2022-07-12 10:47:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:17,535 INFO L225 Difference]: With dead ends: 164 [2022-07-12 10:47:17,535 INFO L226 Difference]: Without dead ends: 141 [2022-07-12 10:47:17,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:47:17,536 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 30 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:17,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 410 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:47:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-12 10:47:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2022-07-12 10:47:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 92 states have internal predecessors, (110), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-12 10:47:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 182 transitions. [2022-07-12 10:47:17,544 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 182 transitions. Word has length 65 [2022-07-12 10:47:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:17,544 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 182 transitions. [2022-07-12 10:47:17,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 10:47:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2022-07-12 10:47:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 10:47:17,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:17,545 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:17,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:47:17,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:17,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash -956508146, now seen corresponding path program 1 times [2022-07-12 10:47:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:17,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300250177] [2022-07-12 10:47:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:47:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:47:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:47:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:47:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:47:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 10:47:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 10:47:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300250177] [2022-07-12 10:47:17,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300250177] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:47:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728913841] [2022-07-12 10:47:17,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:17,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:47:17,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:47:17,948 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-12 10:47:17,967 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-12 10:47:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:18,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 10:47:18,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:47:19,107 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 10:47:19,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2022-07-12 10:47:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 10:47:19,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:47:19,671 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 17 treesize of output 9 [2022-07-12 10:47:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 10:47:19,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728913841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:47:19,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:47:19,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 40 [2022-07-12 10:47:19,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204219420] [2022-07-12 10:47:19,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:47:19,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 10:47:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:19,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 10:47:19,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1443, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 10:47:19,747 INFO L87 Difference]: Start difference. First operand 137 states and 182 transitions. Second operand has 40 states, 34 states have (on average 3.235294117647059) internal successors, (110), 32 states have internal predecessors, (110), 14 states have call successors, (29), 7 states have call predecessors, (29), 9 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-12 10:47:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:20,275 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2022-07-12 10:47:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:47:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 3.235294117647059) internal successors, (110), 32 states have internal predecessors, (110), 14 states have call successors, (29), 7 states have call predecessors, (29), 9 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) Word has length 81 [2022-07-12 10:47:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:20,276 INFO L225 Difference]: With dead ends: 170 [2022-07-12 10:47:20,276 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 10:47:20,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 148 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=2446, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 10:47:20,278 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 59 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:20,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 283 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 422 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-07-12 10:47:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 10:47:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 10:47:20,278 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-12 10:47:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 10:47:20,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2022-07-12 10:47:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:20,278 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 10:47:20,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 3.235294117647059) internal successors, (110), 32 states have internal predecessors, (110), 14 states have call successors, (29), 7 states have call predecessors, (29), 9 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-12 10:47:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 10:47:20,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 10:47:20,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 10:47:20,303 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-12 10:47:20,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:47:20,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 10:47:20,727 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6849 6853) no Hoare annotation was computed. [2022-07-12 10:47:20,727 INFO L899 garLoopResultBuilder]: For program point L6850-1(line 6850) no Hoare annotation was computed. [2022-07-12 10:47:20,727 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6849 6853) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 10:47:20,727 INFO L895 garLoopResultBuilder]: At program point L6864(lines 6855 6865) the Hoare annotation is: (let ((.cse0 (@diff |old(#valid)| |#valid|))) (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (or (= (select |old(#valid)| .cse0) 0) (= |old(#valid)| |#valid|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= (store |old(#valid)| .cse0 (select |#valid| .cse0)) |#valid|))) [2022-07-12 10:47:20,727 INFO L899 garLoopResultBuilder]: For program point L6859-1(lines 6859 6860) no Hoare annotation was computed. [2022-07-12 10:47:20,727 INFO L895 garLoopResultBuilder]: At program point L6859(line 6859) the Hoare annotation is: (let ((.cse0 (@diff |old(#valid)| |#valid|))) (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (or (= (select |old(#valid)| .cse0) 0) (= |old(#valid)| |#valid|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= (store |old(#valid)| .cse0 (select |#valid| .cse0)) |#valid|))) [2022-07-12 10:47:20,727 INFO L899 garLoopResultBuilder]: For program point L6859-5(lines 6859 6860) no Hoare annotation was computed. [2022-07-12 10:47:20,727 INFO L899 garLoopResultBuilder]: For program point L6856-1(line 6856) no Hoare annotation was computed. [2022-07-12 10:47:20,727 INFO L895 garLoopResultBuilder]: At program point L6856(line 6856) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) [2022-07-12 10:47:20,727 INFO L899 garLoopResultBuilder]: For program point L6859-3(line 6859) no Hoare annotation was computed. [2022-07-12 10:47:20,727 INFO L895 garLoopResultBuilder]: At program point L6859-2(line 6859) the Hoare annotation is: (let ((.cse0 (@diff |old(#valid)| |#valid|))) (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (or (= (select |old(#valid)| .cse0) 0) (= |old(#valid)| |#valid|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= (store |old(#valid)| .cse0 (select |#valid| .cse0)) |#valid|))) [2022-07-12 10:47:20,727 INFO L895 garLoopResultBuilder]: At program point L6850(line 6850) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 10:47:20,727 INFO L899 garLoopResultBuilder]: For program point L6851-1(line 6851) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L895 garLoopResultBuilder]: At program point L6851(line 6851) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6849 6853) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6931 6936) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6931 6936) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6931 6936) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point L6932-1(lines 6932 6934) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L895 garLoopResultBuilder]: At program point L6932(lines 6932 6934) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-12 10:47:20,728 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6291 6295) the Hoare annotation is: true [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6291 6295) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6291 6295) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point L6293-2(line 6293) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L902 garLoopResultBuilder]: At program point L6293(line 6293) the Hoare annotation is: true [2022-07-12 10:47:20,728 INFO L902 garLoopResultBuilder]: At program point L6293-1(line 6293) the Hoare annotation is: true [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6938 6940) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6938 6940) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6938 6940) the Hoare annotation is: true [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point L6305-2(line 6305) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point L6305-3(line 6305) no Hoare annotation was computed. [2022-07-12 10:47:20,728 INFO L899 garLoopResultBuilder]: For program point L6305(line 6305) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6301 6306) the Hoare annotation is: true [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L6305-5(line 6305) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6301 6306) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6301 6306) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9846-1(line 9846) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9524(lines 9524 9528) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L895 garLoopResultBuilder]: At program point L9846(line 9846) the Hoare annotation is: false [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9838(lines 9838 9856) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L895 garLoopResultBuilder]: At program point L9541(line 9541) the Hoare annotation is: false [2022-07-12 10:47:20,729 INFO L895 garLoopResultBuilder]: At program point L9541-1(line 9541) the Hoare annotation is: false [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9541-2(line 9541) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9847-2(lines 9847 9851) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9847-3(lines 9847 9855) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9847-4(lines 9847 9855) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L7155-1(line 7155) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L895 garLoopResultBuilder]: At program point L7155(line 7155) the Hoare annotation is: false [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9847(lines 9847 9848) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9558(lines 9558 9562) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L895 garLoopResultBuilder]: At program point L9839(line 9839) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base|) 1) (not (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base| 0))) [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9839-1(line 9839) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L9542(lines 9542 9544) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L899 garLoopResultBuilder]: For program point L7156-1(lines 7156 7158) no Hoare annotation was computed. [2022-07-12 10:47:20,729 INFO L895 garLoopResultBuilder]: At program point L7156(lines 7156 7158) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9840-3(line 9840) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9840-4(line 9840) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9840-5(line 9840) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9840(line 9840) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9840-1(line 9840) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9551(lines 9518 9552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base|) 1) (not (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base| 0)) (not (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base| |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_b~1#1.base|)) (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~nondet_parameter_a~0#1| (* 256 (div |ULTIMATE.start_aws_array_list_comparator_string_harness_~nondet_parameter_a~0#1| 256))) (not (= 0 |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_b~1#1.base|))) [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L7148(lines 7148 7161) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L902 garLoopResultBuilder]: At program point L9857(line 9857) the Hoare annotation is: true [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9849-1(lines 9849 9850) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9519-2(line 9519) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9519-3(line 9519) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9519-4(line 9519) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9519-5(line 9519) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9519(line 9519) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L7149-1(lines 7148 7161) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L7149(line 7149) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9520-3(line 9520) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9520-4(line 9520) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9520-5(line 9520) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9520(line 9520) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9520-2(line 9520) the Hoare annotation is: false [2022-07-12 10:47:20,730 INFO L895 garLoopResultBuilder]: At program point L9570(lines 9554 9571) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base| 0))) (.cse2 (not (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base| |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_b~1#1.base|))) (.cse3 (not (= 0 |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_b~1#1.base|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base| |ULTIMATE.start_aws_array_list_comparator_string_harness_#t~ite1501#1.base|) (= |ULTIMATE.start_aws_array_list_comparator_string_#res#1| 1) .cse3 (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~#str_a~1#1.base| |ULTIMATE.start_aws_array_list_comparator_string_~a#1.base|)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_array_list_comparator_string_harness_~nondet_parameter_a~0#1| (* 256 (div |ULTIMATE.start_aws_array_list_comparator_string_harness_~nondet_parameter_a~0#1| 256))) .cse3))) [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9545(lines 9545 9547) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9537(line 9537) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L9537-2(line 9537) no Hoare annotation was computed. [2022-07-12 10:47:20,730 INFO L899 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L895 garLoopResultBuilder]: At program point L7159(line 7159) the Hoare annotation is: false [2022-07-12 10:47:20,731 INFO L895 garLoopResultBuilder]: At program point L9843(line 9843) the Hoare annotation is: false [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9843-1(line 9843) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9529(lines 9529 9533) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9521(lines 9521 9523) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9852(lines 9852 9854) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9563(lines 9563 9567) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L895 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: false [2022-07-12 10:47:20,731 INFO L895 garLoopResultBuilder]: At program point L9539-1(line 9539) the Hoare annotation is: false [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9539-2(line 9539) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9548(lines 9548 9550) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L895 garLoopResultBuilder]: At program point L9540(line 9540) the Hoare annotation is: false [2022-07-12 10:47:20,731 INFO L895 garLoopResultBuilder]: At program point L9540-1(line 9540) the Hoare annotation is: false [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L9540-2(line 9540) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-12 10:47:20,731 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-12 10:47:20,733 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:47:20,734 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:47:20,738 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:586) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateSelect(Term2Expression.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 10:47:20,741 INFO L158 Benchmark]: Toolchain (without parser) took 11230.72ms. Allocated memory was 113.2MB in the beginning and 398.5MB in the end (delta: 285.2MB). Free memory was 86.2MB in the beginning and 261.9MB in the end (delta: -175.7MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2022-07-12 10:47:20,741 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:47:20,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1913.08ms. Allocated memory was 113.2MB in the beginning and 226.5MB in the end (delta: 113.2MB). Free memory was 85.8MB in the beginning and 148.7MB in the end (delta: -62.9MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2022-07-12 10:47:20,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 207.14ms. Allocated memory is still 226.5MB. Free memory was 148.7MB in the beginning and 136.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 10:47:20,742 INFO L158 Benchmark]: Boogie Preprocessor took 75.95ms. Allocated memory is still 226.5MB. Free memory was 136.0MB in the beginning and 128.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 10:47:20,742 INFO L158 Benchmark]: RCFGBuilder took 1137.94ms. Allocated memory is still 226.5MB. Free memory was 128.8MB in the beginning and 113.0MB in the end (delta: 15.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-12 10:47:20,742 INFO L158 Benchmark]: TraceAbstraction took 7891.15ms. Allocated memory was 226.5MB in the beginning and 398.5MB in the end (delta: 172.0MB). Free memory was 112.0MB in the beginning and 261.9MB in the end (delta: -149.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-07-12 10:47:20,743 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.14ms. Allocated memory is still 92.3MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1913.08ms. Allocated memory was 113.2MB in the beginning and 226.5MB in the end (delta: 113.2MB). Free memory was 85.8MB in the beginning and 148.7MB in the end (delta: -62.9MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 207.14ms. Allocated memory is still 226.5MB. Free memory was 148.7MB in the beginning and 136.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.95ms. Allocated memory is still 226.5MB. Free memory was 136.0MB in the beginning and 128.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1137.94ms. Allocated memory is still 226.5MB. Free memory was 128.8MB in the beginning and 113.0MB in the end (delta: 15.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7891.15ms. Allocated memory was 226.5MB in the beginning and 398.5MB in the end (delta: 172.0MB). Free memory was 112.0MB in the beginning and 261.9MB in the end (delta: -149.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * 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 10 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1519 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1400 mSDsluCounter, 3993 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 74 IncrementalHoareTripleChecker+Unchecked, 2710 mSDsCounter, 647 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2525 IncrementalHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 647 mSolverCounterUnsat, 1283 mSDtfsCounter, 2525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 296 SyntacticMatches, 10 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=7, InterpolantAutomatonStates: 68, 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, 9 MinimizatonAttempts, 293 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 152 PreInvPairs, 160 NumberOfFragments, 408 HoareAnnotationTreeSize, 152 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 40 FomulaSimplificationsInter, 2166 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 741 ConstructedInterpolants, 21 QuantifiedInterpolants, 2833 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2641 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 284/302 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 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:586) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 10:47:20,787 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 4ed07f4e0ea596aa18bb1f969a7cd7a46fb7ca4022e0f40df55654d88ab6e7f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:47:22,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:47:22,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:47:22,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:47:22,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:47:22,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:47:22,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:47:22,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:47:22,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:47:22,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:47:22,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:47:22,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:47:22,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:47:22,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:47:22,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:47:22,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:47:22,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:47:22,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:47:22,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:47:22,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:47:22,637 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:47:22,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:47:22,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:47:22,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:47:22,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:47:22,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:47:22,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:47:22,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:47:22,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:47:22,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:47:22,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:47:22,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:47:22,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:47:22,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:47:22,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:47:22,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:47:22,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:47:22,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:47:22,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:47:22,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:47:22,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:47:22,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:47:22,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 10:47:22,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:47:22,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:47:22,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:47:22,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:47:22,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:47:22,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:47:22,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:47:22,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:47:22,687 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:47:22,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:47:22,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:47:22,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:47:22,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:47:22,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:47:22,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 10:47:22,695 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 10:47:22,695 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 10:47:22,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:47:22,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:47:22,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:47:22,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:47:22,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:47:22,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:47:22,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:47:22,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:47:22,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:47:22,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:47:22,697 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 10:47:22,697 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 10:47:22,697 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:47:22,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:47:22,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:47:22,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 10:47:22,698 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 4ed07f4e0ea596aa18bb1f969a7cd7a46fb7ca4022e0f40df55654d88ab6e7f3 [2022-07-12 10:47:22,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:47:23,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:47:23,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:47:23,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:47:23,018 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:47:23,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i [2022-07-12 10:47:23,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e95ebfe/467176f7cbd94fe4adb69d0b2b7678fe/FLAGc2dd1b4cc [2022-07-12 10:47:23,683 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:47:23,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i [2022-07-12 10:47:23,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e95ebfe/467176f7cbd94fe4adb69d0b2b7678fe/FLAGc2dd1b4cc [2022-07-12 10:47:24,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e95ebfe/467176f7cbd94fe4adb69d0b2b7678fe [2022-07-12 10:47:24,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:47:24,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:47:24,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:47:24,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:47:24,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:47:24,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:47:24" (1/1) ... [2022-07-12 10:47:24,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a94c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:47:24, skipping insertion in model container [2022-07-12 10:47:24,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:47:24" (1/1) ... [2022-07-12 10:47:24,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:47:24,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:47:24,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i[4506,4519] [2022-07-12 10:47:24,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i[4566,4579] [2022-07-12 10:47:25,035 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,036 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,036 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,037 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,037 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,053 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,054 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,055 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,055 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,056 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,057 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,063 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,063 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:47:25,300 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:47:25,301 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:47:25,301 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:47:25,302 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:47:25,302 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:47:25,303 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:47:25,303 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:47:25,303 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:47:25,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:47:25,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:47:25,418 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:47:25,438 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1384) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:249) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.translateInitializer(CHandler.java:2978) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2836) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2138) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 10:47:25,453 INFO L158 Benchmark]: Toolchain (without parser) took 1394.44ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.3MB in the beginning and 53.0MB in the end (delta: -8.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-07-12 10:47:25,453 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 35.8MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:47:25,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1393.06ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.2MB in the beginning and 53.0MB in the end (delta: -8.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-07-12 10:47:25,455 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.15ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 35.8MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1393.06ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.2MB in the beginning and 53.0MB in the end (delta: -8.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range