./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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_back_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 43b2ef256b4d1a93a084f86d3d9a0522c1b29c695f7bf9f8438f4c917cc80da0 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-03 21:50:45,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 21:50:45,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 21:50:45,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 21:50:45,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 21:50:45,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 21:50:45,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 21:50:45,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 21:50:45,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 21:50:45,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 21:50:45,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 21:50:45,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 21:50:45,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 21:50:45,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 21:50:45,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 21:50:45,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 21:50:45,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 21:50:45,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 21:50:45,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 21:50:45,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 21:50:45,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 21:50:45,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 21:50:45,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 21:50:45,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 21:50:45,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 21:50:45,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 21:50:45,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 21:50:45,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 21:50:45,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 21:50:45,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 21:50:45,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 21:50:45,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 21:50:45,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 21:50:45,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 21:50:45,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 21:50:45,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 21:50:45,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 21:50:45,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 21:50:45,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 21:50:45,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 21:50:45,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 21:50:45,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-03 21:50:45,449 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 21:50:45,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 21:50:45,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 21:50:45,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 21:50:45,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 21:50:45,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 21:50:45,451 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 21:50:45,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 21:50:45,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 21:50:45,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 21:50:45,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 21:50:45,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 21:50:45,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 21:50:45,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 21:50:45,453 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 21:50:45,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 21:50:45,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 21:50:45,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 21:50:45,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 21:50:45,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:50:45,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 21:50:45,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 21:50:45,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 21:50:45,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-03 21:50:45,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 21:50:45,455 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 21:50:45,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 21:50:45,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 21:50:45,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 21:50:45,456 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 -> 43b2ef256b4d1a93a084f86d3d9a0522c1b29c695f7bf9f8438f4c917cc80da0 [2021-11-03 21:50:45,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 21:50:45,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 21:50:45,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 21:50:45,657 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 21:50:45,658 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 21:50:45,659 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_back_harness.i [2021-11-03 21:50:45,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c262723e5/bd18f4e1b83540449c834ee174a0b8ff/FLAGb6a57c216 [2021-11-03 21:50:46,245 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 21:50:46,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_back_harness.i [2021-11-03 21:50:46,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c262723e5/bd18f4e1b83540449c834ee174a0b8ff/FLAGb6a57c216 [2021-11-03 21:50:46,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c262723e5/bd18f4e1b83540449c834ee174a0b8ff [2021-11-03 21:50:46,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 21:50:46,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 21:50:46,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 21:50:46,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 21:50:46,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 21:50:46,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:50:46" (1/1) ... [2021-11-03 21:50:46,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221a6ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:46, skipping insertion in model container [2021-11-03 21:50:46,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:50:46" (1/1) ... [2021-11-03 21:50:46,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 21:50:46,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 21:50:46,944 WARN L228 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_back_harness.i[4493,4506] [2021-11-03 21:50:46,948 WARN L228 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_back_harness.i[4553,4566] [2021-11-03 21:50:46,960 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:50:46,965 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:50:47,364 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:50:47,413 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,414 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,414 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,414 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,415 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,424 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,425 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,426 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,426 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,427 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,428 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,428 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,429 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,588 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:50:47,589 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:50:47,590 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:50:47,591 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:50:47,591 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:50:47,592 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:50:47,592 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:50:47,593 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:50:47,593 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:50:47,593 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:50:47,668 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,671 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:50:47,742 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 21:50:47,760 WARN L228 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_back_harness.i[4493,4506] [2021-11-03 21:50:47,760 WARN L228 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_back_harness.i[4553,4566] [2021-11-03 21:50:47,763 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:50:47,764 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:50:47,796 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:50:47,806 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,807 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,807 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,807 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,807 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,811 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,812 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,813 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,813 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,814 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,814 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,815 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,815 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:50:47,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:50:47,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:50:47,846 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:50:47,846 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:50:47,847 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:50:47,847 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:50:47,847 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:50:47,848 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:50:47,848 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:50:47,887 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,890 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:47,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:50:48,039 INFO L208 MainTranslator]: Completed translation [2021-11-03 21:50:48,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48 WrapperNode [2021-11-03 21:50:48,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 21:50:48,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 21:50:48,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 21:50:48,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 21:50:48,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 21:50:48,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 21:50:48,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 21:50:48,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 21:50:48,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 21:50:48,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 21:50:48,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 21:50:48,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 21:50:48,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:50:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:50:48,310 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) [2021-11-03 21:50:48,344 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 [2021-11-03 21:50:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 21:50:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 21:50:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 21:50:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 21:50:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 21:50:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 21:50:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 21:50:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-03 21:50:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 21:50:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 21:50:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 21:50:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 21:50:52,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 21:50:52,248 INFO L299 CfgBuilder]: Removed 229 assume(true) statements. [2021-11-03 21:50:52,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:50:52 BoogieIcfgContainer [2021-11-03 21:50:52,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 21:50:52,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 21:50:52,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 21:50:52,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 21:50:52,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:50:46" (1/3) ... [2021-11-03 21:50:52,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f61607c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:50:52, skipping insertion in model container [2021-11-03 21:50:52,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (2/3) ... [2021-11-03 21:50:52,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f61607c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:50:52, skipping insertion in model container [2021-11-03 21:50:52,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:50:52" (3/3) ... [2021-11-03 21:50:52,259 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_back_harness.i [2021-11-03 21:50:52,263 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 21:50:52,263 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-11-03 21:50:52,313 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 21:50:52,323 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 21:50:52,323 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-11-03 21:50:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 278 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 277 states have internal predecessors, (374), 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) [2021-11-03 21:50:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 21:50:52,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:50:52,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:50:52,345 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:50:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:50:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash 949117531, now seen corresponding path program 1 times [2021-11-03 21:50:52,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:50:52,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084299241] [2021-11-03 21:50:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:50:52,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:50:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:50:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:50:52,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:50:52,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084299241] [2021-11-03 21:50:52,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084299241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:50:52,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:50:52,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 21:50:52,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074888841] [2021-11-03 21:50:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:50:52,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 21:50:52,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:50:52,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 21:50:52,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:50:52,891 INFO L87 Difference]: Start difference. First operand has 278 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 277 states have internal predecessors, (374), 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) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2021-11-03 21:50:54,957 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:50:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:50:56,609 INFO L93 Difference]: Finished difference Result 552 states and 743 transitions. [2021-11-03 21:50:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 21:50:56,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) Word has length 51 [2021-11-03 21:50:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:50:56,618 INFO L225 Difference]: With dead ends: 552 [2021-11-03 21:50:56,619 INFO L226 Difference]: Without dead ends: 271 [2021-11-03 21:50:56,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:50:56,623 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3174.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3633.75ms IncrementalHoareTripleChecker+Time [2021-11-03 21:50:56,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 5.46ms Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 3633.75ms Time] [2021-11-03 21:50:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-03 21:50:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-11-03 21:50:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 258 states have (on average 1.2868217054263567) internal successors, (332), 270 states have internal predecessors, (332), 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) [2021-11-03 21:50:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 332 transitions. [2021-11-03 21:50:56,656 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 332 transitions. Word has length 51 [2021-11-03 21:50:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:50:56,656 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 332 transitions. [2021-11-03 21:50:56,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2021-11-03 21:50:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 332 transitions. [2021-11-03 21:50:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 21:50:56,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:50:56,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:50:56,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 21:50:56,658 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:50:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:50:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1385000845, now seen corresponding path program 1 times [2021-11-03 21:50:56,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:50:56,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746685481] [2021-11-03 21:50:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:50:56,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:50:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:50:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:50:56,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:50:56,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746685481] [2021-11-03 21:50:56,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746685481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:50:56,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:50:56,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 21:50:56,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701768460] [2021-11-03 21:50:56,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:50:56,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 21:50:56,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:50:56,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 21:50:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:50:56,815 INFO L87 Difference]: Start difference. First operand 271 states and 332 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2021-11-03 21:50:58,869 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:01,147 INFO L93 Difference]: Finished difference Result 529 states and 649 transitions. [2021-11-03 21:51:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 21:51:01,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) Word has length 51 [2021-11-03 21:51:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:01,149 INFO L225 Difference]: With dead ends: 529 [2021-11-03 21:51:01,149 INFO L226 Difference]: Without dead ends: 272 [2021-11-03 21:51:01,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.73ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:51:01,150 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3810.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.79ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4269.69ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:01,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 9.79ms Time], IncrementalHoareTripleChecker [0 Valid, 661 Invalid, 1 Unknown, 0 Unchecked, 4269.69ms Time] [2021-11-03 21:51:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-03 21:51:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-03 21:51:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 259 states have (on average 1.2857142857142858) internal successors, (333), 271 states have internal predecessors, (333), 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) [2021-11-03 21:51:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 333 transitions. [2021-11-03 21:51:01,162 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 333 transitions. Word has length 51 [2021-11-03 21:51:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:01,163 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 333 transitions. [2021-11-03 21:51:01,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2021-11-03 21:51:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2021-11-03 21:51:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 21:51:01,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:01,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:51:01,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 21:51:01,164 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:51:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -543271857, now seen corresponding path program 1 times [2021-11-03 21:51:01,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:01,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237768196] [2021-11-03 21:51:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:01,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:51:01,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:01,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237768196] [2021-11-03 21:51:01,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237768196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:01,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:01,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 21:51:01,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122719284] [2021-11-03 21:51:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:01,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 21:51:01,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 21:51:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:51:01,346 INFO L87 Difference]: Start difference. First operand 272 states and 333 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2021-11-03 21:51:03,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:04,962 INFO L93 Difference]: Finished difference Result 512 states and 626 transitions. [2021-11-03 21:51:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 21:51:04,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) Word has length 51 [2021-11-03 21:51:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:04,964 INFO L225 Difference]: With dead ends: 512 [2021-11-03 21:51:04,964 INFO L226 Difference]: Without dead ends: 272 [2021-11-03 21:51:04,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.99ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 21:51:04,966 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 451 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3295.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.70ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3542.93ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:04,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 0 Invalid, 524 Unknown, 0 Unchecked, 8.70ms Time], IncrementalHoareTripleChecker [8 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 3542.93ms Time] [2021-11-03 21:51:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-03 21:51:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-03 21:51:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 271 states have internal predecessors, (329), 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) [2021-11-03 21:51:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 329 transitions. [2021-11-03 21:51:04,979 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 329 transitions. Word has length 51 [2021-11-03 21:51:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:04,979 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 329 transitions. [2021-11-03 21:51:04,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2021-11-03 21:51:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 329 transitions. [2021-11-03 21:51:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-03 21:51:04,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:04,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:51:04,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 21:51:04,982 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:51:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1050760955, now seen corresponding path program 1 times [2021-11-03 21:51:04,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:04,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549809264] [2021-11-03 21:51:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:04,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:05,041 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:05,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1179536720] [2021-11-03 21:51:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:05,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:05,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:05,043 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) [2021-11-03 21:51:05,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 21:51:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:05,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 2697 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 21:51:05,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:51:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:51:06,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 21:51:06,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:06,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549809264] [2021-11-03 21:51:06,414 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:51:06,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179536720] [2021-11-03 21:51:06,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179536720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:06,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:06,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 21:51:06,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292174347] [2021-11-03 21:51:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:06,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 21:51:06,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 21:51:06,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 21:51:06,416 INFO L87 Difference]: Start difference. First operand 272 states and 329 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-11-03 21:51:08,460 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:10,604 INFO L93 Difference]: Finished difference Result 438 states and 527 transitions. [2021-11-03 21:51:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 21:51:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 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) Word has length 75 [2021-11-03 21:51:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:10,606 INFO L225 Difference]: With dead ends: 438 [2021-11-03 21:51:10,606 INFO L226 Difference]: Without dead ends: 272 [2021-11-03 21:51:10,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 249.39ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-03 21:51:10,607 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1290 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3558.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.38ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3975.67ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:10,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1290 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 12.38ms Time], IncrementalHoareTripleChecker [50 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 3975.67ms Time] [2021-11-03 21:51:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-03 21:51:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-03 21:51:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 259 states have (on average 1.247104247104247) internal successors, (323), 271 states have internal predecessors, (323), 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) [2021-11-03 21:51:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 323 transitions. [2021-11-03 21:51:10,625 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 323 transitions. Word has length 75 [2021-11-03 21:51:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:10,625 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 323 transitions. [2021-11-03 21:51:10,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-11-03 21:51:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 323 transitions. [2021-11-03 21:51:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-03 21:51:10,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:10,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:51:10,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 21:51:10,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:10,843 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:51:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:10,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1119345469, now seen corresponding path program 1 times [2021-11-03 21:51:10,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:10,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980798777] [2021-11-03 21:51:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:10,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:10,917 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:10,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503746469] [2021-11-03 21:51:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:10,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:10,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 21:51:10,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 21:51:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:11,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 2887 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-03 21:51:11,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:51:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:51:12,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 21:51:12,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:12,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980798777] [2021-11-03 21:51:12,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:51:12,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503746469] [2021-11-03 21:51:12,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503746469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:12,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:12,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 21:51:12,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379943959] [2021-11-03 21:51:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:12,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 21:51:12,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:12,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 21:51:12,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 21:51:12,104 INFO L87 Difference]: Start difference. First operand 272 states and 323 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2021-11-03 21:51:14,141 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:18,558 INFO L93 Difference]: Finished difference Result 711 states and 842 transitions. [2021-11-03 21:51:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 21:51:18,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) Word has length 91 [2021-11-03 21:51:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:18,560 INFO L225 Difference]: With dead ends: 711 [2021-11-03 21:51:18,561 INFO L226 Difference]: Without dead ends: 505 [2021-11-03 21:51:18,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 161.12ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 21:51:18,562 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 531 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5755.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.76ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6280.53ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:18,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 0 Invalid, 1613 Unknown, 0 Unchecked, 16.76ms Time], IncrementalHoareTripleChecker [3 Valid, 1609 Invalid, 1 Unknown, 0 Unchecked, 6280.53ms Time] [2021-11-03 21:51:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-11-03 21:51:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 296. [2021-11-03 21:51:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 283 states have (on average 1.243816254416961) internal successors, (352), 295 states have internal predecessors, (352), 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) [2021-11-03 21:51:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 352 transitions. [2021-11-03 21:51:18,573 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 352 transitions. Word has length 91 [2021-11-03 21:51:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:18,573 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 352 transitions. [2021-11-03 21:51:18,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2021-11-03 21:51:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 352 transitions. [2021-11-03 21:51:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-03 21:51:18,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:18,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:51:18,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 21:51:18,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:18,777 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:51:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 819816577, now seen corresponding path program 1 times [2021-11-03 21:51:18,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:18,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771743560] [2021-11-03 21:51:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:18,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:18,861 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:18,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305279085] [2021-11-03 21:51:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:18,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:18,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 21:51:18,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 21:51:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:19,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 2884 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-03 21:51:19,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:51:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:51:20,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 21:51:20,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:20,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771743560] [2021-11-03 21:51:20,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:51:20,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305279085] [2021-11-03 21:51:20,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305279085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:20,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:20,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 21:51:20,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918802286] [2021-11-03 21:51:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:20,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 21:51:20,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:20,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 21:51:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 21:51:20,019 INFO L87 Difference]: Start difference. First operand 296 states and 352 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2021-11-03 21:51:22,062 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:26,758 INFO L93 Difference]: Finished difference Result 691 states and 816 transitions. [2021-11-03 21:51:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 21:51:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) Word has length 91 [2021-11-03 21:51:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:26,760 INFO L225 Difference]: With dead ends: 691 [2021-11-03 21:51:26,760 INFO L226 Difference]: Without dead ends: 505 [2021-11-03 21:51:26,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 266.16ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-03 21:51:26,761 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 477 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5938.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.38ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6498.51ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:26,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 0 Invalid, 1608 Unknown, 0 Unchecked, 13.38ms Time], IncrementalHoareTripleChecker [3 Valid, 1604 Invalid, 1 Unknown, 0 Unchecked, 6498.51ms Time] [2021-11-03 21:51:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-11-03 21:51:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 316. [2021-11-03 21:51:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 1.2409240924092408) internal successors, (376), 315 states have internal predecessors, (376), 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) [2021-11-03 21:51:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 376 transitions. [2021-11-03 21:51:26,771 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 376 transitions. Word has length 91 [2021-11-03 21:51:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:26,772 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 376 transitions. [2021-11-03 21:51:26,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2021-11-03 21:51:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 376 transitions. [2021-11-03 21:51:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-03 21:51:26,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:26,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:51:26,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 21:51:26,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:26,982 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:51:26,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1094576191, now seen corresponding path program 1 times [2021-11-03 21:51:26,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:26,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781834813] [2021-11-03 21:51:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:26,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:27,067 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:27,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043359356] [2021-11-03 21:51:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:27,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:27,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:27,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 21:51:27,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 21:51:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:27,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 2881 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-03 21:51:27,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:51:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:51:27,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 21:51:27,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:27,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781834813] [2021-11-03 21:51:27,928 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:51:27,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043359356] [2021-11-03 21:51:27,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043359356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:27,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:27,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 21:51:27,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432866020] [2021-11-03 21:51:27,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:27,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 21:51:27,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:27,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 21:51:27,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:51:27,929 INFO L87 Difference]: Start difference. First operand 316 states and 376 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2021-11-03 21:51:29,970 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:33,074 INFO L93 Difference]: Finished difference Result 502 states and 594 transitions. [2021-11-03 21:51:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 21:51:33,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) Word has length 91 [2021-11-03 21:51:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:33,076 INFO L225 Difference]: With dead ends: 502 [2021-11-03 21:51:33,076 INFO L226 Difference]: Without dead ends: 272 [2021-11-03 21:51:33,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 21:51:33,077 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4592.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.49ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5071.43ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:33,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 963 Unknown, 0 Unchecked, 4.49ms Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 1 Unknown, 0 Unchecked, 5071.43ms Time] [2021-11-03 21:51:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-03 21:51:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-03 21:51:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 259 states have (on average 1.2393822393822393) internal successors, (321), 271 states have internal predecessors, (321), 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) [2021-11-03 21:51:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 321 transitions. [2021-11-03 21:51:33,084 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 321 transitions. Word has length 91 [2021-11-03 21:51:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:33,084 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 321 transitions. [2021-11-03 21:51:33,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2021-11-03 21:51:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 321 transitions. [2021-11-03 21:51:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-03 21:51:33,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:33,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:51:33,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 21:51:33,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:33,308 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:51:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash -553423599, now seen corresponding path program 1 times [2021-11-03 21:51:33,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:33,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448915712] [2021-11-03 21:51:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:33,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:33,370 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:33,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996142708] [2021-11-03 21:51:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:33,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:33,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 21:51:33,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 21:53:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:15,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 300 conjunts are in the unsatisfiable core [2021-11-03 21:53:15,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:15,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-03 21:53:15,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:15,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-03 21:53:16,083 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-03 21:53:16,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 33 [2021-11-03 21:53:16,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-03 21:53:17,638 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-03 21:53:17,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 33 [2021-11-03 21:53:19,008 INFO L354 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2021-11-03 21:53:19,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 47 [2021-11-03 21:53:20,955 INFO L354 Elim1Store]: treesize reduction 224, result has 20.0 percent of original size [2021-11-03 21:53:20,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 100 [2021-11-03 21:53:22,555 INFO L354 Elim1Store]: treesize reduction 238, result has 15.0 percent of original size [2021-11-03 21:53:22,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 94 [2021-11-03 21:53:23,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:23,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2021-11-03 21:53:25,370 INFO L354 Elim1Store]: treesize reduction 186, result has 13.9 percent of original size [2021-11-03 21:53:25,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 85 treesize of output 101 [2021-11-03 21:53:28,117 INFO L354 Elim1Store]: treesize reduction 120, result has 29.0 percent of original size [2021-11-03 21:53:28,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 72 treesize of output 106 [2021-11-03 21:53:28,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:28,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:28,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:28,597 INFO L354 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2021-11-03 21:53:28,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 61 [2021-11-03 21:53:36,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:36,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 21:53:36,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:36,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 21:53:36,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:36,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2021-11-03 21:53:39,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:53:39,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448915712] [2021-11-03 21:53:39,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:53:39,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996142708] [2021-11-03 21:53:39,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base|] [2021-11-03 21:53:39,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:39,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-03 21:53:39,447 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-03 21:53:39,447 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-03 21:53:39,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2021-11-03 21:53:39,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2021-11-03 21:53:39,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2021-11-03 21:53:39,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2021-11-03 21:53:39,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2021-11-03 21:53:39,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2021-11-03 21:53:39,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2021-11-03 21:53:39,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2021-11-03 21:53:39,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2021-11-03 21:53:39,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2021-11-03 21:53:39,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2021-11-03 21:53:39,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2021-11-03 21:53:39,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2021-11-03 21:53:39,663 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2021-11-03 21:53:39,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 21:53:39,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:53:39,695 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:53:39,696 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 21:53:39,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 09:53:39 BoogieIcfgContainer [2021-11-03 21:53:39,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 21:53:39,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 21:53:39,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 21:53:39,719 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 21:53:39,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:50:52" (3/4) ... [2021-11-03 21:53:39,722 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 21:53:39,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 21:53:39,722 INFO L158 Benchmark]: Toolchain (without parser) took 172993.48ms. Allocated memory was 107.0MB in the beginning and 421.5MB in the end (delta: 314.6MB). Free memory was 72.3MB in the beginning and 288.8MB in the end (delta: -216.5MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2021-11-03 21:53:39,723 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-03 21:53:39,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1310.20ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 72.1MB in the beginning and 80.5MB in the end (delta: -8.4MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2021-11-03 21:53:39,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.39ms. Allocated memory is still 132.1MB. Free memory was 80.5MB in the beginning and 66.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-03 21:53:39,723 INFO L158 Benchmark]: Boogie Preprocessor took 107.76ms. Allocated memory is still 132.1MB. Free memory was 66.5MB in the beginning and 56.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-03 21:53:39,724 INFO L158 Benchmark]: RCFGBuilder took 3963.98ms. Allocated memory was 132.1MB in the beginning and 421.5MB in the end (delta: 289.4MB). Free memory was 56.1MB in the beginning and 283.2MB in the end (delta: -227.2MB). Peak memory consumption was 231.8MB. Max. memory is 16.1GB. [2021-11-03 21:53:39,724 INFO L158 Benchmark]: TraceAbstraction took 167466.16ms. Allocated memory is still 421.5MB. Free memory was 283.2MB in the beginning and 288.8MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-03 21:53:39,724 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 421.5MB. Free memory is still 288.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-03 21:53:39,728 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1310.20ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 72.1MB in the beginning and 80.5MB in the end (delta: -8.4MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.39ms. Allocated memory is still 132.1MB. Free memory was 80.5MB in the beginning and 66.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.76ms. Allocated memory is still 132.1MB. Free memory was 66.5MB in the beginning and 56.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 3963.98ms. Allocated memory was 132.1MB in the beginning and 421.5MB in the end (delta: 289.4MB). Free memory was 56.1MB in the beginning and 283.2MB in the end (delta: -227.2MB). Peak memory consumption was 231.8MB. Max. memory is 16.1GB. * TraceAbstraction took 167466.16ms. Allocated memory is still 421.5MB. Free memory was 283.2MB in the beginning and 288.8MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 421.5MB. Free memory is still 288.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 7786. Possible FailurePath: [L2762-L2767] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7359] static __thread int tl_last_error = 0; [L7785-L7933] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L7936-L7939] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7941-L7950] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L7952-L7955] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L7957-L7961] static _Bool s_common_library_initialized = 0 ; [L7976] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7005] EXPR list->item_size [L7004-L7005] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L7008] EXPR list->length [L7007-L7008] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L7009] return item_size_is_bounded && length_is_bounded; [L211] COND FALSE !(!cond) [L7013] EXPR list->current_size [L7013] list->current_size == 0 && list->length == 0 [L7013] EXPR list->length [L7013] list->current_size == 0 && list->length == 0 [L7013] COND TRUE list->current_size == 0 && list->length == 0 [L7014] list->data [L211] COND FALSE !(!cond) [L2786] return &s_can_fail_allocator_static; [L7017] list->alloc = can_fail_allocator() [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L7982] size_t malloc_size; [L7983] list.item_size [L211] COND FALSE !(!cond) [L261] return __VERIFIER_nondet_bool(); [L2796-L2798] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L211] COND FALSE !(!cond) [L2782] return malloc(size); [L2796-L2798] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L2796-L2798] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L7984] void *val = can_fail_malloc(malloc_size); [L7987] struct aws_array_list old = list; [L7988] struct store_byte_from_buffer old_byte; [L7989] list.data [L7989] list.current_size [L7183] COND FALSE !(size > 0 && array && storage) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L7993] val && ((((list.item_size)) == 0) || ((val))) [L7993] EXPR list.item_size [L7993] val && ((((list.item_size)) == 0) || ((val))) [L211] COND FALSE !(!cond) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L3414] val && ((((list->item_size)) == 0) || ((val))) [L3414] EXPR list->item_size [L3414] val && ((((list->item_size)) == 0) || ((val))) [L211] COND FALSE !(!cond) [L3493] EXPR list->length [L3493] !list->length || list->data [L211] COND FALSE !(!cond) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L3495] EXPR list->length [L3495] size_t len = list->length; [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L223] COND TRUE !cond [L223] reach_error() - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 278 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 167383.99ms, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 20.02ms, AutomataDifference: 34260.85ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 8.88ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 2750 SdHoareTripleChecker+Valid, 33272.51ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2750 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 30125.46ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3727 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6217 IncrementalHoareTripleChecker+Invalid, 6288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 0 mSDtfsCounter, 6217 mSolverCounterSat, 70.95ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 773.44ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 90.67ms AutomataMinimizationTime, 7 MinimizatonAttempts, 398 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 572.45ms SsaConstructionTime, 103739.29ms SatisfiabilityAnalysisTime, 26821.02ms InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 21 NumberOfNonLiveVariables, 14258 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-03 21:53:39,898 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_back_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 43b2ef256b4d1a93a084f86d3d9a0522c1b29c695f7bf9f8438f4c917cc80da0 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-03 21:53:41,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 21:53:41,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 21:53:41,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 21:53:41,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 21:53:41,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 21:53:41,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 21:53:41,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 21:53:41,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 21:53:41,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 21:53:41,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 21:53:41,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 21:53:41,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 21:53:41,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 21:53:41,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 21:53:41,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 21:53:41,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 21:53:41,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 21:53:41,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 21:53:41,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 21:53:41,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 21:53:41,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 21:53:41,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 21:53:41,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 21:53:41,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 21:53:41,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 21:53:41,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 21:53:41,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 21:53:41,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 21:53:41,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 21:53:41,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 21:53:41,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 21:53:41,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 21:53:41,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 21:53:41,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 21:53:41,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 21:53:41,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 21:53:41,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 21:53:41,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 21:53:41,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 21:53:41,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 21:53:41,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-03 21:53:41,322 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 21:53:41,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 21:53:41,322 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 21:53:41,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 21:53:41,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 21:53:41,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 21:53:41,324 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 21:53:41,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 21:53:41,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 21:53:41,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 21:53:41,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 21:53:41,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 21:53:41,325 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 21:53:41,325 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 21:53:41,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 21:53:41,325 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 21:53:41,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 21:53:41,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 21:53:41,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 21:53:41,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 21:53:41,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:53:41,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 21:53:41,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 21:53:41,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 21:53:41,326 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-03 21:53:41,327 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 21:53:41,327 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 21:53:41,327 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 21:53:41,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 21:53:41,340 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 21:53:41,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 21:53:41,340 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 -> 43b2ef256b4d1a93a084f86d3d9a0522c1b29c695f7bf9f8438f4c917cc80da0 [2021-11-03 21:53:41,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 21:53:41,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 21:53:41,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 21:53:41,608 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 21:53:41,608 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 21:53:41,609 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_back_harness.i [2021-11-03 21:53:41,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd2c94fd/a91ffe14e626466daccd835a3e840c98/FLAGd74bb9808 [2021-11-03 21:53:42,143 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 21:53:42,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_back_harness.i [2021-11-03 21:53:42,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd2c94fd/a91ffe14e626466daccd835a3e840c98/FLAGd74bb9808 [2021-11-03 21:53:42,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd2c94fd/a91ffe14e626466daccd835a3e840c98 [2021-11-03 21:53:42,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 21:53:42,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 21:53:42,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 21:53:42,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 21:53:42,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 21:53:42,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:53:42" (1/1) ... [2021-11-03 21:53:42,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e80cfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:42, skipping insertion in model container [2021-11-03 21:53:42,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:53:42" (1/1) ... [2021-11-03 21:53:42,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 21:53:42,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 21:53:42,735 WARN L228 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_back_harness.i[4493,4506] [2021-11-03 21:53:42,741 WARN L228 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_back_harness.i[4553,4566] [2021-11-03 21:53:42,756 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:53:42,760 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:53:43,277 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:53:43,365 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,365 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,366 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,366 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,366 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,402 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,405 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,405 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,406 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,407 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,408 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,408 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,408 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,645 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:53:43,646 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:53:43,647 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:53:43,648 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:53:43,648 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:53:43,649 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:53:43,649 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:53:43,649 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:53:43,655 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:53:43,656 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:53:43,749 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,753 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:53:43,812 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 21:53:43,835 WARN L228 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_back_harness.i[4493,4506] [2021-11-03 21:53:43,836 WARN L228 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_back_harness.i[4553,4566] [2021-11-03 21:53:43,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:53:43,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:53:43,866 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:53:43,874 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,874 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,874 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,875 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,875 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,880 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,885 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,886 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,886 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,925 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:53:43,926 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:53:43,926 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:53:43,927 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:53:43,927 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:53:43,927 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:53:43,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:53:43,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:53:43,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:53:43,929 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:53:43,945 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,948 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:43,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:53:44,100 INFO L208 MainTranslator]: Completed translation [2021-11-03 21:53:44,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44 WrapperNode [2021-11-03 21:53:44,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 21:53:44,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 21:53:44,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 21:53:44,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 21:53:44,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 21:53:44,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 21:53:44,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 21:53:44,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 21:53:44,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 21:53:44,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 21:53:44,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 21:53:44,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 21:53:44,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (1/1) ... [2021-11-03 21:53:44,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:53:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:53:44,368 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) [2021-11-03 21:53:44,384 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 [2021-11-03 21:53:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 21:53:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 21:53:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-03 21:53:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-03 21:53:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 21:53:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 21:53:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 21:53:44,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 21:53:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-03 21:53:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-03 21:53:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 21:53:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-03 21:53:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 21:53:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-03 21:53:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-03 21:53:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 21:53:50,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 21:53:50,127 INFO L299 CfgBuilder]: Removed 229 assume(true) statements. [2021-11-03 21:53:50,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:53:50 BoogieIcfgContainer [2021-11-03 21:53:50,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 21:53:50,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 21:53:50,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 21:53:50,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 21:53:50,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:53:42" (1/3) ... [2021-11-03 21:53:50,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efe5695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:53:50, skipping insertion in model container [2021-11-03 21:53:50,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:44" (2/3) ... [2021-11-03 21:53:50,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efe5695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:53:50, skipping insertion in model container [2021-11-03 21:53:50,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:53:50" (3/3) ... [2021-11-03 21:53:50,134 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_back_harness.i [2021-11-03 21:53:50,137 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 21:53:50,137 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-11-03 21:53:50,171 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 21:53:50,175 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 21:53:50,175 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-11-03 21:53:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 278 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 277 states have internal predecessors, (374), 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) [2021-11-03 21:53:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 21:53:50,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:50,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:53:50,198 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:53:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash 949117531, now seen corresponding path program 1 times [2021-11-03 21:53:50,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:50,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882988358] [2021-11-03 21:53:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:50,215 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:50,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:50,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:53:50,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 21:53:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:52,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-03 21:53:52,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:53:52,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:53:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:53:52,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:53:52,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882988358] [2021-11-03 21:53:52,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882988358] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:53:52,528 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:52,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 21:53:52,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273481973] [2021-11-03 21:53:52,530 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:53:52,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 21:53:52,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:53:52,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 21:53:52,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:53:52,563 INFO L87 Difference]: Start difference. First operand has 278 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 277 states have internal predecessors, (374), 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) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2021-11-03 21:53:54,792 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:53:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:53:56,850 INFO L93 Difference]: Finished difference Result 552 states and 743 transitions. [2021-11-03 21:53:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 21:53:56,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) Word has length 51 [2021-11-03 21:53:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:53:56,859 INFO L225 Difference]: With dead ends: 552 [2021-11-03 21:53:56,859 INFO L226 Difference]: Without dead ends: 271 [2021-11-03 21:53:56,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.21ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:53:56,863 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3885.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.44ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4217.50ms IncrementalHoareTripleChecker+Time [2021-11-03 21:53:56,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 4.44ms Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 4217.50ms Time] [2021-11-03 21:53:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-03 21:53:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-11-03 21:53:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 258 states have (on average 1.2868217054263567) internal successors, (332), 270 states have internal predecessors, (332), 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) [2021-11-03 21:53:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 332 transitions. [2021-11-03 21:53:56,895 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 332 transitions. Word has length 51 [2021-11-03 21:53:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:53:56,895 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 332 transitions. [2021-11-03 21:53:56,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2021-11-03 21:53:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 332 transitions. [2021-11-03 21:53:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 21:53:56,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:56,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:53:56,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-03 21:53:57,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 21:53:57,104 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:53:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1385000845, now seen corresponding path program 1 times [2021-11-03 21:53:57,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:57,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952042760] [2021-11-03 21:53:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:57,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:57,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:57,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:53:57,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 21:53:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:59,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 21:53:59,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:53:59,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:53:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:53:59,671 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:53:59,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952042760] [2021-11-03 21:53:59,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952042760] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:53:59,672 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:59,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 21:53:59,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200948905] [2021-11-03 21:53:59,672 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:53:59,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 21:53:59,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:53:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 21:53:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:53:59,677 INFO L87 Difference]: Start difference. First operand 271 states and 332 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2021-11-03 21:54:01,863 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:54:05,478 INFO L93 Difference]: Finished difference Result 529 states and 649 transitions. [2021-11-03 21:54:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 21:54:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) Word has length 51 [2021-11-03 21:54:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:54:05,480 INFO L225 Difference]: With dead ends: 529 [2021-11-03 21:54:05,480 INFO L226 Difference]: Without dead ends: 272 [2021-11-03 21:54:05,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.35ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:54:05,482 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5298.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.41ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5729.25ms IncrementalHoareTripleChecker+Time [2021-11-03 21:54:05,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 12.41ms Time], IncrementalHoareTripleChecker [0 Valid, 661 Invalid, 1 Unknown, 0 Unchecked, 5729.25ms Time] [2021-11-03 21:54:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-03 21:54:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-03 21:54:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 259 states have (on average 1.2857142857142858) internal successors, (333), 271 states have internal predecessors, (333), 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) [2021-11-03 21:54:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 333 transitions. [2021-11-03 21:54:05,491 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 333 transitions. Word has length 51 [2021-11-03 21:54:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:54:05,491 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 333 transitions. [2021-11-03 21:54:05,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2021-11-03 21:54:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2021-11-03 21:54:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 21:54:05,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:54:05,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:54:05,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 21:54:05,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 21:54:05,720 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:54:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:54:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash -543271857, now seen corresponding path program 1 times [2021-11-03 21:54:05,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:54:05,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078842950] [2021-11-03 21:54:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:54:05,723 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:54:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:54:05,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:54:05,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 21:54:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:54:07,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-03 21:54:07,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:54:08,183 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 21:54:08,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2021-11-03 21:54:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:08,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:54:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:08,843 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:54:08,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078842950] [2021-11-03 21:54:08,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078842950] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:54:08,843 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:54:08,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-11-03 21:54:08,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006672226] [2021-11-03 21:54:08,843 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:54:08,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 21:54:08,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:54:08,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 21:54:08,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-03 21:54:08,844 INFO L87 Difference]: Start difference. First operand 272 states and 333 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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) [2021-11-03 21:54:11,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:54:27,311 INFO L93 Difference]: Finished difference Result 826 states and 1006 transitions. [2021-11-03 21:54:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 21:54:27,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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) Word has length 51 [2021-11-03 21:54:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:54:27,314 INFO L225 Difference]: With dead ends: 826 [2021-11-03 21:54:27,314 INFO L226 Difference]: Without dead ends: 569 [2021-11-03 21:54:27,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1165.11ms TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-11-03 21:54:27,316 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1432 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 2986 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16025.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.07ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2986 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17633.00ms IncrementalHoareTripleChecker+Time [2021-11-03 21:54:27,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1432 Valid, 0 Invalid, 3012 Unknown, 0 Unchecked, 43.07ms Time], IncrementalHoareTripleChecker [25 Valid, 2986 Invalid, 1 Unknown, 0 Unchecked, 17633.00ms Time] [2021-11-03 21:54:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-11-03 21:54:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 268. [2021-11-03 21:54:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 267 states have internal predecessors, (328), 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) [2021-11-03 21:54:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 328 transitions. [2021-11-03 21:54:27,325 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 328 transitions. Word has length 51 [2021-11-03 21:54:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:54:27,326 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 328 transitions. [2021-11-03 21:54:27,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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) [2021-11-03 21:54:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 328 transitions. [2021-11-03 21:54:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-03 21:54:27,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:54:27,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:54:27,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-03 21:54:27,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 21:54:27,544 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:54:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:54:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash 559640229, now seen corresponding path program 1 times [2021-11-03 21:54:27,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:54:27,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824308819] [2021-11-03 21:54:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:54:27,547 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:54:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:54:27,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:54:27,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 21:54:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:54:29,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 21:54:29,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:54:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:29,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:54:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:30,038 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:54:30,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824308819] [2021-11-03 21:54:30,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824308819] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:54:30,039 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:54:30,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-03 21:54:30,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435627912] [2021-11-03 21:54:30,039 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:54:30,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 21:54:30,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:54:30,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 21:54:30,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:54:30,040 INFO L87 Difference]: Start difference. First operand 268 states and 328 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2021-11-03 21:54:32,223 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:54:35,375 INFO L93 Difference]: Finished difference Result 508 states and 621 transitions. [2021-11-03 21:54:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 21:54:35,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 54 [2021-11-03 21:54:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:54:35,377 INFO L225 Difference]: With dead ends: 508 [2021-11-03 21:54:35,377 INFO L226 Difference]: Without dead ends: 268 [2021-11-03 21:54:35,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.58ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 21:54:35,378 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 444 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4879.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.87ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5264.28ms IncrementalHoareTripleChecker+Time [2021-11-03 21:54:35,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 0 Invalid, 516 Unknown, 0 Unchecked, 7.87ms Time], IncrementalHoareTripleChecker [8 Valid, 507 Invalid, 1 Unknown, 0 Unchecked, 5264.28ms Time] [2021-11-03 21:54:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-03 21:54:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-11-03 21:54:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 255 states have (on average 1.2705882352941176) internal successors, (324), 267 states have internal predecessors, (324), 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) [2021-11-03 21:54:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 324 transitions. [2021-11-03 21:54:35,385 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 324 transitions. Word has length 54 [2021-11-03 21:54:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:54:35,386 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 324 transitions. [2021-11-03 21:54:35,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2021-11-03 21:54:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 324 transitions. [2021-11-03 21:54:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-03 21:54:35,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:54:35,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:54:35,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-03 21:54:35,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 21:54:35,611 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:54:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:54:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1452650671, now seen corresponding path program 1 times [2021-11-03 21:54:35,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:54:35,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76202179] [2021-11-03 21:54:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:54:35,614 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:54:35,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:54:35,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:54:35,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-03 21:54:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:54:37,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-03 21:54:37,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:54:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:38,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:54:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:38,842 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:54:38,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76202179] [2021-11-03 21:54:38,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76202179] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:54:38,842 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:54:38,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-03 21:54:38,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411692573] [2021-11-03 21:54:38,842 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:54:38,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 21:54:38,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:54:38,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 21:54:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 21:54:38,843 INFO L87 Difference]: Start difference. First operand 268 states and 324 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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) [2021-11-03 21:54:41,038 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:54:49,663 INFO L93 Difference]: Finished difference Result 707 states and 855 transitions. [2021-11-03 21:54:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 21:54:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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) Word has length 78 [2021-11-03 21:54:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:54:49,665 INFO L225 Difference]: With dead ends: 707 [2021-11-03 21:54:49,665 INFO L226 Difference]: Without dead ends: 501 [2021-11-03 21:54:49,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 225.18ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 21:54:49,666 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 543 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9683.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.53ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10601.31ms IncrementalHoareTripleChecker+Time [2021-11-03 21:54:49,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 0 Invalid, 1623 Unknown, 0 Unchecked, 19.53ms Time], IncrementalHoareTripleChecker [3 Valid, 1619 Invalid, 1 Unknown, 0 Unchecked, 10601.31ms Time] [2021-11-03 21:54:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-11-03 21:54:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 292. [2021-11-03 21:54:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 279 states have (on average 1.2652329749103943) internal successors, (353), 291 states have internal predecessors, (353), 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) [2021-11-03 21:54:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 353 transitions. [2021-11-03 21:54:49,678 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 353 transitions. Word has length 78 [2021-11-03 21:54:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:54:49,679 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 353 transitions. [2021-11-03 21:54:49,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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) [2021-11-03 21:54:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 353 transitions. [2021-11-03 21:54:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-03 21:54:49,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:54:49,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:54:49,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-03 21:54:49,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 21:54:49,893 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:54:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:54:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1177891057, now seen corresponding path program 1 times [2021-11-03 21:54:49,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:54:49,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208509549] [2021-11-03 21:54:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:54:49,896 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:54:49,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:54:49,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:54:49,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-03 21:54:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:54:52,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-03 21:54:52,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:54:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:52,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:54:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:52,952 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:54:52,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208509549] [2021-11-03 21:54:52,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208509549] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:54:52,952 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:54:52,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-03 21:54:52,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096962166] [2021-11-03 21:54:52,952 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:54:52,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 21:54:52,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:54:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 21:54:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 21:54:52,953 INFO L87 Difference]: Start difference. First operand 292 states and 353 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) [2021-11-03 21:54:55,136 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:55:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:55:03,067 INFO L93 Difference]: Finished difference Result 500 states and 604 transitions. [2021-11-03 21:55:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 21:55:03,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) Word has length 78 [2021-11-03 21:55:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:55:03,069 INFO L225 Difference]: With dead ends: 500 [2021-11-03 21:55:03,069 INFO L226 Difference]: Without dead ends: 268 [2021-11-03 21:55:03,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 284.14ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-03 21:55:03,071 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9123.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.69ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9850.53ms IncrementalHoareTripleChecker+Time [2021-11-03 21:55:03,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 1940 Unknown, 0 Unchecked, 15.69ms Time], IncrementalHoareTripleChecker [1 Valid, 1938 Invalid, 1 Unknown, 0 Unchecked, 9850.53ms Time] [2021-11-03 21:55:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-03 21:55:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-11-03 21:55:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 255 states have (on average 1.2627450980392156) internal successors, (322), 267 states have internal predecessors, (322), 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) [2021-11-03 21:55:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2021-11-03 21:55:03,088 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 78 [2021-11-03 21:55:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:55:03,088 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2021-11-03 21:55:03,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) [2021-11-03 21:55:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2021-11-03 21:55:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-03 21:55:03,089 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:55:03,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:55:03,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-03 21:55:03,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 21:55:03,292 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:55:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:55:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1300110131, now seen corresponding path program 1 times [2021-11-03 21:55:03,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:55:03,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231954240] [2021-11-03 21:55:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:55:03,295 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:55:03,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:55:03,296 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:55:03,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-03 21:55:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:55:05,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-03 21:55:05,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:55:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:55:06,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:55:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:55:06,727 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:55:06,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231954240] [2021-11-03 21:55:06,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231954240] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:55:06,727 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:55:06,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-03 21:55:06,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911960587] [2021-11-03 21:55:06,727 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:55:06,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 21:55:06,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:55:06,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 21:55:06,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 21:55:06,728 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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) [2021-11-03 21:55:08,904 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:55:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:55:12,566 INFO L93 Difference]: Finished difference Result 434 states and 520 transitions. [2021-11-03 21:55:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 21:55:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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) Word has length 81 [2021-11-03 21:55:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:55:12,568 INFO L225 Difference]: With dead ends: 434 [2021-11-03 21:55:12,568 INFO L226 Difference]: Without dead ends: 268 [2021-11-03 21:55:12,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 173.77ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 21:55:12,569 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 965 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5239.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.94ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5676.50ms IncrementalHoareTripleChecker+Time [2021-11-03 21:55:12,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [965 Valid, 0 Invalid, 544 Unknown, 0 Unchecked, 5.94ms Time], IncrementalHoareTripleChecker [40 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 5676.50ms Time] [2021-11-03 21:55:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-03 21:55:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-11-03 21:55:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 255 states have (on average 1.2392156862745098) internal successors, (316), 267 states have internal predecessors, (316), 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) [2021-11-03 21:55:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 316 transitions. [2021-11-03 21:55:12,575 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 316 transitions. Word has length 81 [2021-11-03 21:55:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:55:12,576 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 316 transitions. [2021-11-03 21:55:12,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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) [2021-11-03 21:55:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 316 transitions. [2021-11-03 21:55:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-03 21:55:12,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:55:12,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:55:12,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-03 21:55:12,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 21:55:12,777 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 21:55:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:55:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1195735291, now seen corresponding path program 1 times [2021-11-03 21:55:12,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:55:12,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338160061] [2021-11-03 21:55:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:55:12,781 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:55:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:55:12,781 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 21:55:12,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-03 21:59:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:59:09,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-03 21:59:09,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:59:09,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-03 21:59:10,083 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-03 21:59:10,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-11-03 21:59:10,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-11-03 21:59:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:59:10,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2021-11-03 21:59:10,953 INFO L354 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2021-11-03 21:59:10,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2021-11-03 21:59:11,256 INFO L354 Elim1Store]: treesize reduction 105, result has 7.9 percent of original size [2021-11-03 21:59:11,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 22 [2021-11-03 21:59:11,445 INFO L388 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 10 treesize of output 4 [2021-11-03 21:59:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:59:11,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:59:12,306 INFO L388 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 10 treesize of output 4 [2021-11-03 21:59:14,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_mul_u64_checked_~r.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_mul_u64_checked_~r.base) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2)) c_ULTIMATE.start_aws_array_list_is_valid_~list.base) (bvadd c_ULTIMATE.start_aws_array_list_is_valid_~list.offset (_ bv32 64)))))) is different from false [2021-11-03 21:59:16,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111| (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111|))))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2)) c_ULTIMATE.start_aws_array_list_is_valid_~list.base) (bvadd c_ULTIMATE.start_aws_array_list_is_valid_~list.offset (_ bv32 64))))))) is different from false [2021-11-03 21:59:18,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111| (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111|))))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2)) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.offset|)))))) is different from false [2021-11-03 21:59:20,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (|ULTIMATE.start_ensure_array_list_has_allocated_data_member_#t~ite589.base| (_ BitVec 64)) (|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111| (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (or (not (= (_ bv0 64) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_ensure_array_list_has_allocated_data_member_#t~ite589.base|)))) (store .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111| (store (store (select .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2))) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.offset|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_111|))))))) is different from false [2021-11-03 21:59:20,803 INFO L388 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 3471 treesize of output 3423 [2021-11-03 21:59:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:59:23,370 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:59:23,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338160061] [2021-11-03 21:59:23,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338160061] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:59:23,370 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:59:23,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-11-03 21:59:23,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798355072] [2021-11-03 21:59:23,371 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:59:23,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-03 21:59:23,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:59:23,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-03 21:59:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=248, Unknown=4, NotChecked=140, Total=462 [2021-11-03 21:59:23,372 INFO L87 Difference]: Start difference. First operand 268 states and 316 transitions. Second operand has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 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) [2021-11-03 21:59:25,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 22:00:01,250 WARN L210 SmtUtils]: Spent 22.82s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-11-03 22:00:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 22:00:26,411 INFO L93 Difference]: Finished difference Result 639 states and 765 transitions. [2021-11-03 22:00:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 22:00:26,412 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 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) Word has length 97 [2021-11-03 22:00:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 22:00:26,413 INFO L225 Difference]: With dead ends: 639 [2021-11-03 22:00:26,413 INFO L226 Difference]: Without dead ends: 398 [2021-11-03 22:00:26,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 53823.91ms TimeCoverageRelationStatistics Valid=139, Invalid=516, Unknown=11, NotChecked=204, Total=870 [2021-11-03 22:00:26,414 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 3133 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16992.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.91ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3133 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1951 IncrementalHoareTripleChecker+Unchecked, 18693.91ms IncrementalHoareTripleChecker+Time [2021-11-03 22:00:26,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 5137 Unknown, 0 Unchecked, 42.91ms Time], IncrementalHoareTripleChecker [52 Valid, 3133 Invalid, 1 Unknown, 1951 Unchecked, 18693.91ms Time] [2021-11-03 22:00:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-03 22:00:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 351. [2021-11-03 22:00:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 338 states have (on average 1.2100591715976332) internal successors, (409), 350 states have internal predecessors, (409), 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) [2021-11-03 22:00:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 409 transitions. [2021-11-03 22:00:26,426 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 409 transitions. Word has length 97 [2021-11-03 22:00:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 22:00:26,426 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 409 transitions. [2021-11-03 22:00:26,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 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) [2021-11-03 22:00:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 409 transitions. [2021-11-03 22:00:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-03 22:00:26,427 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 22:00:26,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 22:00:26,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-03 22:00:26,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 22:00:26,653 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 22:00:26,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 22:00:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1224235581, now seen corresponding path program 1 times [2021-11-03 22:00:26,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 22:00:26,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949705754] [2021-11-03 22:00:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 22:00:26,657 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 22:00:26,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 22:00:26,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 22:00:26,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-03 22:03:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 22:03:33,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-03 22:03:33,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 22:03:33,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-03 22:03:34,102 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-03 22:03:34,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-11-03 22:03:34,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-11-03 22:03:34,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 22:03:34,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2021-11-03 22:03:34,703 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-03 22:03:34,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2021-11-03 22:03:34,894 INFO L354 Elim1Store]: treesize reduction 91, result has 7.1 percent of original size [2021-11-03 22:03:34,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 20 [2021-11-03 22:03:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 22:03:35,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 22:03:48,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4)) c_ULTIMATE.start_aws_array_list_is_valid_~list.base) (bvadd c_ULTIMATE.start_aws_array_list_is_valid_~list.offset (_ bv32 64))))))) is different from false [2021-11-03 22:03:50,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (or (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4)) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))))) is different from false [2021-11-03 22:03:53,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64)) (|ULTIMATE.start_ensure_array_list_has_allocated_data_member_#t~ite589.base| (_ BitVec 64))) (or (not (= (_ bv0 64) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_ensure_array_list_has_allocated_data_member_#t~ite589.base|)))) (store .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4))) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_back_harness_~#list~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))))) is different from false [2021-11-03 22:03:53,206 INFO L388 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 27945 treesize of output 27561 [2021-11-03 22:03:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 22:03:55,965 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 22:03:55,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949705754] [2021-11-03 22:03:55,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949705754] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 22:03:55,965 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 22:03:55,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2021-11-03 22:03:55,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970266174] [2021-11-03 22:03:55,965 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 22:03:55,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-03 22:03:55,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 22:03:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-03 22:03:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=214, Unknown=7, NotChecked=96, Total=380 [2021-11-03 22:03:55,966 INFO L87 Difference]: Start difference. First operand 351 states and 409 transitions. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 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) [2021-11-03 22:03:58,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 22:04:06,954 WARN L210 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2021-11-03 22:04:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 22:04:26,268 INFO L93 Difference]: Finished difference Result 663 states and 778 transitions. [2021-11-03 22:04:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 22:04:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 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) Word has length 97 [2021-11-03 22:04:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 22:04:26,270 INFO L225 Difference]: With dead ends: 663 [2021-11-03 22:04:26,270 INFO L226 Difference]: Without dead ends: 404 [2021-11-03 22:04:26,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 34094.75ms TimeCoverageRelationStatistics Valid=201, Invalid=453, Unknown=8, NotChecked=150, Total=812 [2021-11-03 22:04:26,271 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13096.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.73ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2104 IncrementalHoareTripleChecker+Unchecked, 14361.70ms IncrementalHoareTripleChecker+Time [2021-11-03 22:04:26,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 4529 Unknown, 0 Unchecked, 23.73ms Time], IncrementalHoareTripleChecker [45 Valid, 2379 Invalid, 1 Unknown, 2104 Unchecked, 14361.70ms Time] [2021-11-03 22:04:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-11-03 22:04:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 349. [2021-11-03 22:04:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 336 states have (on average 1.2083333333333333) internal successors, (406), 348 states have internal predecessors, (406), 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) [2021-11-03 22:04:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 406 transitions. [2021-11-03 22:04:26,282 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 406 transitions. Word has length 97 [2021-11-03 22:04:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 22:04:26,282 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 406 transitions. [2021-11-03 22:04:26,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 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) [2021-11-03 22:04:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 406 transitions. [2021-11-03 22:04:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-03 22:04:26,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 22:04:26,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 22:04:26,484 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forcibly destroying the process [2021-11-03 22:04:26,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-03 22:04:26,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-03 22:04:26,524 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-03 22:04:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 22:04:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1273678987, now seen corresponding path program 1 times [2021-11-03 22:04:26,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 22:04:26,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970213949] [2021-11-03 22:04:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 22:04:26,528 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 22:04:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 22:04:26,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 22:04:26,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process Killed by 15