./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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_copy_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 3a98a47bac7562a35bba31573ebdfd704a9d27baca1b439deea796ac12a0961b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 09:46:19,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 09:46:19,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 09:46:19,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 09:46:19,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 09:46:19,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 09:46:19,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 09:46:19,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 09:46:19,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 09:46:19,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 09:46:19,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 09:46:19,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 09:46:19,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 09:46:19,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 09:46:19,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 09:46:19,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 09:46:19,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 09:46:19,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 09:46:19,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 09:46:19,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 09:46:19,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 09:46:19,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 09:46:19,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 09:46:19,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 09:46:19,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 09:46:19,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 09:46:19,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 09:46:19,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 09:46:19,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 09:46:19,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 09:46:19,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 09:46:19,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 09:46:19,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 09:46:19,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 09:46:19,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 09:46:19,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 09:46:19,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 09:46:19,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 09:46:19,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 09:46:19,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 09:46:19,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 09:46:19,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 09:46:19,806 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 09:46:19,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 09:46:19,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 09:46:19,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 09:46:19,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 09:46:19,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 09:46:19,809 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 09:46:19,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 09:46:19,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 09:46:19,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 09:46:19,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 09:46:19,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 09:46:19,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 09:46:19,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 09:46:19,810 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 09:46:19,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 09:46:19,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 09:46:19,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 09:46:19,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 09:46:19,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 09:46:19,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 09:46:19,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 09:46:19,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 09:46:19,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 09:46:19,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 09:46:19,812 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 09:46:19,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 09:46:19,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 09:46:19,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 09:46:19,813 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 -> 3a98a47bac7562a35bba31573ebdfd704a9d27baca1b439deea796ac12a0961b [2021-11-06 09:46:19,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 09:46:20,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 09:46:20,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 09:46:20,016 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 09:46:20,017 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 09:46:20,017 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_copy_harness.i [2021-11-06 09:46:20,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f4e717d/6cdb1c655f034c308482836695e3572f/FLAGb478f58cc [2021-11-06 09:46:20,652 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 09:46:20,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2021-11-06 09:46:20,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f4e717d/6cdb1c655f034c308482836695e3572f/FLAGb478f58cc [2021-11-06 09:46:20,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f4e717d/6cdb1c655f034c308482836695e3572f [2021-11-06 09:46:20,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 09:46:20,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 09:46:20,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 09:46:20,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 09:46:20,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 09:46:20,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:46:20" (1/1) ... [2021-11-06 09:46:20,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b29013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:20, skipping insertion in model container [2021-11-06 09:46:20,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:46:20" (1/1) ... [2021-11-06 09:46:20,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 09:46:20,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 09:46:21,170 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_copy_harness.i[4493,4506] [2021-11-06 09:46:21,174 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_copy_harness.i[4553,4566] [2021-11-06 09:46:21,190 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 09:46:21,193 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 09:46:21,685 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 09:46:21,739 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,750 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,751 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,752 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,753 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,760 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,768 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,770 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,771 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,772 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,772 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,773 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,774 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:21,954 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 09:46:21,955 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 09:46:21,956 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 09:46:21,958 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 09:46:21,960 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 09:46:21,961 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 09:46:21,962 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 09:46:21,963 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 09:46:21,964 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 09:46:21,965 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 09:46:22,052 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,055 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,059 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,070 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 09:46:22,134 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 09:46:22,152 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_copy_harness.i[4493,4506] [2021-11-06 09:46:22,153 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_copy_harness.i[4553,4566] [2021-11-06 09:46:22,156 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 09:46:22,157 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 09:46:22,195 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 09:46:22,211 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,211 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,212 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,212 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,213 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,218 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,218 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,219 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,219 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,221 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,221 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,221 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,222 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,254 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 09:46:22,255 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 09:46:22,256 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 09:46:22,257 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 09:46:22,257 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 09:46:22,258 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 09:46:22,258 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 09:46:22,258 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 09:46:22,258 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 09:46:22,259 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 09:46:22,290 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,290 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,291 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,294 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:46:22,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 09:46:22,433 INFO L208 MainTranslator]: Completed translation [2021-11-06 09:46:22,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22 WrapperNode [2021-11-06 09:46:22,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 09:46:22,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 09:46:22,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 09:46:22,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 09:46:22,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 09:46:22,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 09:46:22,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 09:46:22,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 09:46:22,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 09:46:22,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 09:46:22,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 09:46:22,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 09:46:22,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (1/1) ... [2021-11-06 09:46:22,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 09:46:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:22,746 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-06 09:46:22,801 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-06 09:46:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 09:46:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 09:46:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 09:46:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 09:46:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 09:46:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 09:46:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 09:46:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-06 09:46:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 09:46:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 09:46:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 09:46:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 09:46:30,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 09:46:30,768 INFO L299 CfgBuilder]: Removed 324 assume(true) statements. [2021-11-06 09:46:30,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:46:30 BoogieIcfgContainer [2021-11-06 09:46:30,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 09:46:30,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 09:46:30,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 09:46:30,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 09:46:30,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:46:20" (1/3) ... [2021-11-06 09:46:30,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74557e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:46:30, skipping insertion in model container [2021-11-06 09:46:30,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:46:22" (2/3) ... [2021-11-06 09:46:30,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74557e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:46:30, skipping insertion in model container [2021-11-06 09:46:30,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:46:30" (3/3) ... [2021-11-06 09:46:30,776 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2021-11-06 09:46:30,780 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 09:46:30,781 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-11-06 09:46:30,813 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 09:46:30,817 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-06 09:46:30,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-11-06 09:46:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 369 states, 355 states have (on average 1.4) internal successors, (497), 368 states have internal predecessors, (497), 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-06 09:46:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 09:46:30,838 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:30,839 INFO L513 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] [2021-11-06 09:46:30,839 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1546678732, now seen corresponding path program 1 times [2021-11-06 09:46:30,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:30,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374599956] [2021-11-06 09:46:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:30,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:31,352 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-06 09:46:31,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:31,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374599956] [2021-11-06 09:46:31,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374599956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:31,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:31,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 09:46:31,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084256701] [2021-11-06 09:46:31,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 09:46:31,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:31,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 09:46:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 09:46:31,374 INFO L87 Difference]: Start difference. First operand has 369 states, 355 states have (on average 1.4) internal successors, (497), 368 states have internal predecessors, (497), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-06 09:46:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:31,427 INFO L93 Difference]: Finished difference Result 734 states and 989 transitions. [2021-11-06 09:46:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 09:46:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 53 [2021-11-06 09:46:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:31,445 INFO L225 Difference]: With dead ends: 734 [2021-11-06 09:46:31,447 INFO L226 Difference]: Without dead ends: 364 [2021-11-06 09:46:31,453 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 09:46:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-06 09:46:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-11-06 09:46:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 351 states have (on average 1.2877492877492878) internal successors, (452), 363 states have internal predecessors, (452), 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-06 09:46:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 452 transitions. [2021-11-06 09:46:31,499 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 452 transitions. Word has length 53 [2021-11-06 09:46:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:31,499 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 452 transitions. [2021-11-06 09:46:31,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-06 09:46:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 452 transitions. [2021-11-06 09:46:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 09:46:31,501 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:31,501 INFO L513 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] [2021-11-06 09:46:31,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 09:46:31,502 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 481957526, now seen corresponding path program 1 times [2021-11-06 09:46:31,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:31,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595494657] [2021-11-06 09:46:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:31,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:31,734 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-06 09:46:31,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:31,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595494657] [2021-11-06 09:46:31,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595494657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:31,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:31,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 09:46:31,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200781401] [2021-11-06 09:46:31,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 09:46:31,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 09:46:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 09:46:31,739 INFO L87 Difference]: Start difference. First operand 364 states and 452 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06 09:46:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:31,811 INFO L93 Difference]: Finished difference Result 716 states and 891 transitions. [2021-11-06 09:46:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 09:46:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2021-11-06 09:46:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:31,814 INFO L225 Difference]: With dead ends: 716 [2021-11-06 09:46:31,814 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:46:31,816 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 09:46:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:46:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:46:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.2861189801699717) internal successors, (454), 365 states have internal predecessors, (454), 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-06 09:46:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 454 transitions. [2021-11-06 09:46:31,839 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 454 transitions. Word has length 53 [2021-11-06 09:46:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:31,840 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 454 transitions. [2021-11-06 09:46:31,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06 09:46:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 454 transitions. [2021-11-06 09:46:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 09:46:31,846 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:31,846 INFO L513 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] [2021-11-06 09:46:31,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 09:46:31,847 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1457204520, now seen corresponding path program 1 times [2021-11-06 09:46:31,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:31,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525945275] [2021-11-06 09:46:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:31,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:32,114 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-06 09:46:32,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:32,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525945275] [2021-11-06 09:46:32,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525945275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:32,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:32,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 09:46:32,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25146032] [2021-11-06 09:46:32,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 09:46:32,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 09:46:32,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 09:46:32,116 INFO L87 Difference]: Start difference. First operand 366 states and 454 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06 09:46:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:32,683 INFO L93 Difference]: Finished difference Result 700 states and 868 transitions. [2021-11-06 09:46:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 09:46:32,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-06 09:46:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:32,685 INFO L225 Difference]: With dead ends: 700 [2021-11-06 09:46:32,685 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:46:32,686 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 09:46:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:46:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:46:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.2804532577903682) internal successors, (452), 365 states have internal predecessors, (452), 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-06 09:46:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 452 transitions. [2021-11-06 09:46:32,700 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 452 transitions. Word has length 53 [2021-11-06 09:46:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:32,700 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 452 transitions. [2021-11-06 09:46:32,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06 09:46:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 452 transitions. [2021-11-06 09:46:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 09:46:32,703 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:32,703 INFO L513 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] [2021-11-06 09:46:32,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 09:46:32,704 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1402449476, now seen corresponding path program 1 times [2021-11-06 09:46:32,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:32,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203748546] [2021-11-06 09:46:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:32,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:32,764 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:46:32,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250244971] [2021-11-06 09:46:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:32,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:32,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:32,766 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-06 09:46:32,793 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-06 09:46:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:33,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 2556 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 09:46:33,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:46:34,089 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-06 09:46:34,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:34,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203748546] [2021-11-06 09:46:34,090 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:46:34,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250244971] [2021-11-06 09:46:34,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250244971] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:34,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:34,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 09:46:34,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076373690] [2021-11-06 09:46:34,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 09:46:34,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:34,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 09:46:34,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:46:34,092 INFO L87 Difference]: Start difference. First operand 366 states and 452 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-06 09:46:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:34,758 INFO L93 Difference]: Finished difference Result 667 states and 824 transitions. [2021-11-06 09:46:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 09:46:34,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2021-11-06 09:46:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:34,760 INFO L225 Difference]: With dead ends: 667 [2021-11-06 09:46:34,760 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:46:34,760 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 09:46:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:46:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:46:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.274787535410765) internal successors, (450), 365 states have internal predecessors, (450), 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-06 09:46:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 450 transitions. [2021-11-06 09:46:34,771 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 450 transitions. Word has length 61 [2021-11-06 09:46:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:34,772 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 450 transitions. [2021-11-06 09:46:34,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-06 09:46:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 450 transitions. [2021-11-06 09:46:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 09:46:34,774 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:34,774 INFO L513 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] [2021-11-06 09:46:34,800 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-06 09:46:34,987 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-06 09:46:34,988 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash -995056424, now seen corresponding path program 1 times [2021-11-06 09:46:34,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:34,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576046299] [2021-11-06 09:46:34,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:34,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:35,056 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:46:35,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641647695] [2021-11-06 09:46:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:35,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:35,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:35,058 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-06 09:46:35,103 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-06 09:46:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:35,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 09:46:35,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:46:36,401 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-06 09:46:36,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:36,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576046299] [2021-11-06 09:46:36,401 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:46:36,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641647695] [2021-11-06 09:46:36,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641647695] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:36,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:36,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 09:46:36,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378799351] [2021-11-06 09:46:36,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 09:46:36,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:36,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 09:46:36,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 09:46:36,403 INFO L87 Difference]: Start difference. First operand 366 states and 450 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-06 09:46:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:37,189 INFO L93 Difference]: Finished difference Result 643 states and 792 transitions. [2021-11-06 09:46:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 09:46:37,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2021-11-06 09:46:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:37,191 INFO L225 Difference]: With dead ends: 643 [2021-11-06 09:46:37,191 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:46:37,192 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-06 09:46:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:46:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:46:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.2606232294617563) internal successors, (445), 365 states have internal predecessors, (445), 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-06 09:46:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 445 transitions. [2021-11-06 09:46:37,201 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 445 transitions. Word has length 69 [2021-11-06 09:46:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:37,202 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 445 transitions. [2021-11-06 09:46:37,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-06 09:46:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 445 transitions. [2021-11-06 09:46:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 09:46:37,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:37,203 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 09:46:37,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 09:46:37,417 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-06 09:46:37,418 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash 995676554, now seen corresponding path program 1 times [2021-11-06 09:46:37,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:37,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011196113] [2021-11-06 09:46:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:37,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:37,569 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:46:37,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662781664] [2021-11-06 09:46:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:37,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:37,584 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-06 09:46:37,585 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-06 09:46:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:38,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 09:46:38,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:46:38,466 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-06 09:46:38,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:38,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011196113] [2021-11-06 09:46:38,467 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:46:38,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662781664] [2021-11-06 09:46:38,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662781664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:38,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:38,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 09:46:38,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125873502] [2021-11-06 09:46:38,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 09:46:38,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 09:46:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 09:46:38,468 INFO L87 Difference]: Start difference. First operand 366 states and 445 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:46:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:39,242 INFO L93 Difference]: Finished difference Result 771 states and 950 transitions. [2021-11-06 09:46:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 09:46:39,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 09:46:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:39,245 INFO L225 Difference]: With dead ends: 771 [2021-11-06 09:46:39,245 INFO L226 Difference]: Without dead ends: 436 [2021-11-06 09:46:39,246 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:46:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-11-06 09:46:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 394. [2021-11-06 09:46:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 381 states have (on average 1.2414698162729658) internal successors, (473), 393 states have internal predecessors, (473), 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-06 09:46:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 473 transitions. [2021-11-06 09:46:39,255 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 473 transitions. Word has length 81 [2021-11-06 09:46:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:39,255 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 473 transitions. [2021-11-06 09:46:39,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:46:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 473 transitions. [2021-11-06 09:46:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 09:46:39,256 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:39,256 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 09:46:39,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 09:46:39,473 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-06 09:46:39,473 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1129690060, now seen corresponding path program 1 times [2021-11-06 09:46:39,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:39,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448133461] [2021-11-06 09:46:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:39,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:39,571 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:46:39,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328610250] [2021-11-06 09:46:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:39,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:39,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:39,573 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-06 09:46:39,574 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-06 09:46:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:40,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 09:46:40,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:46:40,845 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-06 09:46:40,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:40,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448133461] [2021-11-06 09:46:40,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:46:40,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328610250] [2021-11-06 09:46:40,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328610250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:40,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:40,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 09:46:40,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542758990] [2021-11-06 09:46:40,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 09:46:40,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 09:46:40,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 09:46:40,847 INFO L87 Difference]: Start difference. First operand 394 states and 473 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:46:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:41,531 INFO L93 Difference]: Finished difference Result 675 states and 810 transitions. [2021-11-06 09:46:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 09:46:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 09:46:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:41,533 INFO L225 Difference]: With dead ends: 675 [2021-11-06 09:46:41,533 INFO L226 Difference]: Without dead ends: 394 [2021-11-06 09:46:41,534 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-06 09:46:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-06 09:46:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2021-11-06 09:46:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 381 states have (on average 1.2283464566929134) internal successors, (468), 393 states have internal predecessors, (468), 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-06 09:46:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 468 transitions. [2021-11-06 09:46:41,542 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 468 transitions. Word has length 81 [2021-11-06 09:46:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:41,542 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 468 transitions. [2021-11-06 09:46:41,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:46:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 468 transitions. [2021-11-06 09:46:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 09:46:41,543 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:41,543 INFO L513 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] [2021-11-06 09:46:41,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 09:46:41,743 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-06 09:46:41,744 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 224097512, now seen corresponding path program 1 times [2021-11-06 09:46:41,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:41,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301008193] [2021-11-06 09:46:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:41,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:41,817 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:46:41,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015598441] [2021-11-06 09:46:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:41,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:41,833 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 09:46:41,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 09:46:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:42,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 09:46:42,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:46:42,758 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-06 09:46:42,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:42,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301008193] [2021-11-06 09:46:42,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:46:42,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015598441] [2021-11-06 09:46:42,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015598441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:42,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:42,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 09:46:42,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228395119] [2021-11-06 09:46:42,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 09:46:42,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:42,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 09:46:42,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:46:42,760 INFO L87 Difference]: Start difference. First operand 394 states and 468 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-06 09:46:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:43,059 INFO L93 Difference]: Finished difference Result 872 states and 1039 transitions. [2021-11-06 09:46:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 09:46:43,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 89 [2021-11-06 09:46:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:43,062 INFO L225 Difference]: With dead ends: 872 [2021-11-06 09:46:43,062 INFO L226 Difference]: Without dead ends: 820 [2021-11-06 09:46:43,063 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 09:46:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-11-06 09:46:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 396. [2021-11-06 09:46:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 383 states have (on average 1.227154046997389) internal successors, (470), 395 states have internal predecessors, (470), 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-06 09:46:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 470 transitions. [2021-11-06 09:46:43,073 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 470 transitions. Word has length 89 [2021-11-06 09:46:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:43,073 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 470 transitions. [2021-11-06 09:46:43,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-06 09:46:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 470 transitions. [2021-11-06 09:46:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 09:46:43,074 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:43,074 INFO L513 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] [2021-11-06 09:46:43,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 09:46:43,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:43,292 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 923773556, now seen corresponding path program 1 times [2021-11-06 09:46:43,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:43,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292280774] [2021-11-06 09:46:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:43,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:43,381 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:46:43,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465093597] [2021-11-06 09:46:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:43,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:43,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 09:46:43,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 09:46:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:44,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 2936 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 09:46:44,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:46:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 09:46:44,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:44,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292280774] [2021-11-06 09:46:44,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:46:44,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465093597] [2021-11-06 09:46:44,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465093597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:44,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:44,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 09:46:44,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928839686] [2021-11-06 09:46:44,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 09:46:44,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:44,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 09:46:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:46:44,420 INFO L87 Difference]: Start difference. First operand 396 states and 470 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 09:46:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:46:44,875 INFO L93 Difference]: Finished difference Result 797 states and 942 transitions. [2021-11-06 09:46:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 09:46:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2021-11-06 09:46:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:46:44,878 INFO L225 Difference]: With dead ends: 797 [2021-11-06 09:46:44,878 INFO L226 Difference]: Without dead ends: 711 [2021-11-06 09:46:44,878 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 09:46:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-11-06 09:46:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 399. [2021-11-06 09:46:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 386 states have (on average 1.2253886010362693) internal successors, (473), 398 states have internal predecessors, (473), 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-06 09:46:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 473 transitions. [2021-11-06 09:46:44,887 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 473 transitions. Word has length 93 [2021-11-06 09:46:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:46:44,887 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 473 transitions. [2021-11-06 09:46:44,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 09:46:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 473 transitions. [2021-11-06 09:46:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 09:46:44,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:46:44,888 INFO L513 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] [2021-11-06 09:46:44,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-06 09:46:45,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:45,104 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:46:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:46:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1070736296, now seen corresponding path program 1 times [2021-11-06 09:46:45,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:46:45,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570783075] [2021-11-06 09:46:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:45,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:46:45,182 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:46:45,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795110441] [2021-11-06 09:46:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:46:45,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:46:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:46:45,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 09:46:45,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 09:46:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:46:46,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 2945 conjuncts, 118 conjunts are in the unsatisfiable core [2021-11-06 09:46:46,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:46:46,148 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-06 09:46:46,148 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-06 09:46:47,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:46:47,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-06 09:46:47,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:46:47,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-06 09:46:47,446 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-06 09:46:47,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-06 09:46:47,684 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-06 09:46:47,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 45 [2021-11-06 09:46:47,730 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-06 09:46:47,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2021-11-06 09:46:48,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2021-11-06 09:46:48,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2021-11-06 09:46:49,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:46:49,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-11-06 09:46:49,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:46:49,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-11-06 09:46:51,226 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-06 09:46:51,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:46:51,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570783075] [2021-11-06 09:46:51,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:46:51,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795110441] [2021-11-06 09:46:51,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795110441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:46:51,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:46:51,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 09:46:51,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316108316] [2021-11-06 09:46:51,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 09:46:51,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:46:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 09:46:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-11-06 09:46:51,228 INFO L87 Difference]: Start difference. First operand 399 states and 473 transitions. Second operand has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 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-06 09:47:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:47:38,035 INFO L93 Difference]: Finished difference Result 835 states and 989 transitions. [2021-11-06 09:47:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 09:47:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 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 95 [2021-11-06 09:47:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:47:38,046 INFO L225 Difference]: With dead ends: 835 [2021-11-06 09:47:38,046 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 09:47:38,055 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2021-11-06 09:47:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 09:47:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 395. [2021-11-06 09:47:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 382 states have (on average 1.225130890052356) internal successors, (468), 394 states have internal predecessors, (468), 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-06 09:47:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 468 transitions. [2021-11-06 09:47:38,071 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 468 transitions. Word has length 95 [2021-11-06 09:47:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:47:38,071 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 468 transitions. [2021-11-06 09:47:38,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 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-06 09:47:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 468 transitions. [2021-11-06 09:47:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 09:47:38,073 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:47:38,073 INFO L513 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] [2021-11-06 09:47:38,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-06 09:47:38,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:47:38,284 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:47:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:47:38,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1613581742, now seen corresponding path program 1 times [2021-11-06 09:47:38,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:47:38,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934640817] [2021-11-06 09:47:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:47:38,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:47:38,340 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:47:38,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348129427] [2021-11-06 09:47:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:47:38,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:47:38,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:47:38,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 09:47:38,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 09:47:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:47:39,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 2959 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-06 09:47:39,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:47:39,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-06 09:47:39,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:47:39,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-11-06 09:47:39,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:47:39,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-11-06 09:47:40,204 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-06 09:47:40,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:47:40,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934640817] [2021-11-06 09:47:40,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:47:40,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348129427] [2021-11-06 09:47:40,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348129427] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:47:40,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:47:40,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 09:47:40,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630093919] [2021-11-06 09:47:40,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 09:47:40,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:47:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 09:47:40,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-06 09:47:40,206 INFO L87 Difference]: Start difference. First operand 395 states and 468 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 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-06 09:47:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:47:44,984 INFO L93 Difference]: Finished difference Result 800 states and 953 transitions. [2021-11-06 09:47:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 09:47:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 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 98 [2021-11-06 09:47:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:47:44,987 INFO L225 Difference]: With dead ends: 800 [2021-11-06 09:47:44,987 INFO L226 Difference]: Without dead ends: 434 [2021-11-06 09:47:44,987 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-11-06 09:47:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-06 09:47:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 393. [2021-11-06 09:47:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 380 states have (on average 1.2236842105263157) internal successors, (465), 392 states have internal predecessors, (465), 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-06 09:47:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 465 transitions. [2021-11-06 09:47:44,997 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 465 transitions. Word has length 98 [2021-11-06 09:47:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:47:44,997 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 465 transitions. [2021-11-06 09:47:44,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 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-06 09:47:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 465 transitions. [2021-11-06 09:47:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-06 09:47:44,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:47:44,998 INFO L513 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-06 09:47:45,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-06 09:47:45,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-06 09:47:45,223 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:47:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:47:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1923816844, now seen corresponding path program 1 times [2021-11-06 09:47:45,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:47:45,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033382661] [2021-11-06 09:47:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:47:45,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:47:45,285 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:47:45,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559913558] [2021-11-06 09:47:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:47:45,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:47:45,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:47:45,299 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 09:47:45,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-06 09:47:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:47:47,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 2964 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-06 09:47:47,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:47:48,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:47:48,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-11-06 09:47:48,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:47:48,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-11-06 09:47:48,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2021-11-06 09:47:48,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2021-11-06 09:47:48,472 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-06 09:47:48,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:47:48,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033382661] [2021-11-06 09:47:48,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:47:48,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559913558] [2021-11-06 09:47:48,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559913558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:47:48,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:47:48,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 09:47:48,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760345245] [2021-11-06 09:47:48,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 09:47:48,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:47:48,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 09:47:48,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-06 09:47:48,474 INFO L87 Difference]: Start difference. First operand 393 states and 465 transitions. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 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-06 09:48:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:48:04,544 INFO L93 Difference]: Finished difference Result 979 states and 1150 transitions. [2021-11-06 09:48:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 09:48:04,545 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 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-06 09:48:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:48:04,546 INFO L225 Difference]: With dead ends: 979 [2021-11-06 09:48:04,546 INFO L226 Difference]: Without dead ends: 674 [2021-11-06 09:48:04,547 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=404, Invalid=1156, Unknown=0, NotChecked=0, Total=1560 [2021-11-06 09:48:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-11-06 09:48:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 448. [2021-11-06 09:48:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 435 states have (on average 1.2252873563218392) internal successors, (533), 447 states have internal predecessors, (533), 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-06 09:48:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 533 transitions. [2021-11-06 09:48:04,572 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 533 transitions. Word has length 100 [2021-11-06 09:48:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:48:04,572 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 533 transitions. [2021-11-06 09:48:04,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 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-06 09:48:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 533 transitions. [2021-11-06 09:48:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 09:48:04,573 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:04,573 INFO L513 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-06 09:48:04,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-06 09:48:04,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:48:04,795 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1234469132, now seen corresponding path program 1 times [2021-11-06 09:48:04,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:48:04,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122281934] [2021-11-06 09:48:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:04,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:48:04,854 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:48:04,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916458994] [2021-11-06 09:48:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:04,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:48:04,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:48:04,869 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 09:48:04,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-06 09:48:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:05,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 2964 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 09:48:05,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:48:06,353 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-06 09:48:06,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:48:06,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122281934] [2021-11-06 09:48:06,354 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:48:06,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916458994] [2021-11-06 09:48:06,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916458994] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 09:48:06,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:48:06,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 09:48:06,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674256832] [2021-11-06 09:48:06,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 09:48:06,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 09:48:06,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 09:48:06,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:48:06,355 INFO L87 Difference]: Start difference. First operand 448 states and 533 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-06 09:48:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:48:13,125 INFO L93 Difference]: Finished difference Result 1116 states and 1317 transitions. [2021-11-06 09:48:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 09:48:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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 102 [2021-11-06 09:48:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:48:13,128 INFO L225 Difference]: With dead ends: 1116 [2021-11-06 09:48:13,128 INFO L226 Difference]: Without dead ends: 694 [2021-11-06 09:48:13,129 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 09:48:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-11-06 09:48:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 471. [2021-11-06 09:48:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 458 states have (on average 1.2139737991266375) internal successors, (556), 470 states have internal predecessors, (556), 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-06 09:48:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 556 transitions. [2021-11-06 09:48:13,150 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 556 transitions. Word has length 102 [2021-11-06 09:48:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:48:13,150 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 556 transitions. [2021-11-06 09:48:13,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-06 09:48:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 556 transitions. [2021-11-06 09:48:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 09:48:13,151 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:13,151 INFO L513 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-06 09:48:13,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-06 09:48:13,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-06 09:48:13,367 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1894000654, now seen corresponding path program 1 times [2021-11-06 09:48:13,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 09:48:13,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637009324] [2021-11-06 09:48:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:13,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 09:48:13,429 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 09:48:13,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406352760] [2021-11-06 09:48:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:13,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 09:48:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:48:13,431 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 09:48:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-06 09:48:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:14,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 2969 conjuncts, 218 conjunts are in the unsatisfiable core [2021-11-06 09:48:14,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:48:14,673 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-06 09:48:14,674 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-06 09:48:15,175 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-11-06 09:48:15,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-11-06 09:48:15,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 09:48:15,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-11-06 09:48:15,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:15,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-06 09:48:15,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:15,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2021-11-06 09:48:16,102 INFO L354 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2021-11-06 09:48:16,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 31 [2021-11-06 09:48:16,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:16,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2021-11-06 09:48:16,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:16,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2021-11-06 09:48:18,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:18,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:18,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 09:48:18,579 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 09:48:18,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-11-06 09:48:18,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:18,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-06 09:48:18,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:18,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-11-06 09:48:19,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:19,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 87 [2021-11-06 09:48:19,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:19,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 09:48:19,341 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 09:48:19,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 75 [2021-11-06 09:48:19,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 09:48:19,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 09:48:19,376 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 09:48:19,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2021-11-06 09:48:23,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 09:48:23,009 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-06 09:48:23,010 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 68 treesize of output 46 [2021-11-06 09:48:23,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 09:48:23,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637009324] [2021-11-06 09:48:23,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 09:48:23,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406352760] [2021-11-06 09:48:23,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_aws_array_list_is_valid_~list.base] [2021-11-06 09:48:23,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:48:23,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 09:48:23,393 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 09:48:23,393 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 09:48:23,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 09:48:23,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-06 09:48:23,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-06 09:48:23,613 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 09:48:23,615 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 09:48:23,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:48:23 BoogieIcfgContainer [2021-11-06 09:48:23,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 09:48:23,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 09:48:23,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 09:48:23,651 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 09:48:23,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:46:30" (3/4) ... [2021-11-06 09:48:23,653 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 09:48:23,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 09:48:23,653 INFO L168 Benchmark]: Toolchain (without parser) took 122780.22 ms. Allocated memory was 119.5 MB in the beginning and 536.9 MB in the end (delta: 417.3 MB). Free memory was 77.2 MB in the beginning and 433.6 MB in the end (delta: -356.4 MB). Peak memory consumption was 60.3 MB. Max. memory is 16.1 GB. [2021-11-06 09:48:23,654 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 71.3 MB. Free memory was 31.0 MB in the beginning and 31.0 MB in the end (delta: 39.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 09:48:23,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1558.00 ms. Allocated memory was 119.5 MB in the beginning and 163.6 MB in the end (delta: 44.0 MB). Free memory was 77.0 MB in the beginning and 82.5 MB in the end (delta: -5.5 MB). Peak memory consumption was 56.4 MB. Max. memory is 16.1 GB. [2021-11-06 09:48:23,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.64 ms. Allocated memory is still 163.6 MB. Free memory was 82.5 MB in the beginning and 108.6 MB in the end (delta: -26.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 16.1 GB. [2021-11-06 09:48:23,658 INFO L168 Benchmark]: Boogie Preprocessor took 131.46 ms. Allocated memory is still 163.6 MB. Free memory was 108.5 MB in the beginning and 96.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-06 09:48:23,658 INFO L168 Benchmark]: RCFGBuilder took 8071.67 ms. Allocated memory was 163.6 MB in the beginning and 371.2 MB in the end (delta: 207.6 MB). Free memory was 96.9 MB in the beginning and 287.0 MB in the end (delta: -190.1 MB). Peak memory consumption was 219.7 MB. Max. memory is 16.1 GB. [2021-11-06 09:48:23,658 INFO L168 Benchmark]: TraceAbstraction took 112878.86 ms. Allocated memory was 371.2 MB in the beginning and 536.9 MB in the end (delta: 165.7 MB). Free memory was 285.9 MB in the beginning and 433.6 MB in the end (delta: -147.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-11-06 09:48:23,659 INFO L168 Benchmark]: Witness Printer took 2.52 ms. Allocated memory is still 536.9 MB. Free memory is still 433.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 09:48:23,660 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.18 ms. Allocated memory is still 71.3 MB. Free memory was 31.0 MB in the beginning and 31.0 MB in the end (delta: 39.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1558.00 ms. Allocated memory was 119.5 MB in the beginning and 163.6 MB in the end (delta: 44.0 MB). Free memory was 77.0 MB in the beginning and 82.5 MB in the end (delta: -5.5 MB). Peak memory consumption was 56.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 131.64 ms. Allocated memory is still 163.6 MB. Free memory was 82.5 MB in the beginning and 108.6 MB in the end (delta: -26.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 131.46 ms. Allocated memory is still 163.6 MB. Free memory was 108.5 MB in the beginning and 96.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 8071.67 ms. Allocated memory was 163.6 MB in the beginning and 371.2 MB in the end (delta: 207.6 MB). Free memory was 96.9 MB in the beginning and 287.0 MB in the end (delta: -190.1 MB). Peak memory consumption was 219.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 112878.86 ms. Allocated memory was 371.2 MB in the beginning and 536.9 MB in the end (delta: 165.7 MB). Free memory was 285.9 MB in the beginning and 433.6 MB in the end (delta: -147.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * Witness Printer took 2.52 ms. Allocated memory is still 536.9 MB. Free memory is still 433.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 7792. 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; [L7791-L7939] 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", } , }; [L7942-L7945] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7947-L7956] 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.") } , }; [L7958-L7961] 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])), }; [L7963-L7967] static _Bool s_common_library_initialized = 0 ; [L7981] struct aws_array_list from; [L7982] 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] COND FALSE !(list->current_size == 0 && list->length == 0) [L7019] EXPR list->current_size [L211] COND FALSE !(!cond) [L2782] return malloc(size); [L7019] list->data = bounded_malloc(list->current_size) [L261] return __VERIFIER_nondet_bool(); [L7020-L7022] EXPR nondet_bool() ? ((void *)0) : can_fail_allocator() [L7020-L7022] list->alloc = nondet_bool() ? ((void *)0) : 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))) [L3281] EXPR list->current_size [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) [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) [L7993] from.item_size [L7993] to.item_size [L211] COND FALSE !(!cond) [L7994] from.data [L211] COND FALSE !(!cond) [L7467] from->item_size [L7467] to->item_size [L211] COND FALSE !(!cond) [L7468] from->data [L211] COND FALSE !(!cond) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3281] EXPR list->current_size [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) [L3281] EXPR list->data [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) [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) [L7472] size_t copy_size; [L7473] EXPR from->length [L7473] EXPR from->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND TRUE __CPROVER_overflow_mult(a, b) [L7366] tl_last_error = err [L1998] return (-1); [L2497] return aws_raise_error(AWS_ERROR_OVERFLOW_DETECTED); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L7473] COND TRUE aws_mul_size_checked(from->length, from->item_size, ©_size) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L223] COND TRUE !cond [L223] reach_error() - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 369 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 112.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 78.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6087 SDtfs, 7635 SDslu, 15964 SDs, 0 SdLazy, 5891 SolverSat, 490 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 68.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1269 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 1130 NumberOfCodeBlocks, 1130 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1015 ConstructedInterpolants, 8 QuantifiedInterpolants, 3646 SizeOfPredicates, 139 NumberOfNonLiveVariables, 31347 ConjunctsInSsa, 504 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 09:48:23,876 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-06 09:48:23,901 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 137 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_copy_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 3a98a47bac7562a35bba31573ebdfd704a9d27baca1b439deea796ac12a0961b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 09:48:25,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 09:48:25,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 09:48:25,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 09:48:25,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 09:48:25,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 09:48:25,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 09:48:25,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 09:48:25,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 09:48:25,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 09:48:25,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 09:48:25,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 09:48:25,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 09:48:25,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 09:48:25,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 09:48:25,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 09:48:25,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 09:48:25,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 09:48:25,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 09:48:25,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 09:48:25,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 09:48:25,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 09:48:25,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 09:48:25,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 09:48:25,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 09:48:25,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 09:48:25,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 09:48:25,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 09:48:25,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 09:48:25,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 09:48:25,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 09:48:25,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 09:48:25,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 09:48:25,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 09:48:25,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 09:48:25,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 09:48:25,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 09:48:25,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 09:48:25,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 09:48:25,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 09:48:25,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 09:48:25,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 09:48:25,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 09:48:25,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 09:48:25,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 09:48:25,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 09:48:25,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 09:48:25,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 09:48:25,416 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 09:48:25,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 09:48:25,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 09:48:25,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 09:48:25,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 09:48:25,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 09:48:25,417 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 09:48:25,417 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 09:48:25,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 09:48:25,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 09:48:25,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 09:48:25,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 09:48:25,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 09:48:25,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 09:48:25,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 09:48:25,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 09:48:25,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 09:48:25,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 09:48:25,419 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 09:48:25,419 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 09:48:25,419 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 09:48:25,419 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 09:48:25,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 09:48:25,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 09:48:25,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 09:48:25,420 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 -> 3a98a47bac7562a35bba31573ebdfd704a9d27baca1b439deea796ac12a0961b [2021-11-06 09:48:25,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 09:48:25,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 09:48:25,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 09:48:25,768 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 09:48:25,769 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 09:48:25,769 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_copy_harness.i [2021-11-06 09:48:25,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2d571e5/76078d694050439db37c82ec3199c2b4/FLAGc18894e02 [2021-11-06 09:48:26,373 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 09:48:26,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2021-11-06 09:48:26,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2d571e5/76078d694050439db37c82ec3199c2b4/FLAGc18894e02 [2021-11-06 09:48:26,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2d571e5/76078d694050439db37c82ec3199c2b4 [2021-11-06 09:48:26,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 09:48:26,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 09:48:26,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 09:48:26,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 09:48:26,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 09:48:26,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:48:26" (1/1) ... [2021-11-06 09:48:26,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717d0b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26, skipping insertion in model container [2021-11-06 09:48:26,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:48:26" (1/1) ... [2021-11-06 09:48:26,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 09:48:26,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 09:48:27,088 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_copy_harness.i[4493,4506] [2021-11-06 09:48:27,093 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_copy_harness.i[4553,4566] [2021-11-06 09:48:27,107 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 09:48:27,112 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 09:48:27,580 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 09:48:27,636 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,636 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,637 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,637 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,637 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,644 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,644 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,645 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,645 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,654 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,655 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,655 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,655 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,872 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 09:48:27,874 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 09:48:27,874 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 09:48:27,875 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 09:48:27,876 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 09:48:27,877 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 09:48:27,877 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 09:48:27,880 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 09:48:27,882 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 09:48:27,885 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 09:48:27,963 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,970 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,972 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:27,975 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 09:48:28,042 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 09:48:28,050 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_copy_harness.i[4493,4506] [2021-11-06 09:48:28,051 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_copy_harness.i[4553,4566] [2021-11-06 09:48:28,052 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 09:48:28,052 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 09:48:28,084 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 09:48:28,093 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,093 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,093 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,093 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,094 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,097 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,098 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,098 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,098 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,099 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,099 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,100 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,100 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,118 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 09:48:28,119 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 09:48:28,119 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 09:48:28,119 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 09:48:28,120 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 09:48:28,120 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 09:48:28,121 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 09:48:28,121 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 09:48:28,121 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 09:48:28,122 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 09:48:28,136 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,137 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,137 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,140 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 09:48:28,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 09:48:28,328 INFO L208 MainTranslator]: Completed translation [2021-11-06 09:48:28,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28 WrapperNode [2021-11-06 09:48:28,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 09:48:28,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 09:48:28,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 09:48:28,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 09:48:28,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 09:48:28,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 09:48:28,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 09:48:28,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 09:48:28,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 09:48:28,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 09:48:28,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 09:48:28,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 09:48:28,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (1/1) ... [2021-11-06 09:48:28,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 09:48:28,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 09:48:28,671 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-06 09:48:28,698 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-06 09:48:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 09:48:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 09:48:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 09:48:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 09:48:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 09:48:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 09:48:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 09:48:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 09:48:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 09:48:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 09:48:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-06 09:48:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 09:48:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 09:48:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 09:48:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 09:48:38,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 09:48:38,987 INFO L299 CfgBuilder]: Removed 324 assume(true) statements. [2021-11-06 09:48:38,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:48:38 BoogieIcfgContainer [2021-11-06 09:48:38,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 09:48:38,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 09:48:38,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 09:48:38,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 09:48:38,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:48:26" (1/3) ... [2021-11-06 09:48:39,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61533ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:48:39, skipping insertion in model container [2021-11-06 09:48:39,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:28" (2/3) ... [2021-11-06 09:48:39,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61533ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:48:39, skipping insertion in model container [2021-11-06 09:48:39,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:48:38" (3/3) ... [2021-11-06 09:48:39,003 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2021-11-06 09:48:39,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 09:48:39,006 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-11-06 09:48:39,045 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 09:48:39,049 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-06 09:48:39,049 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-11-06 09:48:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 369 states, 355 states have (on average 1.4) internal successors, (497), 368 states have internal predecessors, (497), 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-06 09:48:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 09:48:39,067 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:39,067 INFO L513 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] [2021-11-06 09:48:39,068 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1546678732, now seen corresponding path program 1 times [2021-11-06 09:48:39,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:48:39,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244023186] [2021-11-06 09:48:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:39,083 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:48:39,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:48:39,101 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-06 09:48:39,113 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-06 09:48:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:41,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 09:48:41,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:48:41,424 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-06 09:48:41,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:48:41,656 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-06 09:48:41,657 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:48:41,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244023186] [2021-11-06 09:48:41,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244023186] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:48:41,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:48:41,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 09:48:41,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777816677] [2021-11-06 09:48:41,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 09:48:41,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:48:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 09:48:41,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 09:48:41,697 INFO L87 Difference]: Start difference. First operand has 369 states, 355 states have (on average 1.4) internal successors, (497), 368 states have internal predecessors, (497), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-06 09:48:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:48:41,783 INFO L93 Difference]: Finished difference Result 734 states and 989 transitions. [2021-11-06 09:48:41,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 09:48:41,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 53 [2021-11-06 09:48:41,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:48:41,793 INFO L225 Difference]: With dead ends: 734 [2021-11-06 09:48:41,793 INFO L226 Difference]: Without dead ends: 364 [2021-11-06 09:48:41,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 09:48:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-06 09:48:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-11-06 09:48:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 351 states have (on average 1.2877492877492878) internal successors, (452), 363 states have internal predecessors, (452), 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-06 09:48:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 452 transitions. [2021-11-06 09:48:41,831 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 452 transitions. Word has length 53 [2021-11-06 09:48:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:48:41,831 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 452 transitions. [2021-11-06 09:48:41,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-06 09:48:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 452 transitions. [2021-11-06 09:48:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 09:48:41,833 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:41,833 INFO L513 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] [2021-11-06 09:48:41,886 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-06 09:48:42,052 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-06 09:48:42,053 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:42,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 481957526, now seen corresponding path program 1 times [2021-11-06 09:48:42,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:48:42,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46067472] [2021-11-06 09:48:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:42,056 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:48:42,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:48:42,057 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-06 09:48:42,059 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-06 09:48:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:44,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 09:48:44,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:48:44,233 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-06 09:48:44,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:48:44,390 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-06 09:48:44,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:48:44,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46067472] [2021-11-06 09:48:44,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46067472] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:48:44,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:48:44,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 09:48:44,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875567532] [2021-11-06 09:48:44,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 09:48:44,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:48:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 09:48:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 09:48:44,395 INFO L87 Difference]: Start difference. First operand 364 states and 452 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06 09:48:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:48:44,456 INFO L93 Difference]: Finished difference Result 716 states and 891 transitions. [2021-11-06 09:48:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 09:48:44,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2021-11-06 09:48:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:48:44,468 INFO L225 Difference]: With dead ends: 716 [2021-11-06 09:48:44,468 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:48:44,469 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 09:48:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:48:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:48:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.2861189801699717) internal successors, (454), 365 states have internal predecessors, (454), 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-06 09:48:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 454 transitions. [2021-11-06 09:48:44,491 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 454 transitions. Word has length 53 [2021-11-06 09:48:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:48:44,491 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 454 transitions. [2021-11-06 09:48:44,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06 09:48:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 454 transitions. [2021-11-06 09:48:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 09:48:44,493 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:44,493 INFO L513 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] [2021-11-06 09:48:44,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-06 09:48:44,707 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-06 09:48:44,708 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1457204520, now seen corresponding path program 1 times [2021-11-06 09:48:44,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:48:44,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688729989] [2021-11-06 09:48:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:44,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:48:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:48:44,712 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-06 09:48:44,713 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-06 09:48:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:46,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 09:48:46,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:48:47,074 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-06 09:48:47,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:48:47,296 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-06 09:48:47,296 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:48:47,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688729989] [2021-11-06 09:48:47,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688729989] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:48:47,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:48:47,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 09:48:47,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854307436] [2021-11-06 09:48:47,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 09:48:47,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:48:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 09:48:47,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 09:48:47,298 INFO L87 Difference]: Start difference. First operand 366 states and 454 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06 09:48:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:48:48,100 INFO L93 Difference]: Finished difference Result 700 states and 868 transitions. [2021-11-06 09:48:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 09:48:48,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-06 09:48:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:48:48,102 INFO L225 Difference]: With dead ends: 700 [2021-11-06 09:48:48,102 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:48:48,103 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:48:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:48:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:48:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.2804532577903682) internal successors, (452), 365 states have internal predecessors, (452), 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-06 09:48:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 452 transitions. [2021-11-06 09:48:48,112 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 452 transitions. Word has length 53 [2021-11-06 09:48:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:48:48,113 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 452 transitions. [2021-11-06 09:48:48,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06 09:48:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 452 transitions. [2021-11-06 09:48:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 09:48:48,114 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:48,114 INFO L513 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] [2021-11-06 09:48:48,169 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-06 09:48:48,314 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-06 09:48:48,315 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1402449476, now seen corresponding path program 1 times [2021-11-06 09:48:48,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:48:48,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359036170] [2021-11-06 09:48:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:48,318 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:48:48,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:48:48,319 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-06 09:48:48,320 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-06 09:48:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:50,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 09:48:50,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:48:50,888 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-06 09:48:50,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:48:51,224 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-06 09:48:51,225 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:48:51,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359036170] [2021-11-06 09:48:51,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359036170] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:48:51,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:48:51,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 09:48:51,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748172807] [2021-11-06 09:48:51,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 09:48:51,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:48:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 09:48:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 09:48:51,226 INFO L87 Difference]: Start difference. First operand 366 states and 452 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 09:48:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:48:52,006 INFO L93 Difference]: Finished difference Result 667 states and 824 transitions. [2021-11-06 09:48:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 09:48:52,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2021-11-06 09:48:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:48:52,008 INFO L225 Difference]: With dead ends: 667 [2021-11-06 09:48:52,008 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:48:52,008 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:48:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:48:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:48:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.274787535410765) internal successors, (450), 365 states have internal predecessors, (450), 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-06 09:48:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 450 transitions. [2021-11-06 09:48:52,026 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 450 transitions. Word has length 61 [2021-11-06 09:48:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:48:52,028 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 450 transitions. [2021-11-06 09:48:52,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 09:48:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 450 transitions. [2021-11-06 09:48:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 09:48:52,032 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:52,032 INFO L513 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] [2021-11-06 09:48:52,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 09:48:52,251 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-06 09:48:52,252 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -995056424, now seen corresponding path program 1 times [2021-11-06 09:48:52,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:48:52,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616944988] [2021-11-06 09:48:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:52,255 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:48:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:48:52,257 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-06 09:48:52,258 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-06 09:48:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:54,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 09:48:54,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:48:55,412 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-06 09:48:55,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:48:55,847 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-06 09:48:55,848 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:48:55,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616944988] [2021-11-06 09:48:55,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616944988] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:48:55,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:48:55,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 09:48:55,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570173896] [2021-11-06 09:48:55,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 09:48:55,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:48:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 09:48:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:48:55,849 INFO L87 Difference]: Start difference. First operand 366 states and 450 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-06 09:48:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:48:56,986 INFO L93 Difference]: Finished difference Result 643 states and 792 transitions. [2021-11-06 09:48:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 09:48:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2021-11-06 09:48:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:48:56,988 INFO L225 Difference]: With dead ends: 643 [2021-11-06 09:48:56,989 INFO L226 Difference]: Without dead ends: 366 [2021-11-06 09:48:56,989 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 09:48:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-06 09:48:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-06 09:48:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 353 states have (on average 1.2606232294617563) internal successors, (445), 365 states have internal predecessors, (445), 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-06 09:48:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 445 transitions. [2021-11-06 09:48:56,998 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 445 transitions. Word has length 69 [2021-11-06 09:48:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:48:56,998 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 445 transitions. [2021-11-06 09:48:56,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-06 09:48:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 445 transitions. [2021-11-06 09:48:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 09:48:57,003 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:48:57,003 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 09:48:57,047 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-06 09:48:57,216 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-06 09:48:57,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:48:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:48:57,217 INFO L85 PathProgramCache]: Analyzing trace with hash 995676554, now seen corresponding path program 1 times [2021-11-06 09:48:57,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:48:57,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28553353] [2021-11-06 09:48:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:48:57,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:48:57,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:48:57,221 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-06 09:48:57,222 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-06 09:48:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:48:59,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 09:48:59,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:49:00,118 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-06 09:49:00,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:49:00,268 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-06 09:49:00,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:49:00,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28553353] [2021-11-06 09:49:00,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28553353] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:49:00,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:49:00,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 09:49:00,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906719589] [2021-11-06 09:49:00,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 09:49:00,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:49:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 09:49:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 09:49:00,270 INFO L87 Difference]: Start difference. First operand 366 states and 445 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:49:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:49:01,141 INFO L93 Difference]: Finished difference Result 771 states and 950 transitions. [2021-11-06 09:49:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 09:49:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 09:49:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:49:01,144 INFO L225 Difference]: With dead ends: 771 [2021-11-06 09:49:01,144 INFO L226 Difference]: Without dead ends: 436 [2021-11-06 09:49:01,145 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:49:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-11-06 09:49:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 394. [2021-11-06 09:49:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 381 states have (on average 1.2414698162729658) internal successors, (473), 393 states have internal predecessors, (473), 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-06 09:49:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 473 transitions. [2021-11-06 09:49:01,155 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 473 transitions. Word has length 81 [2021-11-06 09:49:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:49:01,156 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 473 transitions. [2021-11-06 09:49:01,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:49:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 473 transitions. [2021-11-06 09:49:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 09:49:01,158 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:49:01,158 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 09:49:01,202 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-06 09:49:01,375 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-06 09:49:01,376 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:49:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:49:01,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1129690060, now seen corresponding path program 1 times [2021-11-06 09:49:01,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:49:01,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592889139] [2021-11-06 09:49:01,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:49:01,379 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:49:01,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:49:01,389 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-06 09:49:01,390 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-06 09:49:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:49:04,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 09:49:04,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:49:04,578 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-06 09:49:04,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:49:04,994 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-06 09:49:04,994 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:49:04,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592889139] [2021-11-06 09:49:04,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592889139] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:49:04,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:49:04,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 09:49:04,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325549157] [2021-11-06 09:49:04,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 09:49:04,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:49:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 09:49:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:49:05,000 INFO L87 Difference]: Start difference. First operand 394 states and 473 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:49:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:49:06,097 INFO L93 Difference]: Finished difference Result 675 states and 810 transitions. [2021-11-06 09:49:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 09:49:06,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 09:49:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:49:06,099 INFO L225 Difference]: With dead ends: 675 [2021-11-06 09:49:06,104 INFO L226 Difference]: Without dead ends: 394 [2021-11-06 09:49:06,106 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 09:49:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-06 09:49:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2021-11-06 09:49:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 381 states have (on average 1.2283464566929134) internal successors, (468), 393 states have internal predecessors, (468), 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-06 09:49:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 468 transitions. [2021-11-06 09:49:06,120 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 468 transitions. Word has length 81 [2021-11-06 09:49:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:49:06,120 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 468 transitions. [2021-11-06 09:49:06,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 09:49:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 468 transitions. [2021-11-06 09:49:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 09:49:06,125 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:49:06,125 INFO L513 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] [2021-11-06 09:49:06,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-06 09:49:06,351 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-06 09:49:06,351 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:49:06,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:49:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash 224097512, now seen corresponding path program 1 times [2021-11-06 09:49:06,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:49:06,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906048935] [2021-11-06 09:49:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:49:06,355 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:49:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:49:06,359 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-06 09:49:06,383 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-06 09:49:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:49:09,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 09:49:09,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:49:09,542 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-06 09:49:09,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:49:09,743 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-06 09:49:09,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:49:09,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906048935] [2021-11-06 09:49:09,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906048935] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:49:09,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:49:09,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 09:49:09,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583951039] [2021-11-06 09:49:09,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 09:49:09,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:49:09,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 09:49:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 09:49:09,745 INFO L87 Difference]: Start difference. First operand 394 states and 468 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-06 09:49:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:49:10,200 INFO L93 Difference]: Finished difference Result 872 states and 1039 transitions. [2021-11-06 09:49:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 09:49:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 89 [2021-11-06 09:49:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:49:10,203 INFO L225 Difference]: With dead ends: 872 [2021-11-06 09:49:10,203 INFO L226 Difference]: Without dead ends: 820 [2021-11-06 09:49:10,203 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-06 09:49:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-11-06 09:49:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 396. [2021-11-06 09:49:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 383 states have (on average 1.227154046997389) internal successors, (470), 395 states have internal predecessors, (470), 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-06 09:49:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 470 transitions. [2021-11-06 09:49:10,217 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 470 transitions. Word has length 89 [2021-11-06 09:49:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:49:10,218 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 470 transitions. [2021-11-06 09:49:10,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-06 09:49:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 470 transitions. [2021-11-06 09:49:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 09:49:10,219 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:49:10,219 INFO L513 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] [2021-11-06 09:49:10,269 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-06 09:49:10,435 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-06 09:49:10,435 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:49:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:49:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 923773556, now seen corresponding path program 1 times [2021-11-06 09:49:10,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:49:10,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282251170] [2021-11-06 09:49:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:49:10,439 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:49:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:49:10,440 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-06 09:49:10,441 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-06 09:49:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:49:13,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 1713 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 09:49:13,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:49:13,657 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-06 09:49:13,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:49:13,863 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-06 09:49:13,863 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:49:13,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282251170] [2021-11-06 09:49:13,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282251170] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:49:13,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:49:13,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 09:49:13,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251506367] [2021-11-06 09:49:13,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 09:49:13,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:49:13,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 09:49:13,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 09:49:13,865 INFO L87 Difference]: Start difference. First operand 396 states and 470 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 09:49:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 09:49:14,949 INFO L93 Difference]: Finished difference Result 797 states and 942 transitions. [2021-11-06 09:49:14,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 09:49:14,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2021-11-06 09:49:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 09:49:14,952 INFO L225 Difference]: With dead ends: 797 [2021-11-06 09:49:14,952 INFO L226 Difference]: Without dead ends: 711 [2021-11-06 09:49:14,953 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 09:49:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-11-06 09:49:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 399. [2021-11-06 09:49:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 386 states have (on average 1.2253886010362693) internal successors, (473), 398 states have internal predecessors, (473), 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-06 09:49:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 473 transitions. [2021-11-06 09:49:14,965 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 473 transitions. Word has length 93 [2021-11-06 09:49:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 09:49:14,965 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 473 transitions. [2021-11-06 09:49:14,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 09:49:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 473 transitions. [2021-11-06 09:49:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 09:49:14,966 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 09:49:14,966 INFO L513 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] [2021-11-06 09:49:15,016 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-06 09:49:15,179 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-06 09:49:15,179 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 09:49:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 09:49:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1070736296, now seen corresponding path program 1 times [2021-11-06 09:49:15,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 09:49:15,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922661985] [2021-11-06 09:49:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 09:49:15,182 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 09:49:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 09:49:15,183 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-06 09:49:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 09:50:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 09:50:55,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 09:50:55,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 09:50:55,726 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-06 09:50:55,726 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 21 treesize of output 23 [2021-11-06 09:50:56,334 INFO L354 Elim1Store]: treesize reduction 97, result has 25.4 percent of original size [2021-11-06 09:50:56,335 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 46 treesize of output 66 [2021-11-06 09:50:58,158 INFO L354 Elim1Store]: treesize reduction 69, result has 29.6 percent of original size [2021-11-06 09:50:58,159 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 65 treesize of output 84 [2021-11-06 09:51:01,140 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-06 09:51:01,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2021-11-06 09:51:01,184 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-06 09:51:01,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 93 [2021-11-06 09:51:02,116 INFO L354 Elim1Store]: treesize reduction 60, result has 25.9 percent of original size [2021-11-06 09:51:02,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 103 [2021-11-06 09:51:02,340 INFO L354 Elim1Store]: treesize reduction 105, result has 7.9 percent of original size [2021-11-06 09:51:02,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 52 [2021-11-06 09:51:02,392 INFO L354 Elim1Store]: treesize reduction 105, result has 7.9 percent of original size [2021-11-06 09:51:02,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 26 [2021-11-06 09:51:02,968 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-06 09:51:02,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 09:51:05,618 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_mul_u64_checked_~r.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_mul_u64_checked_~r.base) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4)) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|)))) (forall ((ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_aws_mul_u64_checked_~r.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_aws_mul_u64_checked_~r.base) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2)) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))))) is different from false [2021-11-06 09:51:37,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base| (_ bv0 1)) |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))) (and (forall ((|ULTIMATE.start_can_fail_allocator_#res.base| (_ BitVec 64)) (ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.base|)))) (store .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|)))) (forall ((ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (|ULTIMATE.start_can_fail_allocator_#res.offset| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.offset|)))) (store .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))))))) is different from false [2021-11-06 09:51:42,745 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 09:51:42,745 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 483 treesize of output 480 [2021-11-06 09:51:42,806 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 09:51:42,806 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 856 treesize of output 853 [2021-11-06 09:52:04,555 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-06 09:52:04,555 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 09:52:04,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922661985] [2021-11-06 09:52:04,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922661985] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 09:52:04,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 09:52:04,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 25 [2021-11-06 09:52:04,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834039721] [2021-11-06 09:52:04,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-06 09:52:04,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 09:52:04,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-06 09:52:04,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=407, Unknown=17, NotChecked=86, Total=600 [2021-11-06 09:52:04,557 INFO L87 Difference]: Start difference. First operand 399 states and 473 transitions. Second operand has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 states have internal predecessors, (140), 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-06 09:52:26,449 WARN L207 SmtUtils]: Spent 6.55 s on a formula simplification that was a NOOP. DAG size: 102 [2021-11-06 09:52:28,543 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))) (let ((.cse2 (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) .cse7))) (.cse1 (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) .cse7)))) (let ((.cse0 (or (not .cse2) (not .cse1)))) (and (or (and (not |c_ULTIMATE.start_aws_array_list_is_valid_#t~short134|) .cse0) (and |c_ULTIMATE.start_aws_array_list_is_valid_#t~short134| .cse1 .cse2)) .cse1 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_75| (_ BitVec 64))) (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_75|))) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| |c_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base|)) (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base| c_ULTIMATE.start_aws_array_list_is_valid_~list.base) (or (and |c_ULTIMATE.start_aws_array_list_is_valid_#t~short138| .cse1 .cse2) (and .cse0 (not |c_ULTIMATE.start_aws_array_list_is_valid_#t~short138|))) (exists ((v_arrayElimCell_4 (_ BitVec 1))) (let ((.cse3 (bvneg v_arrayElimCell_4))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|))) (bvneg (bvneg .cse3)))) (= (_ bv0 1) (bvadd .cse3 (_ bv1 1)))))) .cse2 (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base|)))) (= c_ULTIMATE.start_aws_array_list_is_valid_~list.offset |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|) (= (_ bv0 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|) (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base| (_ bv0 1)) |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))) (and (forall ((|ULTIMATE.start_can_fail_allocator_#res.base| (_ BitVec 64)) (ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.base|)))) (store .cse4 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse4 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|)))) (forall ((ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (|ULTIMATE.start_can_fail_allocator_#res.offset| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.offset|)))) (store .cse5 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse5 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))))))) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base| |c_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base|)) (exists ((v_arrayElimCell_2 (_ BitVec 1))) (let ((.cse6 (bvneg (bvneg v_arrayElimCell_2)))) (and (= (_ bv0 1) (bvadd .cse6 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse6 (bvneg (select |c_#valid| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|))))))))))) is different from false [2021-11-06 09:53:44,316 WARN L207 SmtUtils]: Spent 24.96 s on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2021-11-06 09:54:36,332 WARN L207 SmtUtils]: Spent 33.81 s on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2021-11-06 09:55:20,310 WARN L207 SmtUtils]: Spent 23.37 s on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2021-11-06 09:56:26,551 WARN L207 SmtUtils]: Spent 13.28 s on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-11-06 09:57:01,514 WARN L207 SmtUtils]: Spent 6.82 s on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2021-11-06 09:57:50,935 WARN L207 SmtUtils]: Spent 23.35 s on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2021-11-06 09:57:53,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) .cse0)) (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64))) (or (and (forall ((|ULTIMATE.start_can_fail_allocator_#res.base| (_ BitVec 64)) (ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.base|)))) (store .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|)))) (forall ((ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (|ULTIMATE.start_can_fail_allocator_#res.offset| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.offset|)))) (store .cse2 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse2 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))))) (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64))) (or (and (forall ((ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2)) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|)))) (forall ((v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4)) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))))) (or (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (_ BitVec 64))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base| (_ bv0 1)) |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|))) (and (forall ((|ULTIMATE.start_can_fail_allocator_#res.base| (_ BitVec 64)) (ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.base|)))) (store .cse3 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse3 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|)))) (forall ((ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset (_ BitVec 64)) (|ULTIMATE.start_can_fail_allocator_#res.offset| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|) ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_can_fail_allocator_#res.offset|)))) (store .cse4 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126| (store (store (select .cse4 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_126|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_2))) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))))))) (not |c_ULTIMATE.start_aws_array_list_is_valid_#t~short138|)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|) .cse0)) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0.base|))) (_ bv1 1))) (= (_ bv0 64) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0.offset|))) is different from false [2021-11-06 09:58:40,218 WARN L207 SmtUtils]: Spent 6.47 s on a formula simplification that was a NOOP. DAG size: 71 [2021-11-06 09:59:38,400 WARN L207 SmtUtils]: Spent 14.72 s on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2021-11-06 09:59:48,514 WARN L207 SmtUtils]: Spent 6.39 s on a formula simplification that was a NOOP. DAG size: 58 [2021-11-06 10:00:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:00:27,091 INFO L93 Difference]: Finished difference Result 831 states and 991 transitions. [2021-11-06 10:00:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 10:00:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 states have internal predecessors, (140), 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 95 [2021-11-06 10:00:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:00:27,100 INFO L225 Difference]: With dead ends: 831 [2021-11-06 10:00:27,100 INFO L226 Difference]: Without dead ends: 474 [2021-11-06 10:00:27,101 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 463.1s TimeCoverageRelationStatistics Valid=340, Invalid=1374, Unknown=108, NotChecked=340, Total=2162 [2021-11-06 10:00:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-06 10:00:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 418. [2021-11-06 10:00:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 405 states have (on average 1.219753086419753) internal successors, (494), 417 states have internal predecessors, (494), 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-06 10:00:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 494 transitions. [2021-11-06 10:00:27,114 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 494 transitions. Word has length 95 [2021-11-06 10:00:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:00:27,114 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 494 transitions. [2021-11-06 10:00:27,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 states have internal predecessors, (140), 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-06 10:00:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 494 transitions. [2021-11-06 10:00:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 10:00:27,115 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:00:27,115 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:00:27,339 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forcibly destroying the process [2021-11-06 10:00:27,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 10:00:27,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 10:00:27,381 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-11-06 10:00:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:00:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 753998706, now seen corresponding path program 1 times [2021-11-06 10:00:27,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 10:00:27,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291647216] [2021-11-06 10:00:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:00:27,384 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 10:00:27,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 10:00:27,385 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 10:00:27,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process Killed by 15