./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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_byte_buf_clean_up_secure_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 7719978bfc1f77f49d95653387fa626de3af0dc7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 15:10:27,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 15:10:27,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 15:10:27,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 15:10:27,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 15:10:27,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 15:10:27,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 15:10:27,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 15:10:27,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 15:10:27,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 15:10:27,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 15:10:27,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 15:10:27,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 15:10:27,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 15:10:27,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 15:10:27,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 15:10:27,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 15:10:27,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 15:10:27,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 15:10:27,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 15:10:27,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 15:10:27,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 15:10:27,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 15:10:27,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 15:10:27,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 15:10:27,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 15:10:27,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 15:10:27,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 15:10:27,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 15:10:27,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 15:10:27,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 15:10:27,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 15:10:27,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 15:10:27,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 15:10:27,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 15:10:27,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 15:10:27,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 15:10:27,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 15:10:27,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 15:10:27,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 15:10:27,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 15:10:27,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-08-26 15:10:27,647 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 15:10:27,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 15:10:27,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 15:10:27,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 15:10:27,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 15:10:27,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 15:10:27,650 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 15:10:27,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 15:10:27,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 15:10:27,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 15:10:27,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 15:10:27,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 15:10:27,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 15:10:27,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 15:10:27,652 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 15:10:27,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 15:10:27,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 15:10:27,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 15:10:27,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 15:10:27,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 15:10:27,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 15:10:27,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 15:10:27,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 15:10:27,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 15:10:27,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 15:10:27,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 15:10:27,654 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 15:10:27,654 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 -> 7719978bfc1f77f49d95653387fa626de3af0dc7 [2021-08-26 15:10:27,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 15:10:27,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 15:10:27,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 15:10:27,970 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 15:10:27,971 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 15:10:27,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i [2021-08-26 15:10:28,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a658a7de7/0c648541f59a4ed99288044545872276/FLAGbd71ca935 [2021-08-26 15:10:28,664 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 15:10:28,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i [2021-08-26 15:10:28,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a658a7de7/0c648541f59a4ed99288044545872276/FLAGbd71ca935 [2021-08-26 15:10:28,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a658a7de7/0c648541f59a4ed99288044545872276 [2021-08-26 15:10:28,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 15:10:28,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 15:10:28,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 15:10:28,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 15:10:28,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 15:10:28,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:28" (1/1) ... [2021-08-26 15:10:28,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7399b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:28, skipping insertion in model container [2021-08-26 15:10:28,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:28" (1/1) ... [2021-08-26 15:10:28,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 15:10:28,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 15:10:29,100 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_byte_buf_clean_up_secure_harness.i[4502,4515] [2021-08-26 15:10:29,104 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_byte_buf_clean_up_secure_harness.i[4562,4575] [2021-08-26 15:10:29,117 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-08-26 15:10:29,126 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-08-26 15:10:29,581 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,582 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,582 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,582 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,583 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,609 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,610 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,611 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,611 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,612 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,619 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,620 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,620 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,800 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-08-26 15:10:29,801 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-08-26 15:10:29,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-08-26 15:10:29,803 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-08-26 15:10:29,804 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-08-26 15:10:29,804 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-08-26 15:10:29,805 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-08-26 15:10:29,805 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-08-26 15:10:29,805 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-08-26 15:10:29,806 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-08-26 15:10:29,883 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-08-26 15:10:29,936 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,936 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:29,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 15:10:29,988 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 15:10:29,996 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_byte_buf_clean_up_secure_harness.i[4502,4515] [2021-08-26 15:10:29,997 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_byte_buf_clean_up_secure_harness.i[4562,4575] [2021-08-26 15:10:29,998 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-08-26 15:10:29,998 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-08-26 15:10:30,036 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,037 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,038 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,039 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,039 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,045 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,046 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,051 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,051 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,052 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,054 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,055 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,055 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,087 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-08-26 15:10:30,090 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-08-26 15:10:30,090 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-08-26 15:10:30,091 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-08-26 15:10:30,091 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-08-26 15:10:30,092 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-08-26 15:10:30,092 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-08-26 15:10:30,092 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-08-26 15:10:30,092 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-08-26 15:10:30,093 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-08-26 15:10:30,151 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-08-26 15:10:30,249 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,250 WARN L1507 CHandler]: Possible shadowing of function index [2021-08-26 15:10:30,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 15:10:30,456 INFO L208 MainTranslator]: Completed translation [2021-08-26 15:10:30,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30 WrapperNode [2021-08-26 15:10:30,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 15:10:30,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 15:10:30,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 15:10:30,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 15:10:30,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 15:10:30,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 15:10:30,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 15:10:30,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 15:10:30,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 15:10:30,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 15:10:30,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 15:10:30,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 15:10:30,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (1/1) ... [2021-08-26 15:10:30,892 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 15:10:30,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 15:10:30,908 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-08-26 15:10:30,929 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-08-26 15:10:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 15:10:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 15:10:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-26 15:10:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 15:10:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 15:10:30,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 15:10:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 15:10:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-26 15:10:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-26 15:10:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 15:10:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 15:10:38,904 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 15:10:38,911 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-08-26 15:10:38,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:38 BoogieIcfgContainer [2021-08-26 15:10:38,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 15:10:38,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 15:10:38,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 15:10:38,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 15:10:38,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:10:28" (1/3) ... [2021-08-26 15:10:38,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4011db04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:38, skipping insertion in model container [2021-08-26 15:10:38,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:30" (2/3) ... [2021-08-26 15:10:38,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4011db04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:38, skipping insertion in model container [2021-08-26 15:10:38,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:38" (3/3) ... [2021-08-26 15:10:38,929 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_clean_up_secure_harness.i [2021-08-26 15:10:38,950 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 15:10:38,950 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-08-26 15:10:39,012 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 15:10:39,021 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 15:10:39,026 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-26 15:10:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 154 states have (on average 1.4610389610389611) internal successors, (225), 160 states have internal predecessors, (225), 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-08-26 15:10:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 15:10:39,074 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:39,075 INFO L512 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] [2021-08-26 15:10:39,076 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1283718026, now seen corresponding path program 1 times [2021-08-26 15:10:39,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:39,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293227032] [2021-08-26 15:10:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:39,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:39,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:39,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293227032] [2021-08-26 15:10:39,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293227032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:39,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:39,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 15:10:39,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691408361] [2021-08-26 15:10:39,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 15:10:39,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 15:10:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 15:10:39,665 INFO L87 Difference]: Start difference. First operand has 161 states, 154 states have (on average 1.4610389610389611) internal successors, (225), 160 states have internal predecessors, (225), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-08-26 15:10:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:10:39,682 INFO L93 Difference]: Finished difference Result 318 states and 445 transitions. [2021-08-26 15:10:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 15:10:39,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2021-08-26 15:10:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:10:39,689 INFO L225 Difference]: With dead ends: 318 [2021-08-26 15:10:39,689 INFO L226 Difference]: Without dead ends: 156 [2021-08-26 15:10:39,691 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 15:10:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-26 15:10:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-08-26 15:10:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 150 states have (on average 1.36) internal successors, (204), 155 states have internal predecessors, (204), 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-08-26 15:10:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 204 transitions. [2021-08-26 15:10:39,717 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 204 transitions. Word has length 34 [2021-08-26 15:10:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:10:39,717 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 204 transitions. [2021-08-26 15:10:39,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-08-26 15:10:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 204 transitions. [2021-08-26 15:10:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 15:10:39,719 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:39,719 INFO L512 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] [2021-08-26 15:10:39,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 15:10:39,719 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash 27354892, now seen corresponding path program 1 times [2021-08-26 15:10:39,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:39,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160279239] [2021-08-26 15:10:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:39,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:40,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:40,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160279239] [2021-08-26 15:10:40,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160279239] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:40,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:40,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 15:10:40,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43849633] [2021-08-26 15:10:40,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 15:10:40,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 15:10:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 15:10:40,042 INFO L87 Difference]: Start difference. First operand 156 states and 204 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-08-26 15:10:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:10:40,252 INFO L93 Difference]: Finished difference Result 286 states and 374 transitions. [2021-08-26 15:10:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 15:10:40,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2021-08-26 15:10:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:10:40,254 INFO L225 Difference]: With dead ends: 286 [2021-08-26 15:10:40,254 INFO L226 Difference]: Without dead ends: 156 [2021-08-26 15:10:40,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 15:10:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-26 15:10:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-08-26 15:10:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 155 states have internal predecessors, (202), 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-08-26 15:10:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2021-08-26 15:10:40,261 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 34 [2021-08-26 15:10:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:10:40,262 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2021-08-26 15:10:40,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-08-26 15:10:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2021-08-26 15:10:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 15:10:40,263 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:40,263 INFO L512 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] [2021-08-26 15:10:40,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 15:10:40,263 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:40,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2136977490, now seen corresponding path program 1 times [2021-08-26 15:10:40,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:40,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820323220] [2021-08-26 15:10:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:40,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:40,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:40,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820323220] [2021-08-26 15:10:40,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820323220] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:40,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:40,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 15:10:40,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197311837] [2021-08-26 15:10:40,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 15:10:40,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 15:10:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 15:10:40,497 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08-26 15:10:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:10:41,040 INFO L93 Difference]: Finished difference Result 347 states and 456 transitions. [2021-08-26 15:10:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 15:10:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2021-08-26 15:10:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:10:41,042 INFO L225 Difference]: With dead ends: 347 [2021-08-26 15:10:41,042 INFO L226 Difference]: Without dead ends: 216 [2021-08-26 15:10:41,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 15:10:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-26 15:10:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 168. [2021-08-26 15:10:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 167 states have internal predecessors, (214), 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-08-26 15:10:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 214 transitions. [2021-08-26 15:10:41,058 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 214 transitions. Word has length 46 [2021-08-26 15:10:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:10:41,058 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 214 transitions. [2021-08-26 15:10:41,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08-26 15:10:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 214 transitions. [2021-08-26 15:10:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 15:10:41,061 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:41,061 INFO L512 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] [2021-08-26 15:10:41,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 15:10:41,061 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1456389932, now seen corresponding path program 1 times [2021-08-26 15:10:41,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:41,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062660941] [2021-08-26 15:10:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:41,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:41,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:41,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062660941] [2021-08-26 15:10:41,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062660941] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:41,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:41,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 15:10:41,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991735459] [2021-08-26 15:10:41,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 15:10:41,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:41,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 15:10:41,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-26 15:10:41,396 INFO L87 Difference]: Start difference. First operand 168 states and 214 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-08-26 15:10:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:10:41,629 INFO L93 Difference]: Finished difference Result 270 states and 342 transitions. [2021-08-26 15:10:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 15:10:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 46 [2021-08-26 15:10:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:10:41,630 INFO L225 Difference]: With dead ends: 270 [2021-08-26 15:10:41,630 INFO L226 Difference]: Without dead ends: 168 [2021-08-26 15:10:41,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 203.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-08-26 15:10:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-26 15:10:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-08-26 15:10:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 167 states have internal predecessors, (211), 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-08-26 15:10:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 211 transitions. [2021-08-26 15:10:41,636 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 211 transitions. Word has length 46 [2021-08-26 15:10:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:10:41,636 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 211 transitions. [2021-08-26 15:10:41,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-08-26 15:10:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 211 transitions. [2021-08-26 15:10:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-26 15:10:41,637 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:41,637 INFO L512 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] [2021-08-26 15:10:41,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 15:10:41,638 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash 921784791, now seen corresponding path program 1 times [2021-08-26 15:10:41,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:41,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18892880] [2021-08-26 15:10:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:41,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:42,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:42,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18892880] [2021-08-26 15:10:42,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18892880] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:42,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:42,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 15:10:42,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373860735] [2021-08-26 15:10:42,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 15:10:42,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 15:10:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-26 15:10:42,004 INFO L87 Difference]: Start difference. First operand 168 states and 211 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-08-26 15:10:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:10:42,422 INFO L93 Difference]: Finished difference Result 241 states and 298 transitions. [2021-08-26 15:10:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 15:10:42,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2021-08-26 15:10:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:10:42,424 INFO L225 Difference]: With dead ends: 241 [2021-08-26 15:10:42,424 INFO L226 Difference]: Without dead ends: 168 [2021-08-26 15:10:42,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 363.4ms TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-08-26 15:10:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-26 15:10:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-08-26 15:10:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 167 states have internal predecessors, (210), 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-08-26 15:10:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 210 transitions. [2021-08-26 15:10:42,429 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 210 transitions. Word has length 52 [2021-08-26 15:10:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:10:42,429 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 210 transitions. [2021-08-26 15:10:42,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-08-26 15:10:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 210 transitions. [2021-08-26 15:10:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-26 15:10:42,430 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:42,430 INFO L512 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] [2021-08-26 15:10:42,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 15:10:42,430 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1091747988, now seen corresponding path program 1 times [2021-08-26 15:10:42,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:42,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993291620] [2021-08-26 15:10:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:42,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:42,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:42,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993291620] [2021-08-26 15:10:42,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993291620] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:42,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:42,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 15:10:42,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841836120] [2021-08-26 15:10:42,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 15:10:42,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 15:10:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 15:10:42,874 INFO L87 Difference]: Start difference. First operand 168 states and 210 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-08-26 15:10:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:10:43,567 INFO L93 Difference]: Finished difference Result 303 states and 368 transitions. [2021-08-26 15:10:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 15:10:43,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 58 [2021-08-26 15:10:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:10:43,569 INFO L225 Difference]: With dead ends: 303 [2021-08-26 15:10:43,569 INFO L226 Difference]: Without dead ends: 299 [2021-08-26 15:10:43,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 258.0ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-26 15:10:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-26 15:10:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 176. [2021-08-26 15:10:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 175 states have internal predecessors, (218), 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-08-26 15:10:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 218 transitions. [2021-08-26 15:10:43,575 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 218 transitions. Word has length 58 [2021-08-26 15:10:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:10:43,575 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 218 transitions. [2021-08-26 15:10:43,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-08-26 15:10:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 218 transitions. [2021-08-26 15:10:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-26 15:10:43,576 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:43,576 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:10:43,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 15:10:43,577 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 948784038, now seen corresponding path program 1 times [2021-08-26 15:10:43,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:43,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841720180] [2021-08-26 15:10:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:43,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:45,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:45,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841720180] [2021-08-26 15:10:45,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841720180] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:45,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:45,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 15:10:45,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535673250] [2021-08-26 15:10:45,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 15:10:45,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 15:10:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-26 15:10:45,903 INFO L87 Difference]: Start difference. First operand 176 states and 218 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:10:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:10:51,536 INFO L93 Difference]: Finished difference Result 363 states and 453 transitions. [2021-08-26 15:10:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 15:10:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-26 15:10:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:10:51,537 INFO L225 Difference]: With dead ends: 363 [2021-08-26 15:10:51,537 INFO L226 Difference]: Without dead ends: 214 [2021-08-26 15:10:51,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 763.8ms TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2021-08-26 15:10:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-08-26 15:10:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 172. [2021-08-26 15:10:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 166 states have (on average 1.2771084337349397) internal successors, (212), 171 states have internal predecessors, (212), 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-08-26 15:10:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2021-08-26 15:10:51,544 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 62 [2021-08-26 15:10:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:10:51,544 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2021-08-26 15:10:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:10:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2021-08-26 15:10:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-26 15:10:51,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:10:51,545 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:10:51,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 15:10:51,546 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:10:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:10:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1716080936, now seen corresponding path program 1 times [2021-08-26 15:10:51,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:10:51,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311891388] [2021-08-26 15:10:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:10:51,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:10:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:10:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:10:52,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:10:52,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311891388] [2021-08-26 15:10:52,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311891388] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:10:52,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:10:52,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 15:10:52,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460084296] [2021-08-26 15:10:52,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 15:10:52,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:10:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 15:10:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-26 15:10:52,358 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:11:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:11:03,823 INFO L93 Difference]: Finished difference Result 519 states and 659 transitions. [2021-08-26 15:11:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 15:11:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-08-26 15:11:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:11:03,824 INFO L225 Difference]: With dead ends: 519 [2021-08-26 15:11:03,825 INFO L226 Difference]: Without dead ends: 364 [2021-08-26 15:11:03,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 785.7ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-08-26 15:11:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-08-26 15:11:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 199. [2021-08-26 15:11:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 193 states have (on average 1.2590673575129534) internal successors, (243), 198 states have internal predecessors, (243), 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-08-26 15:11:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 243 transitions. [2021-08-26 15:11:03,831 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 243 transitions. Word has length 70 [2021-08-26 15:11:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:11:03,832 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 243 transitions. [2021-08-26 15:11:03,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:11:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 243 transitions. [2021-08-26 15:11:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-26 15:11:03,836 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:11:03,836 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:11:03,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 15:11:03,836 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:11:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:11:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash 344273638, now seen corresponding path program 1 times [2021-08-26 15:11:03,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:11:03,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723664516] [2021-08-26 15:11:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:11:03,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:11:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:11:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:11:04,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:11:04,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723664516] [2021-08-26 15:11:04,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723664516] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:11:04,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:11:04,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 15:11:04,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040477522] [2021-08-26 15:11:04,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 15:11:04,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:11:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 15:11:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 15:11:04,327 INFO L87 Difference]: Start difference. First operand 199 states and 243 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:11:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:11:05,047 INFO L93 Difference]: Finished difference Result 413 states and 491 transitions. [2021-08-26 15:11:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 15:11:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-08-26 15:11:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:11:05,048 INFO L225 Difference]: With dead ends: 413 [2021-08-26 15:11:05,048 INFO L226 Difference]: Without dead ends: 232 [2021-08-26 15:11:05,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 188.4ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-26 15:11:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-08-26 15:11:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 199. [2021-08-26 15:11:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 193 states have (on average 1.233160621761658) internal successors, (238), 198 states have internal predecessors, (238), 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-08-26 15:11:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2021-08-26 15:11:05,054 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 70 [2021-08-26 15:11:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:11:05,054 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2021-08-26 15:11:05,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:11:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2021-08-26 15:11:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-26 15:11:05,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:11:05,055 INFO L512 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] [2021-08-26 15:11:05,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 15:11:05,056 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:11:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:11:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1089836156, now seen corresponding path program 1 times [2021-08-26 15:11:05,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:11:05,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33094139] [2021-08-26 15:11:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:11:05,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:11:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:11:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:11:05,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:11:05,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33094139] [2021-08-26 15:11:05,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33094139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:11:05,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:11:05,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 15:11:05,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81109499] [2021-08-26 15:11:05,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 15:11:05,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:11:05,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 15:11:05,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 15:11:05,693 INFO L87 Difference]: Start difference. First operand 199 states and 238 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-08-26 15:11:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:11:16,903 INFO L93 Difference]: Finished difference Result 517 states and 612 transitions. [2021-08-26 15:11:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 15:11:16,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 74 [2021-08-26 15:11:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:11:16,906 INFO L225 Difference]: With dead ends: 517 [2021-08-26 15:11:16,906 INFO L226 Difference]: Without dead ends: 311 [2021-08-26 15:11:16,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 851.7ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-08-26 15:11:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-26 15:11:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 194. [2021-08-26 15:11:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 188 states have (on average 1.1914893617021276) internal successors, (224), 193 states have internal predecessors, (224), 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-08-26 15:11:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2021-08-26 15:11:16,911 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 74 [2021-08-26 15:11:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:11:16,911 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2021-08-26 15:11:16,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-08-26 15:11:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2021-08-26 15:11:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-26 15:11:16,911 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:11:16,912 INFO L512 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] [2021-08-26 15:11:16,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 15:11:16,912 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:11:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:11:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1898682428, now seen corresponding path program 1 times [2021-08-26 15:11:16,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:11:16,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747520445] [2021-08-26 15:11:16,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:11:16,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:11:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:11:17,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-08-26 15:11:17,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:11:17,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747520445] [2021-08-26 15:11:17,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747520445] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:11:17,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:11:17,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 15:11:17,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470717805] [2021-08-26 15:11:17,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 15:11:17,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:11:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 15:11:17,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 15:11:17,394 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08-26 15:11:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:11:20,281 INFO L93 Difference]: Finished difference Result 447 states and 512 transitions. [2021-08-26 15:11:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 15:11:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2021-08-26 15:11:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:11:20,283 INFO L225 Difference]: With dead ends: 447 [2021-08-26 15:11:20,283 INFO L226 Difference]: Without dead ends: 263 [2021-08-26 15:11:20,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 158.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 15:11:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-26 15:11:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 190. [2021-08-26 15:11:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 184 states have (on average 1.1630434782608696) internal successors, (214), 189 states have internal predecessors, (214), 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-08-26 15:11:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2021-08-26 15:11:20,288 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 74 [2021-08-26 15:11:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:11:20,288 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2021-08-26 15:11:20,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08-26 15:11:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2021-08-26 15:11:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-26 15:11:20,288 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:11:20,288 INFO L512 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] [2021-08-26 15:11:20,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 15:11:20,289 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:11:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:11:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1177649340, now seen corresponding path program 1 times [2021-08-26 15:11:20,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:11:20,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20051899] [2021-08-26 15:11:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:11:20,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:11:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:11:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:11:20,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:11:20,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20051899] [2021-08-26 15:11:20,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20051899] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:11:20,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:11:20,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 15:11:20,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466065231] [2021-08-26 15:11:20,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 15:11:20,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:11:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 15:11:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 15:11:20,941 INFO L87 Difference]: Start difference. First operand 190 states and 214 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-08-26 15:11:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:11:30,855 INFO L93 Difference]: Finished difference Result 489 states and 551 transitions. [2021-08-26 15:11:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 15:11:30,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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 74 [2021-08-26 15:11:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:11:30,856 INFO L225 Difference]: With dead ends: 489 [2021-08-26 15:11:30,856 INFO L226 Difference]: Without dead ends: 339 [2021-08-26 15:11:30,857 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 546.4ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-08-26 15:11:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-08-26 15:11:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 207. [2021-08-26 15:11:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 201 states have (on average 1.144278606965174) internal successors, (230), 206 states have internal predecessors, (230), 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-08-26 15:11:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2021-08-26 15:11:30,862 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 74 [2021-08-26 15:11:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:11:30,862 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2021-08-26 15:11:30,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-08-26 15:11:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2021-08-26 15:11:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-26 15:11:30,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:11:30,862 INFO L512 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] [2021-08-26 15:11:30,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 15:11:30,862 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:11:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:11:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash -783282554, now seen corresponding path program 1 times [2021-08-26 15:11:30,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:11:30,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625971060] [2021-08-26 15:11:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:11:30,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:11:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:11:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:11:32,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:11:32,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625971060] [2021-08-26 15:11:32,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625971060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:11:32,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:11:32,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 15:11:32,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468854170] [2021-08-26 15:11:32,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 15:11:32,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:11:32,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 15:11:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 15:11:32,761 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-08-26 15:11:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:11:40,238 INFO L93 Difference]: Finished difference Result 354 states and 396 transitions. [2021-08-26 15:11:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 15:11:40,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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 74 [2021-08-26 15:11:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:11:40,240 INFO L225 Difference]: With dead ends: 354 [2021-08-26 15:11:40,240 INFO L226 Difference]: Without dead ends: 223 [2021-08-26 15:11:40,240 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 759.3ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-08-26 15:11:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-08-26 15:11:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2021-08-26 15:11:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.1421319796954315) internal successors, (225), 202 states have internal predecessors, (225), 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-08-26 15:11:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2021-08-26 15:11:40,244 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 74 [2021-08-26 15:11:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:11:40,244 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2021-08-26 15:11:40,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-08-26 15:11:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2021-08-26 15:11:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-26 15:11:40,245 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:11:40,245 INFO L512 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] [2021-08-26 15:11:40,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 15:11:40,245 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:11:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:11:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1580395081, now seen corresponding path program 1 times [2021-08-26 15:11:40,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:11:40,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446206495] [2021-08-26 15:11:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:11:40,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:11:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:11:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:11:42,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:11:42,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446206495] [2021-08-26 15:11:42,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446206495] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:11:42,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:11:42,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 15:11:42,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367845763] [2021-08-26 15:11:42,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 15:11:42,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:11:42,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 15:11:42,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-26 15:11:42,553 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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-08-26 15:11:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:11:49,587 INFO L93 Difference]: Finished difference Result 385 states and 433 transitions. [2021-08-26 15:11:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 15:11:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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 80 [2021-08-26 15:11:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:11:49,589 INFO L225 Difference]: With dead ends: 385 [2021-08-26 15:11:49,589 INFO L226 Difference]: Without dead ends: 272 [2021-08-26 15:11:49,589 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 460.1ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-08-26 15:11:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-26 15:11:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 203. [2021-08-26 15:11:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.1370558375634519) internal successors, (224), 202 states have internal predecessors, (224), 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-08-26 15:11:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2021-08-26 15:11:49,594 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 80 [2021-08-26 15:11:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:11:49,594 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2021-08-26 15:11:49,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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-08-26 15:11:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2021-08-26 15:11:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-26 15:11:49,594 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:11:49,594 INFO L512 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] [2021-08-26 15:11:49,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 15:11:49,594 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:11:49,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:11:49,595 INFO L82 PathProgramCache]: Analyzing trace with hash 522395916, now seen corresponding path program 1 times [2021-08-26 15:11:49,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:11:49,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816813188] [2021-08-26 15:11:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:11:49,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:11:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:11:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:11:51,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:11:51,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816813188] [2021-08-26 15:11:51,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816813188] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:11:51,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:11:51,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 15:11:51,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067502612] [2021-08-26 15:11:51,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 15:11:51,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:11:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 15:11:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-26 15:11:51,765 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-08-26 15:12:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:12:02,113 INFO L93 Difference]: Finished difference Result 389 states and 436 transitions. [2021-08-26 15:12:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 15:12:02,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 86 [2021-08-26 15:12:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:12:02,115 INFO L225 Difference]: With dead ends: 389 [2021-08-26 15:12:02,115 INFO L226 Difference]: Without dead ends: 272 [2021-08-26 15:12:02,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1033.4ms TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-08-26 15:12:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-26 15:12:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 203. [2021-08-26 15:12:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.131979695431472) internal successors, (223), 202 states have internal predecessors, (223), 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-08-26 15:12:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 223 transitions. [2021-08-26 15:12:02,121 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 223 transitions. Word has length 86 [2021-08-26 15:12:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:12:02,121 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 223 transitions. [2021-08-26 15:12:02,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-08-26 15:12:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 223 transitions. [2021-08-26 15:12:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-26 15:12:02,121 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:12:02,121 INFO L512 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] [2021-08-26 15:12:02,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 15:12:02,122 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:12:02,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:12:02,122 INFO L82 PathProgramCache]: Analyzing trace with hash -604435538, now seen corresponding path program 1 times [2021-08-26 15:12:02,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:12:02,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274445624] [2021-08-26 15:12:02,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:12:02,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:12:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:12:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:12:02,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:12:02,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274445624] [2021-08-26 15:12:02,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274445624] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:12:02,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:12:02,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 15:12:02,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876027896] [2021-08-26 15:12:02,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 15:12:02,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:12:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 15:12:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 15:12:02,551 INFO L87 Difference]: Start difference. First operand 203 states and 223 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-08-26 15:12:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:12:02,576 INFO L93 Difference]: Finished difference Result 322 states and 358 transitions. [2021-08-26 15:12:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 15:12:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 87 [2021-08-26 15:12:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:12:02,577 INFO L225 Difference]: With dead ends: 322 [2021-08-26 15:12:02,577 INFO L226 Difference]: Without dead ends: 205 [2021-08-26 15:12:02,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 15:12:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-08-26 15:12:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2021-08-26 15:12:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.1313131313131313) internal successors, (224), 203 states have internal predecessors, (224), 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-08-26 15:12:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 224 transitions. [2021-08-26 15:12:02,582 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 224 transitions. Word has length 87 [2021-08-26 15:12:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:12:02,582 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 224 transitions. [2021-08-26 15:12:02,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-08-26 15:12:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 224 transitions. [2021-08-26 15:12:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-26 15:12:02,583 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:12:02,583 INFO L512 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-08-26 15:12:02,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 15:12:02,583 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:12:02,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:12:02,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2111945076, now seen corresponding path program 1 times [2021-08-26 15:12:02,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:12:02,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917578405] [2021-08-26 15:12:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:12:02,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:12:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:12:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:12:08,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:12:08,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917578405] [2021-08-26 15:12:08,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917578405] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 15:12:08,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248562445] [2021-08-26 15:12:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:12:08,792 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 15:12:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 15:12:08,796 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-08-26 15:12:08,797 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-08-26 15:12:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:12:09,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 2971 conjuncts, 81 conjunts are in the unsatisfiable core [2021-08-26 15:12:09,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 15:12:10,234 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 19 treesize of output 15 [2021-08-26 15:12:11,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-26 15:12:11,939 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-08-26 15:12:12,415 INFO L354 Elim1Store]: treesize reduction 168, result has 18.0 percent of original size [2021-08-26 15:12:12,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 157 [2021-08-26 15:12:12,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:12:12,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2021-08-26 15:12:12,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:12:12,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2021-08-26 15:12:12,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:12:12,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2021-08-26 15:12:12,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:12:12,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2021-08-26 15:12:13,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:12:13,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2021-08-26 15:12:13,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:12:13,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2021-08-26 15:12:14,661 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-26 15:12:14,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 15:12:14,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-08-26 15:12:14,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946260057] [2021-08-26 15:12:14,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-26 15:12:14,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:12:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-26 15:12:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2021-08-26 15:12:14,662 INFO L87 Difference]: Start difference. First operand 204 states and 224 transitions. Second operand has 20 states, 20 states have (on average 4.45) internal successors, (89), 20 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-08-26 15:12:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:12:42,733 INFO L93 Difference]: Finished difference Result 436 states and 482 transitions. [2021-08-26 15:12:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-26 15:12:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.45) internal successors, (89), 20 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-08-26 15:12:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:12:42,735 INFO L225 Difference]: With dead ends: 436 [2021-08-26 15:12:42,735 INFO L226 Difference]: Without dead ends: 335 [2021-08-26 15:12:42,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 5610.1ms TimeCoverageRelationStatistics Valid=377, Invalid=2073, Unknown=0, NotChecked=0, Total=2450 [2021-08-26 15:12:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-08-26 15:12:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 213. [2021-08-26 15:12:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.1304347826086956) internal successors, (234), 212 states have internal predecessors, (234), 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-08-26 15:12:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 234 transitions. [2021-08-26 15:12:42,742 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 234 transitions. Word has length 89 [2021-08-26 15:12:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:12:42,742 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 234 transitions. [2021-08-26 15:12:42,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.45) internal successors, (89), 20 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-08-26 15:12:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 234 transitions. [2021-08-26 15:12:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-26 15:12:42,743 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:12:42,743 INFO L512 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-08-26 15:12:42,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-26 15:12:42,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-26 15:12:42,955 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:12:42,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:12:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1430070408, now seen corresponding path program 1 times [2021-08-26 15:12:42,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:12:42,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812033149] [2021-08-26 15:12:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:12:42,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:12:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:12:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:12:43,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:12:43,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812033149] [2021-08-26 15:12:43,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812033149] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:12:43,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:12:43,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 15:12:43,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14760137] [2021-08-26 15:12:43,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 15:12:43,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:12:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 15:12:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 15:12:43,314 INFO L87 Difference]: Start difference. First operand 213 states and 234 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-08-26 15:12:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:12:45,846 INFO L93 Difference]: Finished difference Result 350 states and 383 transitions. [2021-08-26 15:12:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 15:12:45,847 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-08-26 15:12:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:12:45,848 INFO L225 Difference]: With dead ends: 350 [2021-08-26 15:12:45,848 INFO L226 Difference]: Without dead ends: 260 [2021-08-26 15:12:45,848 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 15:12:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-08-26 15:12:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 213. [2021-08-26 15:12:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.1207729468599035) internal successors, (232), 212 states have internal predecessors, (232), 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-08-26 15:12:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2021-08-26 15:12:45,854 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 89 [2021-08-26 15:12:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:12:45,854 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2021-08-26 15:12:45,854 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-08-26 15:12:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2021-08-26 15:12:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-26 15:12:45,855 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:12:45,855 INFO L512 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-08-26 15:12:45,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 15:12:45,855 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:12:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:12:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 750012038, now seen corresponding path program 1 times [2021-08-26 15:12:45,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:12:45,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593661729] [2021-08-26 15:12:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:12:45,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:12:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:12:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:12:46,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:12:46,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593661729] [2021-08-26 15:12:46,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593661729] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:12:46,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:12:46,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 15:12:46,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080924401] [2021-08-26 15:12:46,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 15:12:46,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:12:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 15:12:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 15:12:46,183 INFO L87 Difference]: Start difference. First operand 213 states and 232 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-08-26 15:12:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:12:48,682 INFO L93 Difference]: Finished difference Result 304 states and 332 transitions. [2021-08-26 15:12:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 15:12:48,683 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-08-26 15:12:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:12:48,684 INFO L225 Difference]: With dead ends: 304 [2021-08-26 15:12:48,684 INFO L226 Difference]: Without dead ends: 216 [2021-08-26 15:12:48,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 15:12:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-26 15:12:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2021-08-26 15:12:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.1159420289855073) internal successors, (231), 212 states have internal predecessors, (231), 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-08-26 15:12:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 231 transitions. [2021-08-26 15:12:48,690 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 231 transitions. Word has length 89 [2021-08-26 15:12:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:12:48,690 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 231 transitions. [2021-08-26 15:12:48,690 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-08-26 15:12:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 231 transitions. [2021-08-26 15:12:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-26 15:12:48,690 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:12:48,690 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:12:48,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 15:12:48,691 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:12:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:12:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash 324156257, now seen corresponding path program 1 times [2021-08-26 15:12:48,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:12:48,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84290983] [2021-08-26 15:12:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:12:48,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:12:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:12:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:12:49,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:12:49,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84290983] [2021-08-26 15:12:49,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84290983] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:12:49,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:12:49,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 15:12:49,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972631677] [2021-08-26 15:12:49,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 15:12:49,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:12:49,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 15:12:49,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-26 15:12:49,088 INFO L87 Difference]: Start difference. First operand 213 states and 231 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:12:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:12:50,236 INFO L93 Difference]: Finished difference Result 380 states and 415 transitions. [2021-08-26 15:12:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 15:12:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-08-26 15:12:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:12:50,247 INFO L225 Difference]: With dead ends: 380 [2021-08-26 15:12:50,247 INFO L226 Difference]: Without dead ends: 376 [2021-08-26 15:12:50,247 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 485.3ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-08-26 15:12:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-08-26 15:12:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 216. [2021-08-26 15:12:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 210 states have (on average 1.1142857142857143) internal successors, (234), 215 states have internal predecessors, (234), 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-08-26 15:12:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 234 transitions. [2021-08-26 15:12:50,264 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 234 transitions. Word has length 91 [2021-08-26 15:12:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:12:50,268 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 234 transitions. [2021-08-26 15:12:50,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:12:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 234 transitions. [2021-08-26 15:12:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-26 15:12:50,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:12:50,269 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 15:12:50,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 15:12:50,269 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:12:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:12:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 870334954, now seen corresponding path program 2 times [2021-08-26 15:12:50,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:12:50,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459018464] [2021-08-26 15:12:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:12:50,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:12:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:12:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:12:58,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:12:58,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459018464] [2021-08-26 15:12:58,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459018464] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 15:12:58,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462580068] [2021-08-26 15:12:58,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 15:12:58,176 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 15:12:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 15:12:58,177 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-08-26 15:12:58,180 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-08-26 15:17:16,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 15:17:16,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 15:17:16,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 2978 conjuncts, 80 conjunts are in the unsatisfiable core [2021-08-26 15:17:16,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 15:17:17,177 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 19 treesize of output 15 [2021-08-26 15:17:19,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-26 15:17:19,026 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-08-26 15:17:19,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:17:19,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 144 [2021-08-26 15:17:19,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:17:19,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2021-08-26 15:17:19,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:17:19,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2021-08-26 15:17:19,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:17:19,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-26 15:17:19,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:17:19,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-26 15:17:19,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:17:19,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-26 15:17:19,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 15:17:19,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-26 15:17:20,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-26 15:17:20,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 15:17:20,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-08-26 15:17:20,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728464903] [2021-08-26 15:17:20,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-26 15:17:20,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:17:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-26 15:17:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2021-08-26 15:17:20,568 INFO L87 Difference]: Start difference. First operand 216 states and 234 transitions. Second operand has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:17:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:17:50,237 INFO L93 Difference]: Finished difference Result 368 states and 399 transitions. [2021-08-26 15:17:50,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-26 15:17:50,237 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-08-26 15:17:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:17:50,238 INFO L225 Difference]: With dead ends: 368 [2021-08-26 15:17:50,238 INFO L226 Difference]: Without dead ends: 265 [2021-08-26 15:17:50,239 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 5407.2ms TimeCoverageRelationStatistics Valid=411, Invalid=2139, Unknown=0, NotChecked=0, Total=2550 [2021-08-26 15:17:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-08-26 15:17:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 191. [2021-08-26 15:17:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.1021505376344085) internal successors, (205), 190 states have internal predecessors, (205), 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-08-26 15:17:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2021-08-26 15:17:50,244 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 91 [2021-08-26 15:17:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:17:50,244 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2021-08-26 15:17:50,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:17:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2021-08-26 15:17:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-26 15:17:50,245 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:17:50,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:17:50,350 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-08-26 15:17:50,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-26 15:17:50,465 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:17:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:17:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash 308968320, now seen corresponding path program 1 times [2021-08-26 15:17:50,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:17:50,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836171979] [2021-08-26 15:17:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:17:50,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:17:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:17:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:17:54,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:17:54,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836171979] [2021-08-26 15:17:54,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836171979] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 15:17:54,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51713147] [2021-08-26 15:17:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:17:54,598 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 15:17:54,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 15:17:54,599 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-08-26 15:17:54,600 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-08-26 15:17:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:17:55,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 3087 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-26 15:17:55,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 15:17:55,907 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 11 treesize of output 7 [2021-08-26 15:17:56,667 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-26 15:17:56,668 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 20 treesize of output 10 [2021-08-26 15:17:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:17:56,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51713147] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:17:56,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 15:17:56,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2021-08-26 15:17:56,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823256980] [2021-08-26 15:17:56,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 15:17:56,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:17:56,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 15:17:56,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-08-26 15:17:56,837 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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-08-26 15:18:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:04,075 INFO L93 Difference]: Finished difference Result 261 states and 282 transitions. [2021-08-26 15:18:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 15:18:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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 121 [2021-08-26 15:18:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:04,076 INFO L225 Difference]: With dead ends: 261 [2021-08-26 15:18:04,076 INFO L226 Difference]: Without dead ends: 192 [2021-08-26 15:18:04,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1472.5ms TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-08-26 15:18:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-26 15:18:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2021-08-26 15:18:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.098901098901099) internal successors, (200), 186 states have internal predecessors, (200), 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-08-26 15:18:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2021-08-26 15:18:04,082 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 121 [2021-08-26 15:18:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:04,082 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2021-08-26 15:18:04,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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-08-26 15:18:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2021-08-26 15:18:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-26 15:18:04,083 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:04,083 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:04,106 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-08-26 15:18:04,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 15:18:04,293 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1601276465, now seen corresponding path program 1 times [2021-08-26 15:18:04,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:04,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830881676] [2021-08-26 15:18:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:04,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 15:18:09,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:18:09,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830881676] [2021-08-26 15:18:09,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830881676] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 15:18:09,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129695316] [2021-08-26 15:18:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:09,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 15:18:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 15:18:09,173 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-08-26 15:18:09,174 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-08-26 15:18:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:10,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 3096 conjuncts, 67 conjunts are in the unsatisfiable core [2021-08-26 15:18:10,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 15:18:10,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-26 15:18:10,496 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-26 15:18:10,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-26 15:18:10,626 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 22 treesize of output 18 [2021-08-26 15:18:12,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-26 15:18:12,544 INFO L354 Elim1Store]: treesize reduction 95, result has 16.7 percent of original size [2021-08-26 15:18:12,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 89 [2021-08-26 15:18:12,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 47 treesize of output 27 [2021-08-26 15:18:12,695 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-26 15:18:12,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 15:18:12,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-08-26 15:18:12,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171553626] [2021-08-26 15:18:12,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-26 15:18:12,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:18:12,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-26 15:18:12,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-08-26 15:18:12,696 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-08-26 15:18:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:23,347 INFO L93 Difference]: Finished difference Result 419 states and 449 transitions. [2021-08-26 15:18:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 15:18:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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 127 [2021-08-26 15:18:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:23,349 INFO L225 Difference]: With dead ends: 419 [2021-08-26 15:18:23,349 INFO L226 Difference]: Without dead ends: 360 [2021-08-26 15:18:23,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2878.3ms TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2021-08-26 15:18:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-08-26 15:18:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 308. [2021-08-26 15:18:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 303 states have (on average 1.0759075907590758) internal successors, (326), 307 states have internal predecessors, (326), 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-08-26 15:18:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2021-08-26 15:18:23,376 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 127 [2021-08-26 15:18:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:23,377 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2021-08-26 15:18:23,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-08-26 15:18:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2021-08-26 15:18:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-26 15:18:23,378 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:23,378 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:23,420 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-08-26 15:18:23,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 15:18:23,579 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash 699546125, now seen corresponding path program 1 times [2021-08-26 15:18:23,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:23,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103915499] [2021-08-26 15:18:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:23,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:18:26,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:18:26,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103915499] [2021-08-26 15:18:26,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103915499] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:18:26,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:18:26,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 15:18:26,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89187592] [2021-08-26 15:18:26,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 15:18:26,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:18:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 15:18:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 15:18:26,910 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-08-26 15:18:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:29,512 INFO L93 Difference]: Finished difference Result 308 states and 326 transitions. [2021-08-26 15:18:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 15:18:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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 127 [2021-08-26 15:18:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:29,514 INFO L225 Difference]: With dead ends: 308 [2021-08-26 15:18:29,514 INFO L226 Difference]: Without dead ends: 306 [2021-08-26 15:18:29,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 491.4ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-08-26 15:18:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-26 15:18:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-08-26 15:18:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 302 states have (on average 1.0728476821192052) internal successors, (324), 305 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:18:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 324 transitions. [2021-08-26 15:18:29,524 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 324 transitions. Word has length 127 [2021-08-26 15:18:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:29,524 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 324 transitions. [2021-08-26 15:18:29,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-08-26 15:18:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 324 transitions. [2021-08-26 15:18:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-08-26 15:18:29,525 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:29,526 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:29,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 15:18:29,526 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1320379803, now seen corresponding path program 1 times [2021-08-26 15:18:29,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:29,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520039118] [2021-08-26 15:18:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:29,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:18:29,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:18:29,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520039118] [2021-08-26 15:18:29,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520039118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:18:29,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:18:29,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 15:18:29,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553922605] [2021-08-26 15:18:29,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 15:18:29,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:18:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 15:18:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 15:18:29,961 INFO L87 Difference]: Start difference. First operand 306 states and 324 transitions. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-08-26 15:18:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:35,085 INFO L93 Difference]: Finished difference Result 336 states and 353 transitions. [2021-08-26 15:18:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 15:18:35,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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 128 [2021-08-26 15:18:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:35,086 INFO L225 Difference]: With dead ends: 336 [2021-08-26 15:18:35,086 INFO L226 Difference]: Without dead ends: 309 [2021-08-26 15:18:35,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 351.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-26 15:18:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-26 15:18:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2021-08-26 15:18:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 300 states have (on average 1.07) internal successors, (321), 303 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:18:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 321 transitions. [2021-08-26 15:18:35,096 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 321 transitions. Word has length 128 [2021-08-26 15:18:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:35,096 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 321 transitions. [2021-08-26 15:18:35,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-08-26 15:18:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 321 transitions. [2021-08-26 15:18:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-08-26 15:18:35,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:35,097 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:35,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-26 15:18:35,098 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1062214365, now seen corresponding path program 1 times [2021-08-26 15:18:35,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:35,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021300337] [2021-08-26 15:18:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:35,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:18:40,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:18:40,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021300337] [2021-08-26 15:18:40,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021300337] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:18:40,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:18:40,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 15:18:40,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176512715] [2021-08-26 15:18:40,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 15:18:40,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:18:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 15:18:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-26 15:18:40,064 INFO L87 Difference]: Start difference. First operand 304 states and 321 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 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-08-26 15:18:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:43,407 INFO L93 Difference]: Finished difference Result 328 states and 344 transitions. [2021-08-26 15:18:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 15:18:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 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 128 [2021-08-26 15:18:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:43,408 INFO L225 Difference]: With dead ends: 328 [2021-08-26 15:18:43,408 INFO L226 Difference]: Without dead ends: 303 [2021-08-26 15:18:43,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 693.0ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-08-26 15:18:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-26 15:18:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2021-08-26 15:18:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 297 states have (on average 1.0673400673400673) internal successors, (317), 300 states have internal predecessors, (317), 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-08-26 15:18:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 317 transitions. [2021-08-26 15:18:43,419 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 317 transitions. Word has length 128 [2021-08-26 15:18:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:43,423 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 317 transitions. [2021-08-26 15:18:43,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 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-08-26 15:18:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 317 transitions. [2021-08-26 15:18:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-08-26 15:18:43,424 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:43,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:43,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-26 15:18:43,431 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash -370795817, now seen corresponding path program 1 times [2021-08-26 15:18:43,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:43,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934193180] [2021-08-26 15:18:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:43,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:18:44,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:18:44,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934193180] [2021-08-26 15:18:44,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934193180] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:18:44,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:18:44,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 15:18:44,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720553453] [2021-08-26 15:18:44,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 15:18:44,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:18:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 15:18:44,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 15:18:44,006 INFO L87 Difference]: Start difference. First operand 301 states and 317 transitions. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-08-26 15:18:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:49,127 INFO L93 Difference]: Finished difference Result 325 states and 340 transitions. [2021-08-26 15:18:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 15:18:49,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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 128 [2021-08-26 15:18:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:49,128 INFO L225 Difference]: With dead ends: 325 [2021-08-26 15:18:49,129 INFO L226 Difference]: Without dead ends: 303 [2021-08-26 15:18:49,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 415.8ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-08-26 15:18:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-26 15:18:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2021-08-26 15:18:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 297 states have (on average 1.063973063973064) internal successors, (316), 300 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:18:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 316 transitions. [2021-08-26 15:18:49,138 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 316 transitions. Word has length 128 [2021-08-26 15:18:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:49,138 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 316 transitions. [2021-08-26 15:18:49,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-08-26 15:18:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 316 transitions. [2021-08-26 15:18:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-08-26 15:18:49,139 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:49,139 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:49,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-26 15:18:49,139 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2045900145, now seen corresponding path program 1 times [2021-08-26 15:18:49,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:49,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309495840] [2021-08-26 15:18:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:49,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:18:52,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:18:52,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309495840] [2021-08-26 15:18:52,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309495840] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:18:52,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:18:52,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 15:18:52,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003656131] [2021-08-26 15:18:52,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 15:18:52,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:18:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 15:18:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-08-26 15:18:52,369 INFO L87 Difference]: Start difference. First operand 301 states and 316 transitions. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-08-26 15:18:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:54,118 INFO L93 Difference]: Finished difference Result 320 states and 334 transitions. [2021-08-26 15:18:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 15:18:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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 129 [2021-08-26 15:18:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:54,119 INFO L225 Difference]: With dead ends: 320 [2021-08-26 15:18:54,119 INFO L226 Difference]: Without dead ends: 318 [2021-08-26 15:18:54,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1093.5ms TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2021-08-26 15:18:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-08-26 15:18:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2021-08-26 15:18:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 306 states have (on average 1.0620915032679739) internal successors, (325), 309 states have internal predecessors, (325), 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-08-26 15:18:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 325 transitions. [2021-08-26 15:18:54,130 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 325 transitions. Word has length 129 [2021-08-26 15:18:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:54,130 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 325 transitions. [2021-08-26 15:18:54,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-08-26 15:18:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 325 transitions. [2021-08-26 15:18:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-26 15:18:54,131 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:54,131 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:54,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-26 15:18:54,132 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 455257264, now seen corresponding path program 1 times [2021-08-26 15:18:54,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:54,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856766499] [2021-08-26 15:18:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:54,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:18:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:18:54,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:18:54,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856766499] [2021-08-26 15:18:54,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856766499] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:18:54,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:18:54,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 15:18:54,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241292649] [2021-08-26 15:18:54,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 15:18:54,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:18:54,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 15:18:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 15:18:54,641 INFO L87 Difference]: Start difference. First operand 310 states and 325 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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-08-26 15:18:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:18:59,623 INFO L93 Difference]: Finished difference Result 349 states and 363 transitions. [2021-08-26 15:18:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 15:18:59,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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 130 [2021-08-26 15:18:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:18:59,625 INFO L225 Difference]: With dead ends: 349 [2021-08-26 15:18:59,625 INFO L226 Difference]: Without dead ends: 326 [2021-08-26 15:18:59,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 324.8ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-08-26 15:18:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-26 15:18:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 302. [2021-08-26 15:18:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 299 states have (on average 1.0568561872909699) internal successors, (316), 301 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:18:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 316 transitions. [2021-08-26 15:18:59,635 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 316 transitions. Word has length 130 [2021-08-26 15:18:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:18:59,636 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 316 transitions. [2021-08-26 15:18:59,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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-08-26 15:18:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 316 transitions. [2021-08-26 15:18:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-26 15:18:59,637 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:18:59,637 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 15:18:59,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-26 15:18:59,637 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:18:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:18:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash 985121713, now seen corresponding path program 1 times [2021-08-26 15:18:59,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:18:59,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460761485] [2021-08-26 15:18:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:18:59,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:18:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:19:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:19:00,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:19:00,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460761485] [2021-08-26 15:19:00,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460761485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:19:00,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:19:00,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 15:19:00,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067597563] [2021-08-26 15:19:00,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 15:19:00,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:19:00,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 15:19:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 15:19:00,248 INFO L87 Difference]: Start difference. First operand 302 states and 316 transitions. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-08-26 15:19:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:19:02,893 INFO L93 Difference]: Finished difference Result 302 states and 316 transitions. [2021-08-26 15:19:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 15:19:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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 131 [2021-08-26 15:19:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:19:02,894 INFO L225 Difference]: With dead ends: 302 [2021-08-26 15:19:02,894 INFO L226 Difference]: Without dead ends: 300 [2021-08-26 15:19:02,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 425.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-08-26 15:19:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-08-26 15:19:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2021-08-26 15:19:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 298 states have (on average 1.0536912751677852) internal successors, (314), 299 states have internal predecessors, (314), 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-08-26 15:19:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 314 transitions. [2021-08-26 15:19:02,903 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 314 transitions. Word has length 131 [2021-08-26 15:19:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:19:02,903 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 314 transitions. [2021-08-26 15:19:02,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-08-26 15:19:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 314 transitions. [2021-08-26 15:19:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-26 15:19:02,904 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:19:02,904 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 15:19:02,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-26 15:19:02,904 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:19:02,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:19:02,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1809300851, now seen corresponding path program 1 times [2021-08-26 15:19:02,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:19:02,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078930769] [2021-08-26 15:19:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:19:02,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:19:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:19:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:19:06,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:19:06,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078930769] [2021-08-26 15:19:06,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078930769] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:19:06,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:19:06,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 15:19:06,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797077596] [2021-08-26 15:19:06,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 15:19:06,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:19:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 15:19:06,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-26 15:19:06,370 INFO L87 Difference]: Start difference. First operand 300 states and 314 transitions. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-08-26 15:19:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:19:09,067 INFO L93 Difference]: Finished difference Result 300 states and 314 transitions. [2021-08-26 15:19:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 15:19:09,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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 133 [2021-08-26 15:19:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:19:09,068 INFO L225 Difference]: With dead ends: 300 [2021-08-26 15:19:09,068 INFO L226 Difference]: Without dead ends: 281 [2021-08-26 15:19:09,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 360.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-26 15:19:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-08-26 15:19:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-08-26 15:19:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.05) internal successors, (294), 280 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:19:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 294 transitions. [2021-08-26 15:19:09,076 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 294 transitions. Word has length 133 [2021-08-26 15:19:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:19:09,077 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 294 transitions. [2021-08-26 15:19:09,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-08-26 15:19:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 294 transitions. [2021-08-26 15:19:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-08-26 15:19:09,077 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 15:19:09,077 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 15:19:09,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-26 15:19:09,078 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 15:19:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 15:19:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1367391264, now seen corresponding path program 1 times [2021-08-26 15:19:09,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 15:19:09,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144740762] [2021-08-26 15:19:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 15:19:09,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 15:19:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 15:19:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 15:19:11,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 15:19:11,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144740762] [2021-08-26 15:19:11,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144740762] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 15:19:11,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 15:19:11,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 15:19:11,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964016309] [2021-08-26 15:19:11,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 15:19:11,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 15:19:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 15:19:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-26 15:19:11,537 INFO L87 Difference]: Start difference. First operand 281 states and 294 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 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-08-26 15:19:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 15:19:16,300 INFO L93 Difference]: Finished difference Result 281 states and 294 transitions. [2021-08-26 15:19:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 15:19:16,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 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 135 [2021-08-26 15:19:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 15:19:16,301 INFO L225 Difference]: With dead ends: 281 [2021-08-26 15:19:16,301 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 15:19:16,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 308.3ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-08-26 15:19:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 15:19:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 15:19:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 15:19:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 15:19:16,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2021-08-26 15:19:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 15:19:16,302 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 15:19:16,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 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-08-26 15:19:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 15:19:16,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 15:19:16,304 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 15:19:16,304 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 15:19:16,304 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 15:19:16,304 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 15:19:16,305 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 15:19:16,305 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 15:19:16,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-26 15:19:16,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 15:19:16,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:16,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 15:19:21,552 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,552 INFO L857 garLoopResultBuilder]: For program point L7270(lines 7270 7283) no Hoare annotation was computed. [2021-08-26 15:19:21,552 INFO L857 garLoopResultBuilder]: For program point L7272-2(lines 7272 7274) no Hoare annotation was computed. [2021-08-26 15:19:21,552 INFO L857 garLoopResultBuilder]: For program point L7272(line 7272) no Hoare annotation was computed. [2021-08-26 15:19:21,552 INFO L857 garLoopResultBuilder]: For program point L7272-4(lines 7272 7274) no Hoare annotation was computed. [2021-08-26 15:19:21,552 INFO L857 garLoopResultBuilder]: For program point L8894(lines 8894 8915) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L8663(lines 8663 8680) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L853 garLoopResultBuilder]: At program point L6649(lines 6647 6650) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 0) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0))) [2021-08-26 15:19:21,553 INFO L853 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0)) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 7182 7186) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,553 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7182(lines 7182 7186) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-1(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-6(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-4(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-3(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L853 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0)) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-9(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-7(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-14(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L857 garLoopResultBuilder]: For program point L7248-13(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,554 INFO L853 garLoopResultBuilder]: At program point L7248-12(lines 7246 7252) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED))) (let ((.cse0 (not (= .cse5 0))) (.cse1 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0))) (.cse6 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) .cse0 .cse1 .cse2 (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= .cse3 (+ 4294967295 (* 4294967296 (div (+ .cse3 (- 1)) 4294967296))))) .cse4 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| .cse5)) .cse6 .cse7 .cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) (and (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) .cse0 .cse1 .cse2 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse6 .cse7 .cse8 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|))))) [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-11(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-17(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-16(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-22(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-20(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-19(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-26(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L853 garLoopResultBuilder]: At program point L7248-25(lines 7246 7252) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED)) (.cse0 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse1 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse3 (not (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base 0))) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| .cse2)) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED) 0)) (let ((.cse7 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) 12))) (<= .cse7 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse7) 4294967296))))) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) (and (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (not (= .cse2 0)) .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0)) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse3 .cse4 .cse5 .cse6 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)))) [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-24(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-30(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-29(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-27(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-33(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-32(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L853 garLoopResultBuilder]: At program point L7248-38(lines 7246 7252) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse1 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base 0)))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) .cse0 (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset 0) .cse1 (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 4)))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) .cse2 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED) 0)) (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) 12))) (<= .cse3 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse3) 4294967296))))) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED) 0)) .cse0 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0)) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) (not (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base 0)) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) .cse1 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse2))) [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-37(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-35(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-42(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-40(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-39(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-46(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,555 INFO L857 garLoopResultBuilder]: For program point L7248-45(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-43(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-50(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-48(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-53(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-52(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L853 garLoopResultBuilder]: At program point L7248-51(lines 7246 7252) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset) (not (= ULTIMATE.start_memset_impl_~sp~0.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base)) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (<= (+ (* 4294967296 (div ULTIMATE.start_memset_impl_~n 4294967296)) 1) ULTIMATE.start_memset_impl_~n) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 4)))) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base 0)) (= (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base ULTIMATE.start_memset_impl_~s.base)) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) 12))) (<= .cse0 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse0) 4294967296))))) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-58(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-56(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-55(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-61(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-59(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7184-2(lines 7184 7185) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-66(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-65(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L853 garLoopResultBuilder]: At program point L7248-64(lines 7246 7252) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 0)) (.cse1 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base 0)))) (or (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) .cse1 (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (not (= ULTIMATE.start_memset_impl_~sp~0.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base)) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) .cse2 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset) 0) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (<= (+ (* 4294967296 (div ULTIMATE.start_memset_impl_~n 4294967296)) 1) ULTIMATE.start_memset_impl_~n) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 4)))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) .cse3 (= ULTIMATE.start_aws_byte_buf_clean_up_~buf.base |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_clean_up_~buf.offset 0) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base ULTIMATE.start_memset_impl_~s.base)) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset ULTIMATE.start_aws_byte_buf_clean_up_~buf.offset) (let ((.cse4 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) 12))) (<= .cse4 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse4) 4294967296))))) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) (and .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0)) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) (not (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base 0)) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) .cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse3))) [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-63(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-69(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-68(line 7248) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L853 garLoopResultBuilder]: At program point L7184-3(lines 7184 7185) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (not (= ULTIMATE.start_memset_impl_~sp~0.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base)) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (<= (+ (* 4294967296 (div ULTIMATE.start_memset_impl_~n 4294967296)) 1) ULTIMATE.start_memset_impl_~n) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 4)))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base 0)) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base ULTIMATE.start_memset_impl_~s.base)) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) 12))) (<= .cse0 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse0) 4294967296))))) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-74(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-72(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,556 INFO L857 garLoopResultBuilder]: For program point L7248-71(lines 7248 7249) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L853 garLoopResultBuilder]: At program point L7248-77(lines 7246 7252) the Hoare annotation is: (let ((.cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|))) (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) .cse0) 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 12)) 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0) (= (select .cse1 .cse0) 0) (= (select .cse1 (+ |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 4)) 0) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (<= (+ (* 4294967296 (div ULTIMATE.start_memset_impl_~n 4294967296)) 1) ULTIMATE.start_memset_impl_~n) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_clean_up_~buf.base |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_clean_up_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset ULTIMATE.start_aws_byte_buf_clean_up_~buf.offset) (= (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset) 0) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|))) [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7248-76(lines 7248 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-4(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-3(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-2(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-9(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-8(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-6(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-13(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-12(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-11(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-17(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-15(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-21(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-20(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-18(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-24(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-22(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-29(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-27(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-26(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-33(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-31(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-30(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7285(lines 7285 7292) no Hoare annotation was computed. [2021-08-26 15:19:21,557 INFO L857 garLoopResultBuilder]: For program point L7251-36(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-35(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-40(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-39(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-38(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-45(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-44(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-42(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-49(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-48(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-47(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-53(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7251-51(line 7251) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L853 garLoopResultBuilder]: At program point L7187(lines 7180 7188) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (not (= ULTIMATE.start_memset_impl_~sp~0.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base)) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (<= (+ (* 4294967296 (div ULTIMATE.start_memset_impl_~n 4294967296)) 1) ULTIMATE.start_memset_impl_~n) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 4)))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base 0)) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base ULTIMATE.start_memset_impl_~s.base)) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) 12))) (<= .cse0 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse0) 4294967296))))) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7287(lines 7287 7289) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L7287-2(lines 7287 7289) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L853 garLoopResultBuilder]: At program point L7191(lines 7190 7192) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| |ULTIMATE.start_bounded_malloc_#res.base|)) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (not (= ULTIMATE.start_memset_impl_~sp~0.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base)) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (<= (+ (* 4294967296 (div ULTIMATE.start_memset_impl_~n 4294967296)) 1) ULTIMATE.start_memset_impl_~n) (= ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 4)))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf.base) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base 0)) (not (= ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base ULTIMATE.start_memset_impl_~s.base)) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) 12))) (<= .cse0 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse0) 4294967296))))) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-08-26 15:19:21,558 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L7294(lines 7294 7299) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L853 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (not (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base|) 0)) (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| 0)) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3.offset|)) [2021-08-26 15:19:21,559 INFO L860 garLoopResultBuilder]: At program point L8916(line 8916) the Hoare annotation is: true [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 15:19:21,559 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-08-26 15:19:21,566 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 15:19:21,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,605 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,612 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,613 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,613 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,613 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,613 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,615 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,616 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:21,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:21,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:21,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:21,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:21,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:21,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:19:21 BoogieIcfgContainer [2021-08-26 15:19:21,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 15:19:21,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 15:19:21,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 15:19:21,651 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 15:19:21,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:38" (3/4) ... [2021-08-26 15:19:21,654 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 15:19:21,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 138 nodes and edges [2021-08-26 15:19:21,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-08-26 15:19:21,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-08-26 15:19:21,686 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-08-26 15:19:21,687 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-08-26 15:19:21,688 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-08-26 15:19:21,689 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 15:19:21,690 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 15:19:21,714 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(buf == \result) && !(\valid[buf] == 0)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf [2021-08-26 15:19:21,715 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(buf == \result) && !(\valid[buf] == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && buf == buf) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296)) && !(buf == 0)) && !(buf == #memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED])) && buf == 0) && buf == buf) && buf == buf) && buf == buf) || (((((((((buf == 0 && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && \result <= 0) && buf == 0) && buf == buf) && buf == buf) && 0 <= \result) [2021-08-26 15:19:21,715 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(buf == \result) && !(\valid[buf] == 0)) && !(\result == 0)) && buf == buf) && !(buf == #memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED])) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf) && buf == buf) && buf == buf) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf) || ((((((((((buf == 0 && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && \result <= 0) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf) && 0 <= \result) [2021-08-26 15:19:21,715 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(buf == \result) && buf == 0) && !(\valid[buf] == 0)) && !(\result == 0)) && buf == buf) && buf == buf) && buf == buf) && buf == 0) && buf == buf) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf) || (((((((((buf == 0 && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && !(buf == 0)) && \result <= 0) && !(buf == 0)) && buf == 0) && buf == buf) && 0 <= \result) && !(buf == 0)) [2021-08-26 15:19:21,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((buf == 0 && !(buf == \result)) && buf == 0) && !(\valid[buf] == 0)) && buf == 0) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf [2021-08-26 15:19:21,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(buf == \result) && buf == 0) && !(\valid[buf] == 0)) && buf == 0) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == 0) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf [2021-08-26 15:19:21,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((buf == 0 && !(buf == \result)) && buf == 0) && !(\valid[buf] == 0)) && buf == 0) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf [2021-08-26 15:19:21,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(buf == \result) && !(\valid[buf] == 0)) && buf == buf) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == 0) && buf == buf) && buf == buf) && \result <= 1) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && 1 <= \result) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] == 0) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf [2021-08-26 15:19:21,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((buf == 0 && !(buf == \result)) && !(\valid[buf] == 0)) && !(\result == 0)) && buf == buf) && buf == buf) && !(sp == buf)) && buf == buf) && buf == buf) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && buf == buf) && buf == 0) && !(buf == s)) && buf == buf) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf) || ((((((((buf == 0 && !(\result == 0)) && !(buf == 0)) && \result <= 0) && !(buf == 0)) && buf == 0) && buf == buf) && 0 <= \result) && !(buf == 0)) [2021-08-26 15:19:21,717 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((buf == 0 && !(buf == \result)) && buf == 0) && !(\result == 0)) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && buf == buf) && unknown-#memory_int-unknown[buf][buf + 12] == 0) && buf == buf) && #memory_$Pointer$[buf][buf + 4] == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && \result <= 1) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && 1 <= \result) && buf == buf) && !(buf == 0)) && buf == buf) && buf == 0) && buf == buf) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf [2021-08-26 15:19:22,297 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 15:19:22,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 15:19:22,299 INFO L168 Benchmark]: Toolchain (without parser) took 533479.05 ms. Allocated memory was 56.6 MB in the beginning and 1.1 GB in the end (delta: 1.1 GB). Free memory was 31.9 MB in the beginning and 562.9 MB in the end (delta: -531.0 MB). Peak memory consumption was 726.7 MB. Max. memory is 16.1 GB. [2021-08-26 15:19:22,299 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 46.1 MB. Free memory is still 27.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 15:19:22,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1634.35 ms. Allocated memory was 56.6 MB in the beginning and 98.6 MB in the end (delta: 41.9 MB). Free memory was 31.7 MB in the beginning and 45.0 MB in the end (delta: -13.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.1 GB. [2021-08-26 15:19:22,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 306.21 ms. Allocated memory was 98.6 MB in the beginning and 130.0 MB in the end (delta: 31.5 MB). Free memory was 45.0 MB in the beginning and 80.6 MB in the end (delta: -35.5 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. [2021-08-26 15:19:22,299 INFO L168 Benchmark]: Boogie Preprocessor took 119.77 ms. Allocated memory is still 130.0 MB. Free memory was 80.6 MB in the beginning and 72.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 15:19:22,300 INFO L168 Benchmark]: RCFGBuilder took 8037.07 ms. Allocated memory was 130.0 MB in the beginning and 599.8 MB in the end (delta: 469.8 MB). Free memory was 72.2 MB in the beginning and 242.5 MB in the end (delta: -170.3 MB). Peak memory consumption was 358.1 MB. Max. memory is 16.1 GB. [2021-08-26 15:19:22,300 INFO L168 Benchmark]: TraceAbstraction took 522727.46 ms. Allocated memory was 599.8 MB in the beginning and 1.1 GB in the end (delta: 520.1 MB). Free memory was 242.5 MB in the beginning and 730.6 MB in the end (delta: -488.1 MB). Peak memory consumption was 372.8 MB. Max. memory is 16.1 GB. [2021-08-26 15:19:22,300 INFO L168 Benchmark]: Witness Printer took 646.89 ms. Allocated memory is still 1.1 GB. Free memory was 730.6 MB in the beginning and 562.9 MB in the end (delta: 167.7 MB). Peak memory consumption was 361.7 MB. Max. memory is 16.1 GB. [2021-08-26 15:19:22,301 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.34 ms. Allocated memory is still 46.1 MB. Free memory is still 27.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1634.35 ms. Allocated memory was 56.6 MB in the beginning and 98.6 MB in the end (delta: 41.9 MB). Free memory was 31.7 MB in the beginning and 45.0 MB in the end (delta: -13.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 306.21 ms. Allocated memory was 98.6 MB in the beginning and 130.0 MB in the end (delta: 31.5 MB). Free memory was 45.0 MB in the beginning and 80.6 MB in the end (delta: -35.5 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 119.77 ms. Allocated memory is still 130.0 MB. Free memory was 80.6 MB in the beginning and 72.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 8037.07 ms. Allocated memory was 130.0 MB in the beginning and 599.8 MB in the end (delta: 469.8 MB). Free memory was 72.2 MB in the beginning and 242.5 MB in the end (delta: -170.3 MB). Peak memory consumption was 358.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 522727.46 ms. Allocated memory was 599.8 MB in the beginning and 1.1 GB in the end (delta: 520.1 MB). Free memory was 242.5 MB in the beginning and 730.6 MB in the end (delta: -488.1 MB). Peak memory consumption was 372.8 MB. Max. memory is 16.1 GB. * Witness Printer took 646.89 ms. Allocated memory is still 1.1 GB. Free memory was 730.6 MB in the beginning and 562.9 MB in the end (delta: 167.7 MB). Peak memory consumption was 361.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 161 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 522573.9ms, OverallIterations: 32, TraceHistogramMax: 2, EmptinessCheckTime: 41.3ms, AutomataDifference: 183766.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5246.9ms, InitialAbstractionConstructionTime: 28.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5264 SDtfs, 12045 SDslu, 16396 SDs, 0 SdLazy, 7086 SolverSat, 744 SolverUnsat, 69 SolverUnknown, 0 SolverNotchecked, 159866.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 26993.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=28, InterpolantAutomatonStates: 335, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 244.7ms AutomataMinimizationTime, 32 MinimizatonAttempts, 1396 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 45 NumberOfFragments, 1069 HoareAnnotationTreeSize, 14 FomulaSimplifications, 231300 FormulaSimplificationTreeSizeReduction, 444.9ms HoareSimplificationTime, 14 FomulaSimplificationsInter, 147594 FormulaSimplificationTreeSizeReductionInter, 4792.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 499.0ms SsaConstructionTime, 41060.0ms SatisfiabilityAnalysisTime, 18213.9ms InterpolantComputationTime, 3008 NumberOfCodeBlocks, 3008 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2975 ConstructedInterpolants, 0 QuantifiedInterpolants, 21429 SizeOfPredicates, 22 NumberOfNonLiveVariables, 3087 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 13/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 8916]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7246]: Loop Invariant [2021-08-26 15:19:22,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED Derived loop invariant: (((((((((((!(buf == \result) && !(\valid[buf] == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && buf == buf) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296)) && !(buf == 0)) && !(buf == #memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED])) && buf == 0) && buf == buf) && buf == buf) && buf == buf) || (((((((((buf == 0 && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && \result <= 0) && buf == 0) && buf == buf) && buf == buf) && 0 <= \result) - InvariantResult [Line: 7190]: Loop Invariant [2021-08-26 15:19:22,313 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,313 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((buf == 0 && !(buf == \result)) && buf == 0) && !(\valid[buf] == 0)) && buf == 0) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf - InvariantResult [Line: 7180]: Loop Invariant [2021-08-26 15:19:22,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((buf == 0 && !(buf == \result)) && buf == 0) && !(\valid[buf] == 0)) && buf == 0) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: (((((!(buf == \result) && !(\valid[buf] == 0)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf - InvariantResult [Line: 7246]: Loop Invariant [2021-08-26 15:19:22,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:22,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:22,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:22,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 15:19:22,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((buf == 0 && !(buf == \result)) && buf == 0) && !(\result == 0)) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && buf == buf) && unknown-#memory_int-unknown[buf][buf + 12] == 0) && buf == buf) && #memory_$Pointer$[buf][buf + 4] == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && \result <= 1) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && 1 <= \result) && buf == buf) && !(buf == 0)) && buf == buf) && buf == 0) && buf == buf) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf - InvariantResult [Line: 6647]: Loop Invariant Derived loop invariant: (buf == 0 && !(\valid[buf] == 0)) && !(buf == 0) - InvariantResult [Line: 7246]: Loop Invariant [2021-08-26 15:19:22,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((!(buf == \result) && !(\valid[buf] == 0)) && buf == buf) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == 0) && buf == buf) && buf == buf) && \result <= 1) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && 1 <= \result) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] == 0) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf - InvariantResult [Line: 7246]: Loop Invariant [2021-08-26 15:19:22,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED Derived loop invariant: (((((((((((((((!(buf == \result) && buf == 0) && !(\valid[buf] == 0)) && !(\result == 0)) && buf == buf) && buf == buf) && buf == buf) && buf == 0) && buf == buf) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf) || (((((((((buf == 0 && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && !(buf == 0)) && \result <= 0) && !(buf == 0)) && buf == 0) && buf == buf) && 0 <= \result) && !(buf == 0)) - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: (((!(\valid[buf] == 0) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf - InvariantResult [Line: 7184]: Loop Invariant [2021-08-26 15:19:22,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,320 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((!(buf == \result) && buf == 0) && !(\valid[buf] == 0)) && buf == 0) && !(\result == 0)) && buf == buf) && !(sp == buf)) && buf == buf) && buf == 0) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && buf == buf) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && !(buf == s)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((!(\valid[buf] == 0) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf - InvariantResult [Line: 7246]: Loop Invariant [2021-08-26 15:19:22,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED [2021-08-26 15:19:22,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED Derived loop invariant: (((((((((((((!(buf == \result) && !(\valid[buf] == 0)) && !(\result == 0)) && buf == buf) && !(buf == #memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED])) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf) && buf == buf) && buf == buf) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf) || ((((((((((buf == 0 && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_OVERFLOW_DETECTED] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && \result <= 0) && !(buf == 0)) && buf == 0) && buf == buf) && buf == buf) && 0 <= \result) - InvariantResult [Line: 7246]: Loop Invariant [2021-08-26 15:19:22,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 15:19:22,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((buf == 0 && !(buf == \result)) && !(\valid[buf] == 0)) && !(\result == 0)) && buf == buf) && buf == buf) && !(sp == buf)) && buf == buf) && buf == buf) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 4294967296 * (n / 4294967296) + 1 <= n) && !(buf == #memory_$Pointer$[buf][buf + 4])) && buf == buf) && !(buf == 0)) && buf == buf) && buf == 0) && !(buf == s)) && buf == buf) && unknown-#memory_int-unknown[buf][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296)) && buf == buf) || ((((((((buf == 0 && !(\result == 0)) && !(buf == 0)) && \result <= 0) && !(buf == 0)) && buf == 0) && buf == buf) && 0 <= \result) && !(buf == 0)) RESULT: Ultimate proved your program to be correct! [2021-08-26 15:19:22,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...