./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_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-?-f4b24e3 [2022-07-13 22:28:04,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:28:04,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:28:04,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:28:04,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:28:04,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:28:04,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:28:04,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:28:04,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:28:04,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:28:04,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:28:04,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:28:04,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:28:04,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:28:04,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:28:04,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:28:04,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:28:04,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:28:04,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:28:04,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:28:04,124 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:28:04,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:28:04,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:28:04,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:28:04,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:28:04,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:28:04,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:28:04,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:28:04,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:28:04,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:28:04,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:28:04,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:28:04,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:28:04,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:28:04,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:28:04,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:28:04,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:28:04,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:28:04,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:28:04,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:28:04,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:28:04,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:28:04,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:28:04,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:28:04,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:28:04,166 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:28:04,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:28:04,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:28:04,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:28:04,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:28:04,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:28:04,169 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:28:04,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:28:04,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:28:04,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:28:04,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:28:04,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:28:04,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:28:04,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:28:04,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:28:04,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:28:04,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:28:04,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:28:04,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:28:04,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:28:04,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:28:04,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:28:04,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:28:04,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:28:04,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:28:04,178 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:28:04,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:28:04,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:28:04,178 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-13 22:28:04,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:28:04,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:28:04,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:28:04,343 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:28:04,347 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:28:04,348 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-13 22:28:04,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c6cd818/1d505bf9b47e4f37945e0f29ae40ad88/FLAGe97bde490 [2022-07-13 22:28:04,980 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:28:04,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i [2022-07-13 22:28:05,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c6cd818/1d505bf9b47e4f37945e0f29ae40ad88/FLAGe97bde490 [2022-07-13 22:28:05,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c6cd818/1d505bf9b47e4f37945e0f29ae40ad88 [2022-07-13 22:28:05,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:28:05,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:28:05,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:28:05,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:28:05,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:28:05,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:05" (1/1) ... [2022-07-13 22:28:05,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56897e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:05, skipping insertion in model container [2022-07-13 22:28:05,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:05" (1/1) ... [2022-07-13 22:28:05,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:28:05,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:28:05,681 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-13 22:28:05,686 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-13 22:28:06,145 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,146 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,146 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,146 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,147 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,158 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,159 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,436 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:28:06,442 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:28:06,442 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:28:06,443 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:28:06,444 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:28:06,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:28:06,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:28:06,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:28:06,446 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:28:06,446 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:28:06,545 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:28:06,558 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,561 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,601 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,602 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:28:06,744 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:28:06,761 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-13 22:28:06,762 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-13 22:28:06,797 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,798 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,798 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,798 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,799 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,802 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,803 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,803 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,804 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,804 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,805 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,805 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,805 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,833 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:28:06,833 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:28:06,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:28:06,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:28:06,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:28:06,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:28:06,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:28:06,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:28:06,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:28:06,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:28:06,860 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:28:06,870 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,873 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,898 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,898 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:06,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:28:07,082 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:28:07,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07 WrapperNode [2022-07-13 22:28:07,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:28:07,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:28:07,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:28:07,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:28:07,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,249 INFO L137 Inliner]: procedures = 695, calls = 3019, calls flagged for inlining = 67, calls inlined = 7, statements flattened = 907 [2022-07-13 22:28:07,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:28:07,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:28:07,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:28:07,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:28:07,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:28:07,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:28:07,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:28:07,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:28:07,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (1/1) ... [2022-07-13 22:28:07,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:28:07,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:28:07,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:28:07,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:28:07,376 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-13 22:28:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-13 22:28:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:28:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:28:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 22:28:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:28:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:28:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:28:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:28:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:28:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:28:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:28:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:28:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:28:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:28:07,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:28:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:28:07,380 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:28:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:28:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-13 22:28:07,380 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-13 22:28:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:28:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:28:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:28:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:28:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:28:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:28:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:28:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:28:07,381 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:28:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:28:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:28:07,599 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:28:07,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:28:08,264 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:28:08,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:28:08,268 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:28:08,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:28:08 BoogieIcfgContainer [2022-07-13 22:28:08,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:28:08,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:28:08,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:28:08,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:28:08,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:28:05" (1/3) ... [2022-07-13 22:28:08,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29221647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:28:08, skipping insertion in model container [2022-07-13 22:28:08,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:07" (2/3) ... [2022-07-13 22:28:08,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29221647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:28:08, skipping insertion in model container [2022-07-13 22:28:08,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:28:08" (3/3) ... [2022-07-13 22:28:08,275 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_comparator_string_harness.i [2022-07-13 22:28:08,284 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:28:08,284 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:28:08,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:28:08,317 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@33098b54, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2fbe116e [2022-07-13 22:28:08,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:28:08,320 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-13 22:28:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:28:08,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:08,336 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-13 22:28:08,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1328878926, now seen corresponding path program 1 times [2022-07-13 22:28:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:08,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630619793] [2022-07-13 22:28:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:08,919 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-13 22:28:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:08,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630619793] [2022-07-13 22:28:08,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630619793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:08,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:08,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:28:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021745374] [2022-07-13 22:28:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:08,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:28:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:08,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:28:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:28:08,950 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-13 22:28:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:09,133 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2022-07-13 22:28:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:28:09,135 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-13 22:28:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:09,140 INFO L225 Difference]: With dead ends: 229 [2022-07-13 22:28:09,141 INFO L226 Difference]: Without dead ends: 109 [2022-07-13 22:28:09,143 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-13 22:28:09,145 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-13 22:28:09,146 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-13 22:28:09,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-13 22:28:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-13 22:28:09,171 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-13 22:28:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2022-07-13 22:28:09,174 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 63 [2022-07-13 22:28:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:09,174 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2022-07-13 22:28:09,175 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-13 22:28:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2022-07-13 22:28:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:28:09,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:09,177 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-13 22:28:09,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:28:09,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1839926738, now seen corresponding path program 1 times [2022-07-13 22:28:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:09,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372768647] [2022-07-13 22:28:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:09,612 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-13 22:28:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:09,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372768647] [2022-07-13 22:28:09,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372768647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:09,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:09,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:28:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402699170] [2022-07-13 22:28:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:09,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:28:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:28:09,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:28:09,615 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-13 22:28:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:10,192 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2022-07-13 22:28:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:28:10,193 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-13 22:28:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:10,195 INFO L225 Difference]: With dead ends: 209 [2022-07-13 22:28:10,203 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 22:28:10,203 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-13 22:28:10,204 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-13 22:28:10,205 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-13 22:28:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 22:28:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2022-07-13 22:28:10,220 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-13 22:28:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2022-07-13 22:28:10,221 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 63 [2022-07-13 22:28:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:10,222 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2022-07-13 22:28:10,222 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-13 22:28:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2022-07-13 22:28:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:28:10,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:10,223 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-13 22:28:10,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:28:10,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2062013548, now seen corresponding path program 1 times [2022-07-13 22:28:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:10,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078919230] [2022-07-13 22:28:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,456 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-13 22:28:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:10,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078919230] [2022-07-13 22:28:10,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078919230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:10,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:10,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:28:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880130237] [2022-07-13 22:28:10,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:10,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:28:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:10,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:28:10,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:28:10,462 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-13 22:28:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:10,768 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2022-07-13 22:28:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:28:10,769 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-13 22:28:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:10,774 INFO L225 Difference]: With dead ends: 209 [2022-07-13 22:28:10,774 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 22:28:10,774 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-13 22:28:10,779 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-13 22:28:10,780 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-13 22:28:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 22:28:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2022-07-13 22:28:10,794 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-13 22:28:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2022-07-13 22:28:10,795 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 63 [2022-07-13 22:28:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:10,795 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2022-07-13 22:28:10,796 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-13 22:28:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2022-07-13 22:28:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:28:10,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:10,797 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-13 22:28:10,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:28:10,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1138862160, now seen corresponding path program 1 times [2022-07-13 22:28:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:10,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196842423] [2022-07-13 22:28:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:10,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:10,973 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-13 22:28:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:10,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196842423] [2022-07-13 22:28:10,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196842423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:10,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:28:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812802561] [2022-07-13 22:28:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:10,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:28:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:28:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:28:10,975 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-13 22:28:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:11,332 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2022-07-13 22:28:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:28:11,333 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-13 22:28:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:11,334 INFO L225 Difference]: With dead ends: 209 [2022-07-13 22:28:11,334 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 22:28:11,334 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-13 22:28:11,335 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-13 22:28:11,335 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-13 22:28:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 22:28:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2022-07-13 22:28:11,342 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-13 22:28:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2022-07-13 22:28:11,343 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 63 [2022-07-13 22:28:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:11,343 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2022-07-13 22:28:11,344 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-13 22:28:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2022-07-13 22:28:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:28:11,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:11,344 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-13 22:28:11,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:28:11,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1531889170, now seen corresponding path program 1 times [2022-07-13 22:28:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584153496] [2022-07-13 22:28:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,509 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-13 22:28:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584153496] [2022-07-13 22:28:11,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584153496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:11,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:11,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:28:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331982981] [2022-07-13 22:28:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:11,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:28:11,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:28:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:28:11,511 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-13 22:28:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:11,696 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2022-07-13 22:28:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:28:11,697 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-13 22:28:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:11,698 INFO L225 Difference]: With dead ends: 167 [2022-07-13 22:28:11,698 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 22:28:11,698 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-13 22:28:11,699 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 62 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 22:28:11,699 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-13 22:28:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 22:28:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-07-13 22:28:11,706 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-13 22:28:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-07-13 22:28:11,707 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 63 [2022-07-13 22:28:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:11,708 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-07-13 22:28:11,708 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-13 22:28:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-07-13 22:28:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 22:28:11,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:11,709 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-13 22:28:11,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:28:11,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:11,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -103923128, now seen corresponding path program 1 times [2022-07-13 22:28:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:11,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888319716] [2022-07-13 22:28:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:11,920 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-13 22:28:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888319716] [2022-07-13 22:28:11,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888319716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:11,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:11,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:28:11,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234561484] [2022-07-13 22:28:11,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:11,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:28:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:11,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:28:11,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:28:11,922 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-13 22:28:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:12,135 INFO L93 Difference]: Finished difference Result 160 states and 207 transitions. [2022-07-13 22:28:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:28:12,136 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-13 22:28:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:12,137 INFO L225 Difference]: With dead ends: 160 [2022-07-13 22:28:12,137 INFO L226 Difference]: Without dead ends: 137 [2022-07-13 22:28:12,138 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-13 22:28:12,138 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-13 22:28:12,138 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-13 22:28:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-13 22:28:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-13 22:28:12,145 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-13 22:28:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-07-13 22:28:12,146 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 64 [2022-07-13 22:28:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:12,146 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-07-13 22:28:12,146 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-13 22:28:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-07-13 22:28:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:28:12,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:12,149 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-13 22:28:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:28:12,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1998268983, now seen corresponding path program 1 times [2022-07-13 22:28:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:12,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165072995] [2022-07-13 22:28:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,328 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-13 22:28:12,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:12,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165072995] [2022-07-13 22:28:12,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165072995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:12,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:12,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:28:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674540350] [2022-07-13 22:28:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:28:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:28:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:28:12,330 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-13 22:28:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:12,581 INFO L93 Difference]: Finished difference Result 229 states and 310 transitions. [2022-07-13 22:28:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:28:12,582 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-13 22:28:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:12,583 INFO L225 Difference]: With dead ends: 229 [2022-07-13 22:28:12,583 INFO L226 Difference]: Without dead ends: 206 [2022-07-13 22:28:12,583 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-13 22:28:12,583 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-13 22:28:12,584 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-13 22:28:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-13 22:28:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 141. [2022-07-13 22:28:12,593 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-13 22:28:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 187 transitions. [2022-07-13 22:28:12,595 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 187 transitions. Word has length 65 [2022-07-13 22:28:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:12,595 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 187 transitions. [2022-07-13 22:28:12,595 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-13 22:28:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 187 transitions. [2022-07-13 22:28:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:28:12,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:12,596 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-13 22:28:12,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:28:12,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1740103545, now seen corresponding path program 1 times [2022-07-13 22:28:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:12,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075949358] [2022-07-13 22:28:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:12,761 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-13 22:28:12,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:12,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075949358] [2022-07-13 22:28:12,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075949358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:28:12,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:28:12,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:28:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983607078] [2022-07-13 22:28:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:28:12,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:28:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:28:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:28:12,763 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-13 22:28:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:12,933 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-07-13 22:28:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:28:12,934 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-13 22:28:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:12,935 INFO L225 Difference]: With dead ends: 164 [2022-07-13 22:28:12,935 INFO L226 Difference]: Without dead ends: 141 [2022-07-13 22:28:12,935 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-13 22:28:12,936 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-13 22:28:12,936 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-13 22:28:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-13 22:28:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2022-07-13 22:28:12,942 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-13 22:28:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 182 transitions. [2022-07-13 22:28:12,942 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 182 transitions. Word has length 65 [2022-07-13 22:28:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:12,943 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 182 transitions. [2022-07-13 22:28:12,943 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-13 22:28:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2022-07-13 22:28:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-13 22:28:12,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:28:12,944 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-13 22:28:12,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:28:12,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:28:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:28:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash -956508146, now seen corresponding path program 1 times [2022-07-13 22:28:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:28:12,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452952994] [2022-07-13 22:28:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:28:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:28:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:28:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:28:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:28:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:28:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:28:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:28:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:28:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:28:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:28:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,359 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-13 22:28:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:28:13,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452952994] [2022-07-13 22:28:13,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452952994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:28:13,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932834267] [2022-07-13 22:28:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:28:13,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:28:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:28:13,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:28:13,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:28:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:13,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 22:28:13,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:28:14,518 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 22:28:14,519 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-13 22:28:14,602 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-13 22:28:14,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:28:15,160 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-13 22:28:15,210 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-13 22:28:15,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932834267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:28:15,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:28:15,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 40 [2022-07-13 22:28:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700762944] [2022-07-13 22:28:15,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:28:15,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-13 22:28:15,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:28:15,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-13 22:28:15,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1443, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 22:28:15,213 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-13 22:28:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:28:15,755 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2022-07-13 22:28:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:28:15,768 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-13 22:28:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:28:15,768 INFO L225 Difference]: With dead ends: 170 [2022-07-13 22:28:15,768 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 22:28:15,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 148 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=2446, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 22:28:15,770 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:28:15,770 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.3s Time] [2022-07-13 22:28:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 22:28:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 22:28:15,771 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-13 22:28:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 22:28:15,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2022-07-13 22:28:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:28:15,771 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 22:28:15,772 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-13 22:28:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 22:28:15,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 22:28:15,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 22:28:15,801 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-13 22:28:15,987 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-13 22:28:15,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 22:28:16,243 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6849 6853) no Hoare annotation was computed. [2022-07-13 22:28:16,243 INFO L899 garLoopResultBuilder]: For program point L6850-1(line 6850) no Hoare annotation was computed. [2022-07-13 22:28:16,243 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-13 22:28:16,244 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-13 22:28:16,244 INFO L899 garLoopResultBuilder]: For program point L6859-1(lines 6859 6860) no Hoare annotation was computed. [2022-07-13 22:28:16,244 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-13 22:28:16,244 INFO L899 garLoopResultBuilder]: For program point L6859-5(lines 6859 6860) no Hoare annotation was computed. [2022-07-13 22:28:16,244 INFO L899 garLoopResultBuilder]: For program point L6856-1(line 6856) no Hoare annotation was computed. [2022-07-13 22:28:16,244 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-13 22:28:16,244 INFO L899 garLoopResultBuilder]: For program point L6859-3(line 6859) no Hoare annotation was computed. [2022-07-13 22:28:16,245 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-13 22:28:16,245 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-13 22:28:16,245 INFO L899 garLoopResultBuilder]: For program point L6851-1(line 6851) no Hoare annotation was computed. [2022-07-13 22:28:16,245 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-13 22:28:16,245 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6849 6853) no Hoare annotation was computed. [2022-07-13 22:28:16,245 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6931 6936) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-13 22:28:16,245 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6931 6936) no Hoare annotation was computed. [2022-07-13 22:28:16,246 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6931 6936) no Hoare annotation was computed. [2022-07-13 22:28:16,246 INFO L899 garLoopResultBuilder]: For program point L6932-1(lines 6932 6934) no Hoare annotation was computed. [2022-07-13 22:28:16,246 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-13 22:28:16,246 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-13 22:28:16,246 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-13 22:28:16,246 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-13 22:28:16,246 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6291 6295) the Hoare annotation is: true [2022-07-13 22:28:16,246 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6291 6295) no Hoare annotation was computed. [2022-07-13 22:28:16,246 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6291 6295) no Hoare annotation was computed. [2022-07-13 22:28:16,247 INFO L899 garLoopResultBuilder]: For program point L6293-2(line 6293) no Hoare annotation was computed. [2022-07-13 22:28:16,247 INFO L902 garLoopResultBuilder]: At program point L6293(line 6293) the Hoare annotation is: true [2022-07-13 22:28:16,247 INFO L902 garLoopResultBuilder]: At program point L6293-1(line 6293) the Hoare annotation is: true [2022-07-13 22:28:16,247 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:28:16,247 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-13 22:28:16,247 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 22:28:16,247 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:28:16,247 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6938 6940) no Hoare annotation was computed. [2022-07-13 22:28:16,248 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6938 6940) no Hoare annotation was computed. [2022-07-13 22:28:16,248 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6938 6940) the Hoare annotation is: true [2022-07-13 22:28:16,248 INFO L899 garLoopResultBuilder]: For program point L6305-2(line 6305) no Hoare annotation was computed. [2022-07-13 22:28:16,248 INFO L899 garLoopResultBuilder]: For program point L6305-3(line 6305) no Hoare annotation was computed. [2022-07-13 22:28:16,248 INFO L899 garLoopResultBuilder]: For program point L6305(line 6305) no Hoare annotation was computed. [2022-07-13 22:28:16,248 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6301 6306) the Hoare annotation is: true [2022-07-13 22:28:16,248 INFO L899 garLoopResultBuilder]: For program point L6305-5(line 6305) no Hoare annotation was computed. [2022-07-13 22:28:16,248 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6301 6306) no Hoare annotation was computed. [2022-07-13 22:28:16,248 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6301 6306) no Hoare annotation was computed. [2022-07-13 22:28:16,249 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-13 22:28:16,249 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-13 22:28:16,249 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-13 22:28:16,249 INFO L899 garLoopResultBuilder]: For program point L9846-1(line 9846) no Hoare annotation was computed. [2022-07-13 22:28:16,249 INFO L899 garLoopResultBuilder]: For program point L9524(lines 9524 9528) no Hoare annotation was computed. [2022-07-13 22:28:16,249 INFO L895 garLoopResultBuilder]: At program point L9846(line 9846) the Hoare annotation is: false [2022-07-13 22:28:16,249 INFO L899 garLoopResultBuilder]: For program point L9838(lines 9838 9856) no Hoare annotation was computed. [2022-07-13 22:28:16,249 INFO L895 garLoopResultBuilder]: At program point L9541(line 9541) the Hoare annotation is: false [2022-07-13 22:28:16,250 INFO L895 garLoopResultBuilder]: At program point L9541-1(line 9541) the Hoare annotation is: false [2022-07-13 22:28:16,250 INFO L899 garLoopResultBuilder]: For program point L9541-2(line 9541) no Hoare annotation was computed. [2022-07-13 22:28:16,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 22:28:16,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:28:16,250 INFO L899 garLoopResultBuilder]: For program point L9847-2(lines 9847 9851) no Hoare annotation was computed. [2022-07-13 22:28:16,250 INFO L899 garLoopResultBuilder]: For program point L9847-3(lines 9847 9855) no Hoare annotation was computed. [2022-07-13 22:28:16,250 INFO L899 garLoopResultBuilder]: For program point L9847-4(lines 9847 9855) no Hoare annotation was computed. [2022-07-13 22:28:16,250 INFO L899 garLoopResultBuilder]: For program point L7155-1(line 7155) no Hoare annotation was computed. [2022-07-13 22:28:16,250 INFO L895 garLoopResultBuilder]: At program point L7155(line 7155) the Hoare annotation is: false [2022-07-13 22:28:16,251 INFO L899 garLoopResultBuilder]: For program point L9847(lines 9847 9848) no Hoare annotation was computed. [2022-07-13 22:28:16,251 INFO L899 garLoopResultBuilder]: For program point L9558(lines 9558 9562) no Hoare annotation was computed. [2022-07-13 22:28:16,251 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-13 22:28:16,251 INFO L899 garLoopResultBuilder]: For program point L9839-1(line 9839) no Hoare annotation was computed. [2022-07-13 22:28:16,251 INFO L899 garLoopResultBuilder]: For program point L9542(lines 9542 9544) no Hoare annotation was computed. [2022-07-13 22:28:16,251 INFO L899 garLoopResultBuilder]: For program point L7156-1(lines 7156 7158) no Hoare annotation was computed. [2022-07-13 22:28:16,251 INFO L895 garLoopResultBuilder]: At program point L7156(lines 7156 7158) the Hoare annotation is: false [2022-07-13 22:28:16,251 INFO L895 garLoopResultBuilder]: At program point L9840-3(line 9840) the Hoare annotation is: false [2022-07-13 22:28:16,252 INFO L899 garLoopResultBuilder]: For program point L9840-4(line 9840) no Hoare annotation was computed. [2022-07-13 22:28:16,252 INFO L899 garLoopResultBuilder]: For program point L9840-5(line 9840) no Hoare annotation was computed. [2022-07-13 22:28:16,252 INFO L895 garLoopResultBuilder]: At program point L9840(line 9840) the Hoare annotation is: false [2022-07-13 22:28:16,252 INFO L899 garLoopResultBuilder]: For program point L9840-1(line 9840) no Hoare annotation was computed. [2022-07-13 22:28:16,252 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-13 22:28:16,252 INFO L899 garLoopResultBuilder]: For program point L7148(lines 7148 7161) no Hoare annotation was computed. [2022-07-13 22:28:16,252 INFO L902 garLoopResultBuilder]: At program point L9857(line 9857) the Hoare annotation is: true [2022-07-13 22:28:16,252 INFO L899 garLoopResultBuilder]: For program point L9849-1(lines 9849 9850) no Hoare annotation was computed. [2022-07-13 22:28:16,253 INFO L895 garLoopResultBuilder]: At program point L9519-2(line 9519) the Hoare annotation is: false [2022-07-13 22:28:16,253 INFO L899 garLoopResultBuilder]: For program point L9519-3(line 9519) no Hoare annotation was computed. [2022-07-13 22:28:16,253 INFO L895 garLoopResultBuilder]: At program point L9519-4(line 9519) the Hoare annotation is: false [2022-07-13 22:28:16,253 INFO L899 garLoopResultBuilder]: For program point L9519-5(line 9519) no Hoare annotation was computed. [2022-07-13 22:28:16,253 INFO L899 garLoopResultBuilder]: For program point L9519(line 9519) no Hoare annotation was computed. [2022-07-13 22:28:16,253 INFO L899 garLoopResultBuilder]: For program point L7149-1(lines 7148 7161) no Hoare annotation was computed. [2022-07-13 22:28:16,253 INFO L895 garLoopResultBuilder]: At program point L7149(line 7149) the Hoare annotation is: false [2022-07-13 22:28:16,253 INFO L899 garLoopResultBuilder]: For program point L9520-3(line 9520) no Hoare annotation was computed. [2022-07-13 22:28:16,254 INFO L895 garLoopResultBuilder]: At program point L9520-4(line 9520) the Hoare annotation is: false [2022-07-13 22:28:16,254 INFO L899 garLoopResultBuilder]: For program point L9520-5(line 9520) no Hoare annotation was computed. [2022-07-13 22:28:16,254 INFO L899 garLoopResultBuilder]: For program point L9520(line 9520) no Hoare annotation was computed. [2022-07-13 22:28:16,254 INFO L895 garLoopResultBuilder]: At program point L9520-2(line 9520) the Hoare annotation is: false [2022-07-13 22:28:16,254 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-13 22:28:16,254 INFO L899 garLoopResultBuilder]: For program point L9545(lines 9545 9547) no Hoare annotation was computed. [2022-07-13 22:28:16,254 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 22:28:16,254 INFO L899 garLoopResultBuilder]: For program point L9537(line 9537) no Hoare annotation was computed. [2022-07-13 22:28:16,255 INFO L899 garLoopResultBuilder]: For program point L9537-2(line 9537) no Hoare annotation was computed. [2022-07-13 22:28:16,255 INFO L899 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2022-07-13 22:28:16,255 INFO L895 garLoopResultBuilder]: At program point L7159(line 7159) the Hoare annotation is: false [2022-07-13 22:28:16,255 INFO L895 garLoopResultBuilder]: At program point L9843(line 9843) the Hoare annotation is: false [2022-07-13 22:28:16,255 INFO L899 garLoopResultBuilder]: For program point L9843-1(line 9843) no Hoare annotation was computed. [2022-07-13 22:28:16,255 INFO L899 garLoopResultBuilder]: For program point L9529(lines 9529 9533) no Hoare annotation was computed. [2022-07-13 22:28:16,255 INFO L899 garLoopResultBuilder]: For program point L9521(lines 9521 9523) no Hoare annotation was computed. [2022-07-13 22:28:16,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:28:16,255 INFO L899 garLoopResultBuilder]: For program point L9852(lines 9852 9854) no Hoare annotation was computed. [2022-07-13 22:28:16,256 INFO L899 garLoopResultBuilder]: For program point L9563(lines 9563 9567) no Hoare annotation was computed. [2022-07-13 22:28:16,256 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-07-13 22:28:16,256 INFO L895 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: false [2022-07-13 22:28:16,256 INFO L895 garLoopResultBuilder]: At program point L9539-1(line 9539) the Hoare annotation is: false [2022-07-13 22:28:16,256 INFO L899 garLoopResultBuilder]: For program point L9539-2(line 9539) no Hoare annotation was computed. [2022-07-13 22:28:16,256 INFO L899 garLoopResultBuilder]: For program point L9548(lines 9548 9550) no Hoare annotation was computed. [2022-07-13 22:28:16,256 INFO L895 garLoopResultBuilder]: At program point L9540(line 9540) the Hoare annotation is: false [2022-07-13 22:28:16,256 INFO L895 garLoopResultBuilder]: At program point L9540-1(line 9540) the Hoare annotation is: false [2022-07-13 22:28:16,257 INFO L899 garLoopResultBuilder]: For program point L9540-2(line 9540) no Hoare annotation was computed. [2022-07-13 22:28:16,257 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-13 22:28:16,257 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-13 22:28:16,257 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-13 22:28:16,257 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:28:16,257 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:28:16,257 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-13 22:28:16,260 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:28:16,261 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 22:28:16,265 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-13 22:28:16,268 INFO L158 Benchmark]: Toolchain (without parser) took 10843.48ms. Allocated memory was 104.9MB in the beginning and 377.5MB in the end (delta: 272.6MB). Free memory was 64.7MB in the beginning and 252.9MB in the end (delta: -188.1MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2022-07-13 22:28:16,268 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory is still 42.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:28:16,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1658.21ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 64.5MB in the beginning and 75.4MB in the end (delta: -10.9MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2022-07-13 22:28:16,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 162.84ms. Allocated memory is still 127.9MB. Free memory was 75.4MB in the beginning and 63.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 22:28:16,269 INFO L158 Benchmark]: Boogie Preprocessor took 69.70ms. Allocated memory is still 127.9MB. Free memory was 63.6MB in the beginning and 56.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 22:28:16,269 INFO L158 Benchmark]: RCFGBuilder took 949.82ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 56.5MB in the beginning and 60.6MB in the end (delta: -4.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2022-07-13 22:28:16,269 INFO L158 Benchmark]: TraceAbstraction took 7996.77ms. Allocated memory was 165.7MB in the beginning and 377.5MB in the end (delta: 211.8MB). Free memory was 60.6MB in the beginning and 252.9MB in the end (delta: -192.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2022-07-13 22:28:16,270 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 81.8MB. Free memory is still 42.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1658.21ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 64.5MB in the beginning and 75.4MB in the end (delta: -10.9MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 162.84ms. Allocated memory is still 127.9MB. Free memory was 75.4MB in the beginning and 63.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.70ms. Allocated memory is still 127.9MB. Free memory was 63.6MB in the beginning and 56.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 949.82ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 56.5MB in the beginning and 60.6MB in the end (delta: -4.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7996.77ms. Allocated memory was 165.7MB in the beginning and 377.5MB in the end (delta: 211.8MB). Free memory was 60.6MB in the beginning and 252.9MB in the end (delta: -192.3MB). Peak memory consumption was 18.5MB. 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: 8.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1519 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1400 mSDsluCounter, 3993 SdHoareTripleChecker+Invalid, 1.8s 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.6s 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.3s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 741 ConstructedInterpolants, 21 QuantifiedInterpolants, 2823 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-13 22:28:16,294 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-?-f4b24e3 [2022-07-13 22:28:17,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:28:17,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:28:17,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:28:17,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:28:17,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:28:17,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:28:17,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:28:17,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:28:17,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:28:17,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:28:17,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:28:17,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:28:17,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:28:17,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:28:17,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:28:17,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:28:17,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:28:17,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:28:17,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:28:17,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:28:17,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:28:17,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:28:17,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:28:17,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:28:17,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:28:17,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:28:17,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:28:17,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:28:17,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:28:17,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:28:17,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:28:17,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:28:17,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:28:17,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:28:17,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:28:17,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:28:17,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:28:17,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:28:17,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:28:17,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:28:17,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:28:17,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 22:28:17,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:28:17,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:28:17,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:28:17,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:28:17,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:28:17,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:28:17,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:28:17,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:28:17,977 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:28:17,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:28:17,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:28:17,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:28:17,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:28:17,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:28:17,979 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 22:28:17,979 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 22:28:17,979 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 22:28:17,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:28:17,979 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:28:17,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:28:17,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:28:17,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:28:17,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:28:17,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:28:17,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:28:17,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:28:17,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:28:17,981 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 22:28:17,981 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 22:28:17,981 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:28:17,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:28:17,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:28:17,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 22:28:17,982 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-13 22:28:18,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:28:18,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:28:18,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:28:18,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:28:18,247 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:28:18,248 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-13 22:28:18,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac5a0f43/f43b68b83f3f424c93994261c94b6d9f/FLAG617382196 [2022-07-13 22:28:18,859 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:28:18,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_comparator_string_harness.i [2022-07-13 22:28:18,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac5a0f43/f43b68b83f3f424c93994261c94b6d9f/FLAG617382196 [2022-07-13 22:28:19,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac5a0f43/f43b68b83f3f424c93994261c94b6d9f [2022-07-13 22:28:19,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:28:19,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:28:19,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:28:19,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:28:19,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:28:19,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:19" (1/1) ... [2022-07-13 22:28:19,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e7bd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:19, skipping insertion in model container [2022-07-13 22:28:19,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:19" (1/1) ... [2022-07-13 22:28:19,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:28:19,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:28:19,360 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-13 22:28:19,366 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-13 22:28:19,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,909 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,909 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,910 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,926 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,927 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,928 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,928 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,929 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,930 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,930 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:19,930 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:28:20,139 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:28:20,140 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:28:20,141 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:28:20,141 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:28:20,142 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:28:20,142 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:28:20,143 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:28:20,143 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:28:20,143 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:28:20,144 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:28:20,241 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:28:20,263 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-13 22:28:20,268 INFO L158 Benchmark]: Toolchain (without parser) took 1208.14ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 36.2MB in the beginning and 35.7MB in the end (delta: 462.5kB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-07-13 22:28:20,269 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:28:20,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1205.80ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 35.9MB in the beginning and 35.7MB in the end (delta: 153.3kB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-07-13 22:28:20,271 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.28ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1205.80ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 35.9MB in the beginning and 35.7MB in the end (delta: 153.3kB). Peak memory consumption was 25.0MB. 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