./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_swap_contents_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_swap_contents_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 877e83a63a602219ce02028b5212cf6c29aa8f33a031ee39d52c3c671213dc91 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:24:07,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:24:07,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:24:07,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:24:07,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:24:07,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:24:07,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:24:07,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:24:07,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:24:07,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:24:07,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:24:07,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:24:07,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:24:07,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:24:07,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:24:07,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:24:07,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:24:07,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:24:07,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:24:07,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:24:07,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:24:07,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:24:07,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:24:07,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:24:07,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:24:07,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:24:07,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:24:07,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:24:07,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:24:07,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:24:07,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:24:07,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:24:07,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:24:07,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:24:07,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:24:07,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:24:07,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:24:07,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:24:07,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:24:07,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:24:07,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:24:07,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 12:24:07,737 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:24:07,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:24:07,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:24:07,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:24:07,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:24:07,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:24:07,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:24:07,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:24:07,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:24:07,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:24:07,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:24:07,741 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 -> 877e83a63a602219ce02028b5212cf6c29aa8f33a031ee39d52c3c671213dc91 [2021-11-02 12:24:07,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:24:07,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:24:07,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:24:07,962 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:24:07,963 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:24:07,964 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_swap_contents_harness.i [2021-11-02 12:24:08,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189633c60/2086a9a704d24ad68cc2a31ab03b42e1/FLAGd1b258deb [2021-11-02 12:24:08,539 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:24:08,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_swap_contents_harness.i [2021-11-02 12:24:08,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189633c60/2086a9a704d24ad68cc2a31ab03b42e1/FLAGd1b258deb [2021-11-02 12:24:08,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189633c60/2086a9a704d24ad68cc2a31ab03b42e1 [2021-11-02 12:24:08,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:24:08,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:24:08,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:24:08,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:24:08,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:24:08,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:24:08" (1/1) ... [2021-11-02 12:24:08,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c56982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:08, skipping insertion in model container [2021-11-02 12:24:08,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:24:08" (1/1) ... [2021-11-02 12:24:08,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:24:08,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:24:09,066 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_swap_contents_harness.i[4502,4515] [2021-11-02 12:24:09,072 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_swap_contents_harness.i[4562,4575] [2021-11-02 12:24:09,091 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:24:09,099 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:24:09,520 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:24:09,577 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,577 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,577 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,578 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,578 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,590 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,590 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,591 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,591 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,783 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:24:09,784 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:24:09,784 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:24:09,785 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:24:09,785 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:24:09,786 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:24:09,786 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:24:09,786 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:24:09,789 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:24:09,790 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:24:09,870 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,873 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:24:09,931 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:24:09,939 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_swap_contents_harness.i[4502,4515] [2021-11-02 12:24:09,940 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_swap_contents_harness.i[4562,4575] [2021-11-02 12:24:09,941 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:24:09,942 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:24:09,959 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:24:09,968 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,968 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,968 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,968 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,969 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,973 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,973 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,975 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,975 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,975 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:09,975 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:10,002 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:24:10,003 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:24:10,004 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:24:10,004 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:24:10,006 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:24:10,007 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:24:10,007 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:24:10,008 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:24:10,008 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:24:10,008 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:24:10,064 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:10,069 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:24:10,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:24:10,252 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:24:10,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10 WrapperNode [2021-11-02 12:24:10,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:24:10,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:24:10,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:24:10,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:24:10,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:24:10,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:24:10,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:24:10,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:24:10,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:24:10,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:24:10,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:24:10,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:24:10,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (1/1) ... [2021-11-02 12:24:10,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:24:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:24:10,522 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-02 12:24:10,549 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-02 12:24:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:24:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 12:24:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:24:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 12:24:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:24:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:24:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:24:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-02 12:24:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 12:24:10,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:24:10,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 12:24:10,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 12:24:14,649 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:24:14,650 INFO L299 CfgBuilder]: Removed 218 assume(true) statements. [2021-11-02 12:24:14,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:24:14 BoogieIcfgContainer [2021-11-02 12:24:14,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:24:14,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:24:14,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:24:14,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:24:14,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:24:08" (1/3) ... [2021-11-02 12:24:14,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e5a662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:24:14, skipping insertion in model container [2021-11-02 12:24:14,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:24:10" (2/3) ... [2021-11-02 12:24:14,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e5a662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:24:14, skipping insertion in model container [2021-11-02 12:24:14,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:24:14" (3/3) ... [2021-11-02 12:24:14,658 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_swap_contents_harness.i [2021-11-02 12:24:14,662 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:24:14,662 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-11-02 12:24:14,703 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:24:14,712 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-02 12:24:14,712 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-11-02 12:24:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 244 states have (on average 1.4385245901639345) internal successors, (351), 260 states have internal predecessors, (351), 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-02 12:24:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 12:24:14,745 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:24:14,745 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] [2021-11-02 12:24:14,746 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:24:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:24:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1330632047, now seen corresponding path program 1 times [2021-11-02 12:24:14,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:24:14,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461965524] [2021-11-02 12:24:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:14,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:24:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:24:15,238 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-02 12:24:15,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:24:15,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461965524] [2021-11-02 12:24:15,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461965524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:24:15,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:24:15,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 12:24:15,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243973611] [2021-11-02 12:24:15,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:24:15,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:24:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:24:15,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:24:15,262 INFO L87 Difference]: Start difference. First operand has 261 states, 244 states have (on average 1.4385245901639345) internal successors, (351), 260 states have internal predecessors, (351), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-02 12:24:17,316 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-02 12:24:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:24:19,020 INFO L93 Difference]: Finished difference Result 518 states and 697 transitions. [2021-11-02 12:24:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:24:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 62 [2021-11-02 12:24:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:24:19,040 INFO L225 Difference]: With dead ends: 518 [2021-11-02 12:24:19,041 INFO L226 Difference]: Without dead ends: 254 [2021-11-02 12:24:19,046 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-02 12:24:19,053 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3341.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.65ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3686.55ms IncrementalHoareTripleChecker+Time [2021-11-02 12:24:19,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 314 Unknown, 0 Unchecked, 4.65ms Time], IncrementalHoareTripleChecker [0 Valid, 313 Invalid, 1 Unknown, 0 Unchecked, 3686.55ms Time] [2021-11-02 12:24:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-11-02 12:24:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-11-02 12:24:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 238 states have (on average 1.2773109243697478) internal successors, (304), 253 states have internal predecessors, (304), 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-02 12:24:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 304 transitions. [2021-11-02 12:24:19,095 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 304 transitions. Word has length 62 [2021-11-02 12:24:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:24:19,100 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 304 transitions. [2021-11-02 12:24:19,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-02 12:24:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 304 transitions. [2021-11-02 12:24:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 12:24:19,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:24:19,104 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] [2021-11-02 12:24:19,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 12:24:19,104 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:24:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:24:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1348565053, now seen corresponding path program 1 times [2021-11-02 12:24:19,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:24:19,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775078468] [2021-11-02 12:24:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:19,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:24:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:24:19,298 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-02 12:24:19,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:24:19,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775078468] [2021-11-02 12:24:19,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775078468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:24:19,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:24:19,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 12:24:19,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498634381] [2021-11-02 12:24:19,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 12:24:19,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:24:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 12:24:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:24:19,301 INFO L87 Difference]: Start difference. First operand 254 states and 304 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02 12:24:21,455 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:24:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:24:24,640 INFO L93 Difference]: Finished difference Result 496 states and 595 transitions. [2021-11-02 12:24:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 12:24:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2021-11-02 12:24:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:24:24,641 INFO L225 Difference]: With dead ends: 496 [2021-11-02 12:24:24,642 INFO L226 Difference]: Without dead ends: 256 [2021-11-02 12:24:24,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.58ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:24:24,643 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4849.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.57ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5272.59ms IncrementalHoareTripleChecker+Time [2021-11-02 12:24:24,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 609 Unknown, 0 Unchecked, 11.57ms Time], IncrementalHoareTripleChecker [2 Valid, 606 Invalid, 1 Unknown, 0 Unchecked, 5272.59ms Time] [2021-11-02 12:24:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-02 12:24:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-02 12:24:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.275) internal successors, (306), 255 states have internal predecessors, (306), 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-02 12:24:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 306 transitions. [2021-11-02 12:24:24,653 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 306 transitions. Word has length 62 [2021-11-02 12:24:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:24:24,653 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 306 transitions. [2021-11-02 12:24:24,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02 12:24:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 306 transitions. [2021-11-02 12:24:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 12:24:24,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:24:24,656 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] [2021-11-02 12:24:24,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 12:24:24,657 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:24:24,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:24:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash 87647803, now seen corresponding path program 1 times [2021-11-02 12:24:24,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:24:24,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664092532] [2021-11-02 12:24:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:24,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:24:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:24:24,908 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-02 12:24:24,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:24:24,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664092532] [2021-11-02 12:24:24,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664092532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:24:24,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:24:24,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:24:24,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329307787] [2021-11-02 12:24:24,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:24:24,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:24:24,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:24:24,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:24:24,909 INFO L87 Difference]: Start difference. First operand 256 states and 306 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02 12:24:26,949 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-02 12:24:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:24:29,806 INFO L93 Difference]: Finished difference Result 480 states and 572 transitions. [2021-11-02 12:24:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:24:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2021-11-02 12:24:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:24:29,810 INFO L225 Difference]: With dead ends: 480 [2021-11-02 12:24:29,810 INFO L226 Difference]: Without dead ends: 256 [2021-11-02 12:24:29,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.94ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:24:29,812 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4495.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.69ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4831.73ms IncrementalHoareTripleChecker+Time [2021-11-02 12:24:29,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 0 Invalid, 544 Unknown, 0 Unchecked, 11.69ms Time], IncrementalHoareTripleChecker [2 Valid, 541 Invalid, 1 Unknown, 0 Unchecked, 4831.73ms Time] [2021-11-02 12:24:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-02 12:24:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-02 12:24:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 255 states have internal predecessors, (304), 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-02 12:24:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 304 transitions. [2021-11-02 12:24:29,821 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 304 transitions. Word has length 62 [2021-11-02 12:24:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:24:29,821 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 304 transitions. [2021-11-02 12:24:29,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02 12:24:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 304 transitions. [2021-11-02 12:24:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-02 12:24:29,823 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:24:29,823 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] [2021-11-02 12:24:29,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 12:24:29,823 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:24:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:24:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1267963945, now seen corresponding path program 1 times [2021-11-02 12:24:29,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:24:29,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152553049] [2021-11-02 12:24:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:29,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:24:29,886 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 12:24:29,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669750907] [2021-11-02 12:24:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:29,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 12:24:29,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:24:29,891 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-02 12:24:29,911 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-02 12:24:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:24:30,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 2678 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 12:24:30,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:24:31,125 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-02 12:24:31,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 12:24:31,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:24:31,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152553049] [2021-11-02 12:24:31,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 12:24:31,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669750907] [2021-11-02 12:24:31,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669750907] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:24:31,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:24:31,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:24:31,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195989535] [2021-11-02 12:24:31,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:24:31,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:24:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:24:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:24:31,127 INFO L87 Difference]: Start difference. First operand 256 states and 304 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 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-02 12:24:33,169 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-02 12:24:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:24:35,866 INFO L93 Difference]: Finished difference Result 447 states and 528 transitions. [2021-11-02 12:24:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:24:35,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2021-11-02 12:24:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:24:35,868 INFO L225 Difference]: With dead ends: 447 [2021-11-02 12:24:35,868 INFO L226 Difference]: Without dead ends: 256 [2021-11-02 12:24:35,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 112.10ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:24:35,869 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 696 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4221.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.11ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4618.15ms IncrementalHoareTripleChecker+Time [2021-11-02 12:24:35,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 0 Invalid, 471 Unknown, 0 Unchecked, 12.11ms Time], IncrementalHoareTripleChecker [2 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 4618.15ms Time] [2021-11-02 12:24:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-02 12:24:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-02 12:24:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.2583333333333333) internal successors, (302), 255 states have internal predecessors, (302), 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-02 12:24:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2021-11-02 12:24:35,882 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 70 [2021-11-02 12:24:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:24:35,882 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2021-11-02 12:24:35,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 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-02 12:24:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2021-11-02 12:24:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-02 12:24:35,884 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:24:35,884 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-02 12:24:35,909 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-02 12:24:36,091 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-02 12:24:36,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:24:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:24:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -187050949, now seen corresponding path program 1 times [2021-11-02 12:24:36,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:24:36,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203533298] [2021-11-02 12:24:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:36,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:24:36,156 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 12:24:36,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875991672] [2021-11-02 12:24:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:36,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 12:24:36,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:24:36,158 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-02 12:24:36,159 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-02 12:24:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:24:36,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 2773 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 12:24:36,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:24:37,521 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-02 12:24:37,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 12:24:37,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:24:37,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203533298] [2021-11-02 12:24:37,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 12:24:37,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875991672] [2021-11-02 12:24:37,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875991672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:24:37,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:24:37,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:24:37,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718917647] [2021-11-02 12:24:37,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:24:37,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:24:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:24:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:24:37,524 INFO L87 Difference]: Start difference. First operand 256 states and 302 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 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-02 12:24:39,562 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-02 12:24:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:24:42,202 INFO L93 Difference]: Finished difference Result 403 states and 474 transitions. [2021-11-02 12:24:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:24:42,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 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-02 12:24:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:24:42,204 INFO L225 Difference]: With dead ends: 403 [2021-11-02 12:24:42,204 INFO L226 Difference]: Without dead ends: 256 [2021-11-02 12:24:42,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 212.79ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:24:42,205 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 826 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4075.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.23ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4478.25ms IncrementalHoareTripleChecker+Time [2021-11-02 12:24:42,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [826 Valid, 0 Invalid, 596 Unknown, 0 Unchecked, 14.23ms Time], IncrementalHoareTripleChecker [4 Valid, 591 Invalid, 1 Unknown, 0 Unchecked, 4478.25ms Time] [2021-11-02 12:24:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-02 12:24:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-02 12:24:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.25) internal successors, (300), 255 states have internal predecessors, (300), 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-02 12:24:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 300 transitions. [2021-11-02 12:24:42,217 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 300 transitions. Word has length 78 [2021-11-02 12:24:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:24:42,220 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 300 transitions. [2021-11-02 12:24:42,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 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-02 12:24:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 300 transitions. [2021-11-02 12:24:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-02 12:24:42,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:24:42,227 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-02 12:24:42,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-02 12:24:42,427 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-02 12:24:42,428 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:24:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:24:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1777573379, now seen corresponding path program 1 times [2021-11-02 12:24:42,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:24:42,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650193379] [2021-11-02 12:24:42,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:42,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:24:42,493 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 12:24:42,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908020739] [2021-11-02 12:24:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:42,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 12:24:42,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:24:42,495 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-02 12:24:42,496 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-02 12:24:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:24:43,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 2963 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 12:24:43,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:24:43,955 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-02 12:24:43,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 12:24:43,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:24:43,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650193379] [2021-11-02 12:24:43,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 12:24:43,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908020739] [2021-11-02 12:24:43,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908020739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:24:43,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:24:43,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:24:43,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340681187] [2021-11-02 12:24:43,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:24:43,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:24:43,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:24:43,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:24:43,957 INFO L87 Difference]: Start difference. First operand 256 states and 300 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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-02 12:24:45,996 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-02 12:24:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:24:48,856 INFO L93 Difference]: Finished difference Result 387 states and 450 transitions. [2021-11-02 12:24:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:24:48,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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 94 [2021-11-02 12:24:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:24:48,858 INFO L225 Difference]: With dead ends: 387 [2021-11-02 12:24:48,858 INFO L226 Difference]: Without dead ends: 256 [2021-11-02 12:24:48,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 210.34ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:24:48,859 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 875 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4307.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.91ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4714.44ms IncrementalHoareTripleChecker+Time [2021-11-02 12:24:48,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [875 Valid, 0 Invalid, 525 Unknown, 0 Unchecked, 10.91ms Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 1 Unknown, 0 Unchecked, 4714.44ms Time] [2021-11-02 12:24:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-02 12:24:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-02 12:24:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.2416666666666667) internal successors, (298), 255 states have internal predecessors, (298), 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-02 12:24:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 298 transitions. [2021-11-02 12:24:48,865 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 298 transitions. Word has length 94 [2021-11-02 12:24:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:24:48,866 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 298 transitions. [2021-11-02 12:24:48,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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-02 12:24:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2021-11-02 12:24:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-02 12:24:48,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:24:48,867 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, 1, 1, 1] [2021-11-02 12:24:48,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-02 12:24:49,079 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-02 12:24:49,080 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:24:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:24:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash 377228519, now seen corresponding path program 1 times [2021-11-02 12:24:49,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:24:49,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033398342] [2021-11-02 12:24:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:49,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:24:49,156 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 12:24:49,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256563824] [2021-11-02 12:24:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:24:49,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 12:24:49,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:24:49,158 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-02 12:24:49,159 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-02 12:27:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:27:29,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 3058 conjuncts, 288 conjunts are in the unsatisfiable core [2021-11-02 12:27:29,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:27:29,814 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-02 12:27:29,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-02 12:27:30,447 INFO L354 Elim1Store]: treesize reduction 106, result has 18.5 percent of original size [2021-11-02 12:27:30,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 45 [2021-11-02 12:27:31,462 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-02 12:27:31,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 45 [2021-11-02 12:27:35,686 INFO L354 Elim1Store]: treesize reduction 230, result has 15.4 percent of original size [2021-11-02 12:27:35,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 48 treesize of output 73 [2021-11-02 12:27:36,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:27:36,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2021-11-02 12:27:38,643 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-02 12:27:38,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 173 treesize of output 183 [2021-11-02 12:27:44,603 INFO L354 Elim1Store]: treesize reduction 216, result has 20.6 percent of original size [2021-11-02 12:27:44,603 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 20 case distinctions, treesize of input 82 treesize of output 121 [2021-11-02 12:27:48,916 INFO L354 Elim1Store]: treesize reduction 285, result has 19.7 percent of original size [2021-11-02 12:27:48,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 110 treesize of output 161 [2021-11-02 12:28:26,141 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 0 case distinctions, treesize of input 12 treesize of output 4 [2021-11-02 12:28:26,151 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-02 12:28:26,189 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 0 case distinctions, treesize of input 11 treesize of output 3 [2021-11-02 12:28:26,213 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 0 case distinctions, treesize of input 11 treesize of output 3 [2021-11-02 12:29:14,541 INFO L354 Elim1Store]: treesize reduction 476, result has 12.7 percent of original size [2021-11-02 12:29:14,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 156 treesize of output 202 [2021-11-02 12:29:48,142 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-11-02 12:29:48,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 181 treesize of output 184 [2021-11-02 12:32:00,340 INFO L354 Elim1Store]: treesize reduction 376, result has 13.2 percent of original size [2021-11-02 12:32:00,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 43 case distinctions, treesize of input 182 treesize of output 219 [2021-11-02 12:34:06,010 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 101 [2021-11-02 12:34:06,010 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-02 12:34:06,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:34:06,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033398342] [2021-11-02 12:34:06,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 12:34:06,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256563824] [2021-11-02 12:34:06,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-02 12:34:06,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:34:06,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-02 12:34:06,011 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-02 12:34:06,011 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-02 12:34:06,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2021-11-02 12:34:06,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2021-11-02 12:34:06,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2021-11-02 12:34:06,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2021-11-02 12:34:06,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2021-11-02 12:34:06,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2021-11-02 12:34:06,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2021-11-02 12:34:06,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2021-11-02 12:34:06,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2021-11-02 12:34:06,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2021-11-02 12:34:06,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2021-11-02 12:34:06,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2021-11-02 12:34:06,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2021-11-02 12:34:06,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2021-11-02 12:34:06,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2021-11-02 12:34:06,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2021-11-02 12:34:06,248 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forcibly destroying the process [2021-11-02 12:34:06,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 137 [2021-11-02 12:34:06,289 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-02 12:34:06,294 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:34:06,297 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 12:34:06,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:34:06 BoogieIcfgContainer [2021-11-02 12:34:06,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 12:34:06,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 12:34:06,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 12:34:06,336 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 12:34:06,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:24:14" (3/4) ... [2021-11-02 12:34:06,339 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 12:34:06,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 12:34:06,340 INFO L158 Benchmark]: Toolchain (without parser) took 597562.87ms. Allocated memory was 115.3MB in the beginning and 618.7MB in the end (delta: 503.3MB). Free memory was 76.9MB in the beginning and 320.5MB in the end (delta: -243.6MB). Peak memory consumption was 258.2MB. Max. memory is 16.1GB. [2021-11-02 12:34:06,341 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 12:34:06,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1471.42ms. Allocated memory was 115.3MB in the beginning and 146.8MB in the end (delta: 31.5MB). Free memory was 76.6MB in the beginning and 85.8MB in the end (delta: -9.2MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2021-11-02 12:34:06,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.87ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 71.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-02 12:34:06,342 INFO L158 Benchmark]: Boogie Preprocessor took 95.09ms. Allocated memory is still 146.8MB. Free memory was 71.5MB in the beginning and 60.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-02 12:34:06,342 INFO L158 Benchmark]: RCFGBuilder took 4169.09ms. Allocated memory was 146.8MB in the beginning and 480.2MB in the end (delta: 333.4MB). Free memory was 60.9MB in the beginning and 186.2MB in the end (delta: -125.3MB). Peak memory consumption was 259.3MB. Max. memory is 16.1GB. [2021-11-02 12:34:06,342 INFO L158 Benchmark]: TraceAbstraction took 591681.82ms. Allocated memory was 480.2MB in the beginning and 618.7MB in the end (delta: 138.4MB). Free memory was 186.2MB in the beginning and 320.5MB in the end (delta: -134.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2021-11-02 12:34:06,343 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 618.7MB. Free memory is still 320.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 12:34:06,344 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.18ms. Allocated memory is still 75.5MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1471.42ms. Allocated memory was 115.3MB in the beginning and 146.8MB in the end (delta: 31.5MB). Free memory was 76.6MB in the beginning and 85.8MB in the end (delta: -9.2MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.87ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 71.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.09ms. Allocated memory is still 146.8MB. Free memory was 71.5MB in the beginning and 60.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4169.09ms. Allocated memory was 146.8MB in the beginning and 480.2MB in the end (delta: 333.4MB). Free memory was 60.9MB in the beginning and 186.2MB in the end (delta: -125.3MB). Peak memory consumption was 259.3MB. Max. memory is 16.1GB. * TraceAbstraction took 591681.82ms. Allocated memory was 480.2MB in the beginning and 618.7MB in the end (delta: 138.4MB). Free memory was 186.2MB in the beginning and 320.5MB in the end (delta: -134.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 618.7MB. Free memory is still 320.5MB. 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 7764. 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; [L7763-L7911] 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", } , }; [L7914-L7917] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7919-L7928] 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.") } , }; [L7930-L7933] 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])), }; [L7935-L7939] static _Bool s_common_library_initialized = 0 ; [L7953] struct aws_array_list from; [L7954] struct aws_array_list to; [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) [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) [L7965] from.alloc [L211] COND FALSE !(!cond) [L7968] to.alloc [L211] COND FALSE !(!cond) [L7972] from.item_size [L211] COND FALSE !(!cond) [L7973] to.item_size [L211] COND FALSE !(!cond) [L7974] from.item_size [L7974] to.item_size [L211] COND FALSE !(!cond) [L7977] struct aws_array_list old_from = from; [L7978] struct store_byte_from_buffer old_byte_from; [L7979] from.data [L7979] from.current_size [L7183] COND FALSE !(size > 0 && array && storage) [L7981] struct aws_array_list old_to = to; [L7982] struct store_byte_from_buffer old_byte_to; [L7983] to.data [L7983] to.current_size [L7183] COND FALSE !(size > 0 && array && storage) [L3464] list_a->alloc [L211] COND FALSE !(!cond) [L3465] list_a->alloc [L3465] list_b->alloc [L211] COND FALSE !(!cond) [L3466] list_a->item_size [L3466] list_b->item_size [L211] COND FALSE !(!cond) [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) [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) [L3471] struct aws_array_list tmp = *list_a; [L3472] *list_a = *list_b [L3473] *list_b = tmp [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. - 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, 261 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 591593.69ms, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 33.72ms, AutomataDifference: 28388.95ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 13.22ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 2748 SdHoareTripleChecker+Valid, 27601.72ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2748 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 25291.55ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1000 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3036 IncrementalHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 0 mSDtfsCounter, 3036 mSolverCounterSat, 65.17ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 606.77ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 75.27ms AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 524.06ms SsaConstructionTime, 161961.27ms SatisfiabilityAnalysisTime, 399015.10ms InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 809 SizeOfPredicates, 13 NumberOfNonLiveVariables, 11472 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 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_swap_contents_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 877e83a63a602219ce02028b5212cf6c29aa8f33a031ee39d52c3c671213dc91 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:34:07,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:34:07,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:34:08,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:34:08,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:34:08,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:34:08,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:34:08,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:34:08,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:34:08,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:34:08,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:34:08,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:34:08,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:34:08,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:34:08,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:34:08,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:34:08,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:34:08,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:34:08,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:34:08,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:34:08,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:34:08,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:34:08,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:34:08,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:34:08,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:34:08,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:34:08,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:34:08,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:34:08,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:34:08,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:34:08,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:34:08,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:34:08,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:34:08,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:34:08,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:34:08,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:34:08,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:34:08,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:34:08,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:34:08,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:34:08,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:34:08,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 12:34:08,127 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:34:08,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:34:08,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:34:08,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:34:08,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:34:08,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:34:08,130 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:34:08,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:34:08,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:34:08,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:34:08,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:34:08,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:34:08,132 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 12:34:08,132 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 12:34:08,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:34:08,132 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:34:08,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:34:08,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:34:08,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:34:08,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:34:08,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:34:08,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:34:08,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:34:08,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:34:08,134 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 12:34:08,134 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 12:34:08,134 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:34:08,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:34:08,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:34:08,134 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:34:08,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 12:34:08,135 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 -> 877e83a63a602219ce02028b5212cf6c29aa8f33a031ee39d52c3c671213dc91 [2021-11-02 12:34:08,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:34:08,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:34:08,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:34:08,417 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:34:08,418 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:34:08,419 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_swap_contents_harness.i [2021-11-02 12:34:08,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a259061f3/a387885236c24cb1b2d95d873b1bd0ff/FLAGaf90b18b0 [2021-11-02 12:34:09,127 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:34:09,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_swap_contents_harness.i [2021-11-02 12:34:09,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a259061f3/a387885236c24cb1b2d95d873b1bd0ff/FLAGaf90b18b0 [2021-11-02 12:34:09,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a259061f3/a387885236c24cb1b2d95d873b1bd0ff [2021-11-02 12:34:09,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:34:09,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:34:09,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:34:09,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:34:09,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:34:09,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:34:09" (1/1) ... [2021-11-02 12:34:09,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c21dcb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:09, skipping insertion in model container [2021-11-02 12:34:09,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:34:09" (1/1) ... [2021-11-02 12:34:09,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:34:09,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:34:09,818 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_swap_contents_harness.i[4502,4515] [2021-11-02 12:34:09,829 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_swap_contents_harness.i[4562,4575] [2021-11-02 12:34:09,852 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:34:09,859 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:34:10,345 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:34:10,401 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,402 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,402 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,403 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,403 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,419 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,420 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,421 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,421 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,423 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,423 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,424 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,424 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,597 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:34:10,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:34:10,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:34:10,599 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:34:10,600 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:34:10,600 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:34:10,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:34:10,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:34:10,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:34:10,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:34:10,698 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,703 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:34:10,777 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:34:10,805 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_swap_contents_harness.i[4502,4515] [2021-11-02 12:34:10,805 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_swap_contents_harness.i[4562,4575] [2021-11-02 12:34:10,806 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:34:10,807 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:34:10,842 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:34:10,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,888 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,892 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,893 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,894 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,894 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,895 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,899 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,899 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,927 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:34:10,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:34:10,929 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:34:10,930 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:34:10,930 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:34:10,931 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:34:10,931 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:34:10,931 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:34:10,932 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:34:10,932 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:34:10,968 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:10,989 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:34:11,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:34:11,211 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:34:11,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11 WrapperNode [2021-11-02 12:34:11,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:34:11,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:34:11,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:34:11,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:34:11,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:34:11,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:34:11,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:34:11,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:34:11,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:34:11,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:34:11,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:34:11,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:34:11,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (1/1) ... [2021-11-02 12:34:11,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:34:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:34:11,561 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-02 12:34:11,571 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-02 12:34:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:34:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 12:34:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 12:34:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-02 12:34:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:34:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 12:34:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:34:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:34:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 12:34:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 12:34:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:34:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-02 12:34:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 12:34:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 12:34:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-02 12:34:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:34:17,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:34:17,670 INFO L299 CfgBuilder]: Removed 218 assume(true) statements. [2021-11-02 12:34:17,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:34:17 BoogieIcfgContainer [2021-11-02 12:34:17,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:34:17,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:34:17,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:34:17,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:34:17,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:34:09" (1/3) ... [2021-11-02 12:34:17,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cc831c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:34:17, skipping insertion in model container [2021-11-02 12:34:17,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:34:11" (2/3) ... [2021-11-02 12:34:17,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cc831c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:34:17, skipping insertion in model container [2021-11-02 12:34:17,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:34:17" (3/3) ... [2021-11-02 12:34:17,681 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_swap_contents_harness.i [2021-11-02 12:34:17,687 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:34:17,687 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-11-02 12:34:17,727 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:34:17,733 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-02 12:34:17,733 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-11-02 12:34:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 244 states have (on average 1.4385245901639345) internal successors, (351), 260 states have internal predecessors, (351), 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-02 12:34:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 12:34:17,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:34:17,762 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] [2021-11-02 12:34:17,762 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:34:17,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:34:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1330632047, now seen corresponding path program 1 times [2021-11-02 12:34:17,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:34:17,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574408610] [2021-11-02 12:34:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:34:17,785 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:34:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:34:17,787 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-02 12:34:17,789 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-02 12:34:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:34:20,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-02 12:34:20,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:34:20,670 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-02 12:34:20,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:34:20,804 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-02 12:34:20,806 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:34:20,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574408610] [2021-11-02 12:34:20,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574408610] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:34:20,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:34:20,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 12:34:20,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295584334] [2021-11-02 12:34:20,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:34:20,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:34:20,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:34:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:34:20,854 INFO L87 Difference]: Start difference. First operand has 261 states, 244 states have (on average 1.4385245901639345) internal successors, (351), 260 states have internal predecessors, (351), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-02 12:34:23,135 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:34:26,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:34:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:34:27,591 INFO L93 Difference]: Finished difference Result 518 states and 697 transitions. [2021-11-02 12:34:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:34:27,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 62 [2021-11-02 12:34:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:34:27,603 INFO L225 Difference]: With dead ends: 518 [2021-11-02 12:34:27,604 INFO L226 Difference]: Without dead ends: 254 [2021-11-02 12:34:27,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.50ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:34:27,613 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6259.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.74ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6648.83ms IncrementalHoareTripleChecker+Time [2021-11-02 12:34:27,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 314 Unknown, 0 Unchecked, 5.74ms Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 2 Unknown, 0 Unchecked, 6648.83ms Time] [2021-11-02 12:34:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-11-02 12:34:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-11-02 12:34:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 238 states have (on average 1.2773109243697478) internal successors, (304), 253 states have internal predecessors, (304), 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-02 12:34:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 304 transitions. [2021-11-02 12:34:27,664 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 304 transitions. Word has length 62 [2021-11-02 12:34:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:34:27,664 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 304 transitions. [2021-11-02 12:34:27,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-02 12:34:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 304 transitions. [2021-11-02 12:34:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 12:34:27,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:34:27,671 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] [2021-11-02 12:34:27,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-02 12:34:27,895 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-02 12:34:27,896 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:34:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:34:27,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1348565053, now seen corresponding path program 1 times [2021-11-02 12:34:27,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:34:27,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300027236] [2021-11-02 12:34:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:34:27,900 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:34:27,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:34:27,902 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-02 12:34:27,903 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-02 12:34:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:34:30,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 12:34:30,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:34:30,444 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-02 12:34:30,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:34:30,707 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-02 12:34:30,707 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:34:30,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300027236] [2021-11-02 12:34:30,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300027236] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:34:30,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:34:30,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-02 12:34:30,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580532053] [2021-11-02 12:34:30,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 12:34:30,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:34:30,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 12:34:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:34:30,710 INFO L87 Difference]: Start difference. First operand 254 states and 304 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02 12:34:32,907 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:34:36,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:34:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:34:38,470 INFO L93 Difference]: Finished difference Result 496 states and 595 transitions. [2021-11-02 12:34:38,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 12:34:38,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2021-11-02 12:34:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:34:38,472 INFO L225 Difference]: With dead ends: 496 [2021-11-02 12:34:38,472 INFO L226 Difference]: Without dead ends: 256 [2021-11-02 12:34:38,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.31ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:34:38,474 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7293.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.04ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7693.12ms IncrementalHoareTripleChecker+Time [2021-11-02 12:34:38,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 608 Unknown, 0 Unchecked, 12.04ms Time], IncrementalHoareTripleChecker [2 Valid, 604 Invalid, 2 Unknown, 0 Unchecked, 7693.12ms Time] [2021-11-02 12:34:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-02 12:34:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-02 12:34:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.275) internal successors, (306), 255 states have internal predecessors, (306), 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-02 12:34:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 306 transitions. [2021-11-02 12:34:38,483 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 306 transitions. Word has length 62 [2021-11-02 12:34:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:34:38,483 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 306 transitions. [2021-11-02 12:34:38,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02 12:34:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 306 transitions. [2021-11-02 12:34:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 12:34:38,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:34:38,484 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] [2021-11-02 12:34:38,528 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-02 12:34:38,703 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-02 12:34:38,704 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:34:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:34:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 87647803, now seen corresponding path program 1 times [2021-11-02 12:34:38,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:34:38,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361488160] [2021-11-02 12:34:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:34:38,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:34:38,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:34:38,708 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-02 12:34:38,710 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-02 12:34:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:34:41,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-02 12:34:41,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:34:41,649 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:34:41,650 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-02 12:34:41,971 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-02 12:34:41,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:34:42,647 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-02 12:34:42,648 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:34:42,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361488160] [2021-11-02 12:34:42,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361488160] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:34:42,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:34:42,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-11-02 12:34:42,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24218939] [2021-11-02 12:34:42,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 12:34:42,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:34:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 12:34:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:34:42,649 INFO L87 Difference]: Start difference. First operand 256 states and 306 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-02 12:34:44,831 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-02 12:34:52,380 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:34:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:34:57,408 INFO L93 Difference]: Finished difference Result 517 states and 619 transitions. [2021-11-02 12:34:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:34:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 62 [2021-11-02 12:34:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:34:57,411 INFO L225 Difference]: With dead ends: 517 [2021-11-02 12:34:57,411 INFO L226 Difference]: Without dead ends: 276 [2021-11-02 12:34:57,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1804.22ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:34:57,413 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12398.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.22ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13491.40ms IncrementalHoareTripleChecker+Time [2021-11-02 12:34:57,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 1497 Unknown, 0 Unchecked, 24.22ms Time], IncrementalHoareTripleChecker [36 Valid, 1459 Invalid, 2 Unknown, 0 Unchecked, 13491.40ms Time] [2021-11-02 12:34:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-02 12:34:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 252. [2021-11-02 12:34:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 236 states have (on average 1.2754237288135593) internal successors, (301), 251 states have internal predecessors, (301), 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-02 12:34:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2021-11-02 12:34:57,426 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 62 [2021-11-02 12:34:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:34:57,426 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2021-11-02 12:34:57,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-02 12:34:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2021-11-02 12:34:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 12:34:57,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:34:57,432 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] [2021-11-02 12:34:57,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-02 12:34:57,647 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-02 12:34:57,648 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:34:57,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:34:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -606758363, now seen corresponding path program 1 times [2021-11-02 12:34:57,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:34:57,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405591064] [2021-11-02 12:34:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:34:57,652 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:34:57,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:34:57,653 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-02 12:34:57,654 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-02 12:34:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:34:59,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1542 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 12:34:59,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:35:00,385 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-02 12:35:00,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:35:00,720 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-02 12:35:00,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:35:00,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405591064] [2021-11-02 12:35:00,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405591064] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:35:00,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:35:00,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 12:35:00,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702958140] [2021-11-02 12:35:00,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:35:00,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:35:00,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:35:00,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:35:00,722 INFO L87 Difference]: Start difference. First operand 252 states and 301 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02 12:35:02,915 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-02 12:35:06,856 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:35:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:35:09,582 INFO L93 Difference]: Finished difference Result 476 states and 567 transitions. [2021-11-02 12:35:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:35:09,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2021-11-02 12:35:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:35:09,584 INFO L225 Difference]: With dead ends: 476 [2021-11-02 12:35:09,584 INFO L226 Difference]: Without dead ends: 252 [2021-11-02 12:35:09,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:35:09,585 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8272.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.87ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8764.97ms IncrementalHoareTripleChecker+Time [2021-11-02 12:35:09,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 707 Unknown, 0 Unchecked, 10.87ms Time], IncrementalHoareTripleChecker [0 Valid, 705 Invalid, 2 Unknown, 0 Unchecked, 8764.97ms Time] [2021-11-02 12:35:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-02 12:35:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2021-11-02 12:35:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 236 states have (on average 1.271186440677966) internal successors, (300), 251 states have internal predecessors, (300), 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-02 12:35:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 300 transitions. [2021-11-02 12:35:09,593 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 300 transitions. Word has length 65 [2021-11-02 12:35:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:35:09,596 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 300 transitions. [2021-11-02 12:35:09,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02 12:35:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 300 transitions. [2021-11-02 12:35:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-02 12:35:09,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:35:09,597 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] [2021-11-02 12:35:09,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-02 12:35:09,803 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-02 12:35:09,803 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:35:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:35:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1471353281, now seen corresponding path program 1 times [2021-11-02 12:35:09,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:35:09,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677507296] [2021-11-02 12:35:09,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:35:09,807 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:35:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:35:09,808 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-02 12:35:09,810 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-02 12:35:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:35:12,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-02 12:35:12,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:35:13,048 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:35:13,049 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-02 12:35:13,291 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-02 12:35:13,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:35:13,907 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-02 12:35:13,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2021-11-02 12:35:13,943 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-02 12:35:13,944 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:35:13,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677507296] [2021-11-02 12:35:13,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677507296] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:35:13,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:35:13,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 12 [2021-11-02 12:35:13,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433009648] [2021-11-02 12:35:13,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:35:13,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:35:13,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:35:13,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:35:13,946 INFO L87 Difference]: Start difference. First operand 252 states and 300 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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-02 12:35:16,155 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:35:26,395 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:35:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:35:35,682 INFO L93 Difference]: Finished difference Result 525 states and 627 transitions. [2021-11-02 12:35:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:35:35,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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 73 [2021-11-02 12:35:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:35:35,683 INFO L225 Difference]: With dead ends: 525 [2021-11-02 12:35:35,684 INFO L226 Difference]: Without dead ends: 317 [2021-11-02 12:35:35,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1672.10ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:35:35,685 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 507 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18881.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.83ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20519.78ms IncrementalHoareTripleChecker+Time [2021-11-02 12:35:35,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 0 Invalid, 2623 Unknown, 0 Unchecked, 39.83ms Time], IncrementalHoareTripleChecker [55 Valid, 2566 Invalid, 2 Unknown, 0 Unchecked, 20519.78ms Time] [2021-11-02 12:35:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-02 12:35:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 248. [2021-11-02 12:35:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 232 states have (on average 1.271551724137931) internal successors, (295), 247 states have internal predecessors, (295), 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-02 12:35:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 295 transitions. [2021-11-02 12:35:35,696 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 295 transitions. Word has length 73 [2021-11-02 12:35:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:35:35,697 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 295 transitions. [2021-11-02 12:35:35,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 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-02 12:35:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 295 transitions. [2021-11-02 12:35:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-02 12:35:35,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:35:35,698 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] [2021-11-02 12:35:35,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-02 12:35:35,907 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-02 12:35:35,908 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:35:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:35:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash 79871608, now seen corresponding path program 1 times [2021-11-02 12:35:35,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:35:35,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164353092] [2021-11-02 12:35:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:35:35,911 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:35:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:35:35,912 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-02 12:35:35,913 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-02 12:35:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:35:38,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 12:35:38,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:35:38,893 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-02 12:35:38,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:35:39,385 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-02 12:35:39,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:35:39,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164353092] [2021-11-02 12:35:39,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164353092] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:35:39,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:35:39,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 12:35:39,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178795040] [2021-11-02 12:35:39,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:35:39,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:35:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:35:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:35:39,388 INFO L87 Difference]: Start difference. First operand 248 states and 295 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02 12:35:41,594 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:35:45,364 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:35:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:35:47,902 INFO L93 Difference]: Finished difference Result 439 states and 520 transitions. [2021-11-02 12:35:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:35:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 76 [2021-11-02 12:35:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:35:47,904 INFO L225 Difference]: With dead ends: 439 [2021-11-02 12:35:47,904 INFO L226 Difference]: Without dead ends: 248 [2021-11-02 12:35:47,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.96ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:35:47,905 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7914.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8419.10ms IncrementalHoareTripleChecker+Time [2021-11-02 12:35:47,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 686 Unknown, 0 Unchecked, 7.88ms Time], IncrementalHoareTripleChecker [0 Valid, 684 Invalid, 2 Unknown, 0 Unchecked, 8419.10ms Time] [2021-11-02 12:35:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-02 12:35:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-11-02 12:35:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 232 states have (on average 1.2672413793103448) internal successors, (294), 247 states have internal predecessors, (294), 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-02 12:35:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 294 transitions. [2021-11-02 12:35:47,915 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 294 transitions. Word has length 76 [2021-11-02 12:35:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:35:47,915 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 294 transitions. [2021-11-02 12:35:47,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02 12:35:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 294 transitions. [2021-11-02 12:35:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-02 12:35:47,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:35:47,920 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] [2021-11-02 12:35:47,971 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-02 12:35:48,136 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-02 12:35:48,137 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:35:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:35:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -880543268, now seen corresponding path program 1 times [2021-11-02 12:35:48,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:35:48,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457845167] [2021-11-02 12:35:48,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:35:48,140 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:35:48,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:35:48,141 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-02 12:35:48,142 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-02 12:35:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:35:50,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 12:35:50,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:35:51,531 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-02 12:35:51,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:35:52,239 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-02 12:35:52,239 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:35:52,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457845167] [2021-11-02 12:35:52,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457845167] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:35:52,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:35:52,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 12:35:52,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446234817] [2021-11-02 12:35:52,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:35:52,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:35:52,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:35:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:35:52,240 INFO L87 Difference]: Start difference. First operand 248 states and 294 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-02 12:35:54,466 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-02 12:35:58,720 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:36:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:36:02,157 INFO L93 Difference]: Finished difference Result 395 states and 468 transitions. [2021-11-02 12:36:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:36:02,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2021-11-02 12:36:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:36:02,159 INFO L225 Difference]: With dead ends: 395 [2021-11-02 12:36:02,159 INFO L226 Difference]: Without dead ends: 248 [2021-11-02 12:36:02,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 177.95ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:36:02,160 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9189.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9745.50ms IncrementalHoareTripleChecker+Time [2021-11-02 12:36:02,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 922 Unknown, 0 Unchecked, 8.08ms Time], IncrementalHoareTripleChecker [1 Valid, 919 Invalid, 2 Unknown, 0 Unchecked, 9745.50ms Time] [2021-11-02 12:36:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-02 12:36:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-11-02 12:36:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 232 states have (on average 1.2629310344827587) internal successors, (293), 247 states have internal predecessors, (293), 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-02 12:36:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2021-11-02 12:36:02,172 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 84 [2021-11-02 12:36:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:36:02,172 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2021-11-02 12:36:02,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-02 12:36:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2021-11-02 12:36:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-02 12:36:02,174 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:36:02,174 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] [2021-11-02 12:36:02,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-02 12:36:02,377 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-02 12:36:02,377 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:36:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:36:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 652615360, now seen corresponding path program 1 times [2021-11-02 12:36:02,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:36:02,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855136299] [2021-11-02 12:36:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:36:02,381 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:36:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:36:02,383 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-02 12:36:02,384 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-02 12:36:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:36:05,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 1713 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 12:36:05,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:36:06,363 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-02 12:36:06,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:36:07,061 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-02 12:36:07,061 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:36:07,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855136299] [2021-11-02 12:36:07,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855136299] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:36:07,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:36:07,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 12:36:07,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514478558] [2021-11-02 12:36:07,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:36:07,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:36:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:36:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:36:07,063 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-02 12:36:09,277 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:36:13,345 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:36:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:36:16,290 INFO L93 Difference]: Finished difference Result 379 states and 446 transitions. [2021-11-02 12:36:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:36:16,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 92 [2021-11-02 12:36:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:36:16,292 INFO L225 Difference]: With dead ends: 379 [2021-11-02 12:36:16,292 INFO L226 Difference]: Without dead ends: 248 [2021-11-02 12:36:16,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 177.38ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:36:16,293 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8550.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.04ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9055.34ms IncrementalHoareTripleChecker+Time [2021-11-02 12:36:16,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 905 Unknown, 0 Unchecked, 7.04ms Time], IncrementalHoareTripleChecker [1 Valid, 902 Invalid, 2 Unknown, 0 Unchecked, 9055.34ms Time] [2021-11-02 12:36:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-02 12:36:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-11-02 12:36:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 232 states have (on average 1.2586206896551724) internal successors, (292), 247 states have internal predecessors, (292), 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-02 12:36:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 292 transitions. [2021-11-02 12:36:16,302 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 292 transitions. Word has length 92 [2021-11-02 12:36:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:36:16,302 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 292 transitions. [2021-11-02 12:36:16,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-02 12:36:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 292 transitions. [2021-11-02 12:36:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-02 12:36:16,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:36:16,303 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, 1] [2021-11-02 12:36:16,365 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-02 12:36:16,512 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-02 12:36:16,513 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:36:16,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:36:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash -788299612, now seen corresponding path program 1 times [2021-11-02 12:36:16,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:36:16,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876920390] [2021-11-02 12:36:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:36:16,516 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:36:16,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:36:16,517 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-02 12:36:16,518 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-02 12:36:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:36:19,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 1766 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 12:36:19,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:36:20,792 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-02 12:36:20,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:36:21,651 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-02 12:36:21,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:36:21,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876920390] [2021-11-02 12:36:21,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876920390] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:36:21,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:36:21,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 12:36:21,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850254926] [2021-11-02 12:36:21,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:36:21,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:36:21,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:36:21,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:36:21,653 INFO L87 Difference]: Start difference. First operand 248 states and 292 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-02 12:36:23,859 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:36:28,362 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:36:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:36:31,425 INFO L93 Difference]: Finished difference Result 363 states and 424 transitions. [2021-11-02 12:36:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:36:31,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 100 [2021-11-02 12:36:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:36:31,427 INFO L225 Difference]: With dead ends: 363 [2021-11-02 12:36:31,427 INFO L226 Difference]: Without dead ends: 248 [2021-11-02 12:36:31,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 189.96ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:36:31,428 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9024.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.64ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9593.01ms IncrementalHoareTripleChecker+Time [2021-11-02 12:36:31,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 896 Unknown, 0 Unchecked, 7.64ms Time], IncrementalHoareTripleChecker [2 Valid, 892 Invalid, 2 Unknown, 0 Unchecked, 9593.01ms Time] [2021-11-02 12:36:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-02 12:36:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-11-02 12:36:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 232 states have (on average 1.2543103448275863) internal successors, (291), 247 states have internal predecessors, (291), 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-02 12:36:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 291 transitions. [2021-11-02 12:36:31,434 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 291 transitions. Word has length 100 [2021-11-02 12:36:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:36:31,434 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 291 transitions. [2021-11-02 12:36:31,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-02 12:36:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 291 transitions. [2021-11-02 12:36:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-02 12:36:31,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:36:31,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:36:31,488 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-02 12:36:31,640 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-02 12:36:31,640 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-11-02 12:36:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:36:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 749182856, now seen corresponding path program 1 times [2021-11-02 12:36:31,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:36:31,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715803063] [2021-11-02 12:36:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:36:31,644 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:36:31,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:36:31,645 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-02 12:36:31,646 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