./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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_write_u8_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 624e111eb11fc6cb53be17248f0e61e18bd8cc958dfb511134351ecf4f085f78 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:46:23,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:46:23,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:46:23,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:46:23,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:46:23,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:46:23,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:46:23,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:46:23,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:46:23,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:46:23,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:46:23,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:46:23,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:46:23,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:46:23,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:46:23,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:46:23,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:46:23,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:46:23,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:46:23,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:46:23,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:46:23,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:46:23,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:46:23,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:46:23,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:46:23,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:46:23,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:46:23,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:46:23,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:46:23,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:46:23,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:46:23,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:46:23,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:46:23,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:46:23,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:46:23,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:46:23,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:46:23,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:46:23,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:46:23,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:46:23,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:46:23,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 19:46:23,960 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:46:23,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:46:23,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:46:23,961 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:46:23,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:46:23,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:46:23,962 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:46:23,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:46:23,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:46:23,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:46:23,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:46:23,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:46:23,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:46:23,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:46:23,965 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:46:23,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:46:23,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:46:23,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:46:23,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:46:23,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:46:23,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:46:23,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:46:23,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:46:23,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:46:23,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:46:23,967 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:46:23,967 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:46:23,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:46:23,968 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:46:23,968 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 -> 624e111eb11fc6cb53be17248f0e61e18bd8cc958dfb511134351ecf4f085f78 [2021-11-22 19:46:24,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:46:24,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:46:24,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:46:24,178 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:46:24,183 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:46:24,184 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_write_u8_harness.i [2021-11-22 19:46:24,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb19c2d1/0eb05f88eb5140f6ae2151a8a398dc63/FLAGadc4f79d8 [2021-11-22 19:46:24,909 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:46:24,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i [2021-11-22 19:46:24,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb19c2d1/0eb05f88eb5140f6ae2151a8a398dc63/FLAGadc4f79d8 [2021-11-22 19:46:25,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb19c2d1/0eb05f88eb5140f6ae2151a8a398dc63 [2021-11-22 19:46:25,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:46:25,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:46:25,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:46:25,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:46:25,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:46:25,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:46:25" (1/1) ... [2021-11-22 19:46:25,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7049d9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:25, skipping insertion in model container [2021-11-22 19:46:25,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:46:25" (1/1) ... [2021-11-22 19:46:25,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:46:25,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:46:25,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4495,4508] [2021-11-22 19:46:25,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4555,4568] [2021-11-22 19:46:26,061 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,062 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,064 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,065 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,067 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,079 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,081 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,083 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,083 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,355 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:46:26,357 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:46:26,357 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:46:26,358 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:46:26,359 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:46:26,360 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:46:26,360 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:46:26,360 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:46:26,361 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:46:26,361 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:46:26,472 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:46:26,602 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,603 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:46:26,722 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:46:26,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4495,4508] [2021-11-22 19:46:26,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_write_u8_harness.i[4555,4568] [2021-11-22 19:46:26,775 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,777 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,777 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,777 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,778 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,788 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,789 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,789 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,790 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,819 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:46:26,819 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:46:26,820 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:46:26,820 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:46:26,821 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:46:26,821 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:46:26,822 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:46:26,822 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:46:26,822 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:46:26,823 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:46:26,882 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:46:26,947 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,947 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:46:26,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:46:27,127 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:46:27,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27 WrapperNode [2021-11-22 19:46:27,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:46:27,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:46:27,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:46:27,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:46:27,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,353 INFO L137 Inliner]: procedures = 691, calls = 2619, calls flagged for inlining = 956, calls inlined = 43, statements flattened = 1300 [2021-11-22 19:46:27,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:46:27,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:46:27,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:46:27,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:46:27,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:46:27,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:46:27,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:46:27,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:46:27,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (1/1) ... [2021-11-22 19:46:27,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:46:27,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:46:27,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 19:46:27,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 19:46:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:46:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:46:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:46:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:46:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:46:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:46:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:46:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:46:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:46:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:46:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:46:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:46:27,803 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:46:27,804 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:46:28,766 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:46:28,776 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:46:28,777 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 19:46:28,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:46:28 BoogieIcfgContainer [2021-11-22 19:46:28,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:46:28,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:46:28,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:46:28,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:46:28,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:46:25" (1/3) ... [2021-11-22 19:46:28,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e24c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:46:28, skipping insertion in model container [2021-11-22 19:46:28,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:46:27" (2/3) ... [2021-11-22 19:46:28,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e24c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:46:28, skipping insertion in model container [2021-11-22 19:46:28,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:46:28" (3/3) ... [2021-11-22 19:46:28,785 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_write_u8_harness.i [2021-11-22 19:46:28,789 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:46:28,789 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-22 19:46:28,835 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:46:28,846 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 19:46:28,847 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-22 19:46:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 185 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 19:46:28,865 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:28,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:28,867 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:28,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash -27136647, now seen corresponding path program 1 times [2021-11-22 19:46:28,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:28,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808501779] [2021-11-22 19:46:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:28,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:29,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:29,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808501779] [2021-11-22 19:46:29,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808501779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:29,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:29,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:46:29,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758678822] [2021-11-22 19:46:29,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:29,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:46:29,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:46:29,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:46:29,377 INFO L87 Difference]: Start difference. First operand has 186 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 185 states have internal predecessors, (258), 0 states have call successors, (0), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:29,405 INFO L93 Difference]: Finished difference Result 368 states and 511 transitions. [2021-11-22 19:46:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:46:29,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-11-22 19:46:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:29,414 INFO L225 Difference]: With dead ends: 368 [2021-11-22 19:46:29,414 INFO L226 Difference]: Without dead ends: 181 [2021-11-22 19:46:29,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:46:29,420 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:29,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:46:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-22 19:46:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-11-22 19:46:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.3588235294117648) internal successors, (231), 180 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-11-22 19:46:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2021-11-22 19:46:29,459 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 38 [2021-11-22 19:46:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:29,461 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2021-11-22 19:46:29,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2021-11-22 19:46:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 19:46:29,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:29,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:29,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:46:29,465 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2001073661, now seen corresponding path program 1 times [2021-11-22 19:46:29,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:29,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45870842] [2021-11-22 19:46:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:29,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:29,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:29,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45870842] [2021-11-22 19:46:29,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45870842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:29,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:29,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:46:29,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005020127] [2021-11-22 19:46:29,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:29,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:46:29,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:46:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:46:29,676 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:29,767 INFO L93 Difference]: Finished difference Result 336 states and 428 transitions. [2021-11-22 19:46:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:46:29,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-11-22 19:46:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:29,771 INFO L225 Difference]: With dead ends: 336 [2021-11-22 19:46:29,771 INFO L226 Difference]: Without dead ends: 181 [2021-11-22 19:46:29,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:46:29,777 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 322 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:29,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 310 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:46:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-22 19:46:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-11-22 19:46:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 180 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2021-11-22 19:46:29,789 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 38 [2021-11-22 19:46:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:29,790 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2021-11-22 19:46:29,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2021-11-22 19:46:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-22 19:46:29,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:29,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:29,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:46:29,792 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash -58490273, now seen corresponding path program 1 times [2021-11-22 19:46:29,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:29,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561376762] [2021-11-22 19:46:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:29,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:29,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:29,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561376762] [2021-11-22 19:46:29,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561376762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:29,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:29,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:46:29,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090934686] [2021-11-22 19:46:29,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:29,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:46:29,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:46:29,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:46:29,938 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:30,049 INFO L93 Difference]: Finished difference Result 397 states and 508 transitions. [2021-11-22 19:46:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:46:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-22 19:46:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:30,051 INFO L225 Difference]: With dead ends: 397 [2021-11-22 19:46:30,051 INFO L226 Difference]: Without dead ends: 241 [2021-11-22 19:46:30,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:46:30,053 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 129 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:30,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 613 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:46:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-22 19:46:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 193. [2021-11-22 19:46:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 192 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 240 transitions. [2021-11-22 19:46:30,063 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 240 transitions. Word has length 50 [2021-11-22 19:46:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:30,064 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 240 transitions. [2021-11-22 19:46:30,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 240 transitions. [2021-11-22 19:46:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-22 19:46:30,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:30,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:30,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:46:30,066 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash 785515229, now seen corresponding path program 1 times [2021-11-22 19:46:30,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:30,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060028704] [2021-11-22 19:46:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:30,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:30,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:30,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060028704] [2021-11-22 19:46:30,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060028704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:30,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:30,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:46:30,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190920560] [2021-11-22 19:46:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:30,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:46:30,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:46:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:46:30,266 INFO L87 Difference]: Start difference. First operand 193 states and 240 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:30,364 INFO L93 Difference]: Finished difference Result 315 states and 388 transitions. [2021-11-22 19:46:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:46:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-22 19:46:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:30,365 INFO L225 Difference]: With dead ends: 315 [2021-11-22 19:46:30,366 INFO L226 Difference]: Without dead ends: 193 [2021-11-22 19:46:30,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:46:30,367 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 633 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:30,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 392 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:46:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-22 19:46:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-11-22 19:46:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 182 states have (on average 1.3021978021978022) internal successors, (237), 192 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2021-11-22 19:46:30,375 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 50 [2021-11-22 19:46:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:30,375 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2021-11-22 19:46:30,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2021-11-22 19:46:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 19:46:30,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:30,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:30,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:46:30,377 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1564101757, now seen corresponding path program 1 times [2021-11-22 19:46:30,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:30,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113383313] [2021-11-22 19:46:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:30,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:30,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:30,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113383313] [2021-11-22 19:46:30,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113383313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:30,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:30,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:46:30,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949831170] [2021-11-22 19:46:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:30,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:46:30,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:46:30,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:46:30,680 INFO L87 Difference]: Start difference. First operand 193 states and 237 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:30,890 INFO L93 Difference]: Finished difference Result 311 states and 368 transitions. [2021-11-22 19:46:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:46:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 19:46:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:30,892 INFO L225 Difference]: With dead ends: 311 [2021-11-22 19:46:30,892 INFO L226 Difference]: Without dead ends: 298 [2021-11-22 19:46:30,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:46:30,893 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 230 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:30,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 851 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:46:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-22 19:46:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 199. [2021-11-22 19:46:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 198 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2021-11-22 19:46:30,901 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 62 [2021-11-22 19:46:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:30,901 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2021-11-22 19:46:30,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2021-11-22 19:46:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 19:46:30,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:30,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:30,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:46:30,904 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2012168309, now seen corresponding path program 1 times [2021-11-22 19:46:30,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:30,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475612256] [2021-11-22 19:46:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:30,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:31,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:31,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475612256] [2021-11-22 19:46:31,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475612256] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:31,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:31,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:46:31,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147092739] [2021-11-22 19:46:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:31,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:46:31,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:31,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:46:31,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:31,168 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:31,846 INFO L93 Difference]: Finished difference Result 612 states and 759 transitions. [2021-11-22 19:46:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:46:31,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 19:46:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:31,848 INFO L225 Difference]: With dead ends: 612 [2021-11-22 19:46:31,848 INFO L226 Difference]: Without dead ends: 432 [2021-11-22 19:46:31,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:46:31,849 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 525 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:31,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 1849 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:46:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-11-22 19:46:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 214. [2021-11-22 19:46:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 203 states have (on average 1.2758620689655173) internal successors, (259), 213 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 259 transitions. [2021-11-22 19:46:31,857 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 259 transitions. Word has length 66 [2021-11-22 19:46:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:31,858 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 259 transitions. [2021-11-22 19:46:31,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 259 transitions. [2021-11-22 19:46:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 19:46:31,859 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:31,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:31,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:46:31,859 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:31,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2024633549, now seen corresponding path program 1 times [2021-11-22 19:46:31,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:31,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313340887] [2021-11-22 19:46:31,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:31,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:32,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:32,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313340887] [2021-11-22 19:46:32,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313340887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:32,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:32,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:46:32,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911054971] [2021-11-22 19:46:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:32,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:46:32,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:32,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:46:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:46:32,093 INFO L87 Difference]: Start difference. First operand 214 states and 259 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:32,386 INFO L93 Difference]: Finished difference Result 596 states and 719 transitions. [2021-11-22 19:46:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:46:32,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 19:46:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:32,388 INFO L225 Difference]: With dead ends: 596 [2021-11-22 19:46:32,388 INFO L226 Difference]: Without dead ends: 406 [2021-11-22 19:46:32,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:46:32,389 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 556 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:32,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 466 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:46:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-22 19:46:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 234. [2021-11-22 19:46:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 223 states have (on average 1.251121076233184) internal successors, (279), 233 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2021-11-22 19:46:32,397 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 66 [2021-11-22 19:46:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:32,397 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2021-11-22 19:46:32,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2021-11-22 19:46:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 19:46:32,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:32,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:32,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:46:32,399 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:32,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1344575179, now seen corresponding path program 1 times [2021-11-22 19:46:32,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:32,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470955418] [2021-11-22 19:46:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:32,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:32,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:32,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470955418] [2021-11-22 19:46:32,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470955418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:32,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:32,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:46:32,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69273327] [2021-11-22 19:46:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:32,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:46:32,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:32,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:46:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:32,691 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:33,106 INFO L93 Difference]: Finished difference Result 631 states and 742 transitions. [2021-11-22 19:46:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:46:33,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 19:46:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:33,109 INFO L225 Difference]: With dead ends: 631 [2021-11-22 19:46:33,109 INFO L226 Difference]: Without dead ends: 501 [2021-11-22 19:46:33,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:46:33,110 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 721 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:33,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 855 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:46:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-11-22 19:46:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 272. [2021-11-22 19:46:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 261 states have (on average 1.2452107279693487) internal successors, (325), 271 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-11-22 19:46:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 325 transitions. [2021-11-22 19:46:33,119 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 325 transitions. Word has length 66 [2021-11-22 19:46:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:33,119 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 325 transitions. [2021-11-22 19:46:33,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 325 transitions. [2021-11-22 19:46:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 19:46:33,120 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:33,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:33,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:46:33,121 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1103878777, now seen corresponding path program 1 times [2021-11-22 19:46:33,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:33,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867690555] [2021-11-22 19:46:33,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:33,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:33,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:33,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867690555] [2021-11-22 19:46:33,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867690555] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:33,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:33,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:46:33,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582638027] [2021-11-22 19:46:33,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:33,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:46:33,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:46:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:46:33,674 INFO L87 Difference]: Start difference. First operand 272 states and 325 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:35,021 INFO L93 Difference]: Finished difference Result 807 states and 961 transitions. [2021-11-22 19:46:35,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-22 19:46:35,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 19:46:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:35,024 INFO L225 Difference]: With dead ends: 807 [2021-11-22 19:46:35,024 INFO L226 Difference]: Without dead ends: 614 [2021-11-22 19:46:35,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2021-11-22 19:46:35,025 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 2014 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2014 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:35,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2014 Valid, 1472 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:46:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-22 19:46:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 386. [2021-11-22 19:46:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 375 states have (on average 1.2346666666666666) internal successors, (463), 385 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 463 transitions. [2021-11-22 19:46:35,040 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 463 transitions. Word has length 66 [2021-11-22 19:46:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:35,040 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 463 transitions. [2021-11-22 19:46:35,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 463 transitions. [2021-11-22 19:46:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 19:46:35,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:35,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:35,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:46:35,042 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1362044215, now seen corresponding path program 1 times [2021-11-22 19:46:35,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:35,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080727845] [2021-11-22 19:46:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:35,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:35,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:35,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080727845] [2021-11-22 19:46:35,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080727845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:35,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:35,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:46:35,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660730719] [2021-11-22 19:46:35,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:35,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:46:35,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:35,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:46:35,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:46:35,376 INFO L87 Difference]: Start difference. First operand 386 states and 463 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:36,231 INFO L93 Difference]: Finished difference Result 878 states and 1040 transitions. [2021-11-22 19:46:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:46:36,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 19:46:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:36,235 INFO L225 Difference]: With dead ends: 878 [2021-11-22 19:46:36,235 INFO L226 Difference]: Without dead ends: 687 [2021-11-22 19:46:36,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:46:36,237 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 805 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:36,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 1495 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:46:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-11-22 19:46:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 391. [2021-11-22 19:46:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 380 states have (on average 1.236842105263158) internal successors, (470), 390 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 470 transitions. [2021-11-22 19:46:36,253 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 470 transitions. Word has length 66 [2021-11-22 19:46:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:36,254 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 470 transitions. [2021-11-22 19:46:36,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 470 transitions. [2021-11-22 19:46:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 19:46:36,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:36,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:36,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:46:36,260 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash -329131405, now seen corresponding path program 1 times [2021-11-22 19:46:36,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:36,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316125694] [2021-11-22 19:46:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:36,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:36,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:36,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316125694] [2021-11-22 19:46:36,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316125694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:36,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:36,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:46:36,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882464754] [2021-11-22 19:46:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:36,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:46:36,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:46:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:46:36,622 INFO L87 Difference]: Start difference. First operand 391 states and 470 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:37,599 INFO L93 Difference]: Finished difference Result 867 states and 1021 transitions. [2021-11-22 19:46:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:46:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 19:46:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:37,602 INFO L225 Difference]: With dead ends: 867 [2021-11-22 19:46:37,602 INFO L226 Difference]: Without dead ends: 692 [2021-11-22 19:46:37,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:46:37,603 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 816 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:37,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 1599 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:46:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-11-22 19:46:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 402. [2021-11-22 19:46:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 391 states have (on average 1.2327365728900255) internal successors, (482), 401 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 482 transitions. [2021-11-22 19:46:37,620 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 482 transitions. Word has length 66 [2021-11-22 19:46:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:37,620 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 482 transitions. [2021-11-22 19:46:37,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 482 transitions. [2021-11-22 19:46:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 19:46:37,621 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:37,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:37,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:46:37,622 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash 350926965, now seen corresponding path program 1 times [2021-11-22 19:46:37,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:37,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227503026] [2021-11-22 19:46:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:37,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:37,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:37,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227503026] [2021-11-22 19:46:37,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227503026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:37,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:37,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:46:37,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205904385] [2021-11-22 19:46:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:37,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:46:37,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:46:37,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:46:37,811 INFO L87 Difference]: Start difference. First operand 402 states and 482 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:38,129 INFO L93 Difference]: Finished difference Result 916 states and 1095 transitions. [2021-11-22 19:46:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:46:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 19:46:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:38,132 INFO L225 Difference]: With dead ends: 916 [2021-11-22 19:46:38,132 INFO L226 Difference]: Without dead ends: 580 [2021-11-22 19:46:38,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:46:38,133 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 160 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:38,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 897 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:46:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-11-22 19:46:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 400. [2021-11-22 19:46:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 399 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 468 transitions. [2021-11-22 19:46:38,149 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 468 transitions. Word has length 66 [2021-11-22 19:46:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:38,149 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 468 transitions. [2021-11-22 19:46:38,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 468 transitions. [2021-11-22 19:46:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 19:46:38,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:38,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:38,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:46:38,151 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:38,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash -658071658, now seen corresponding path program 1 times [2021-11-22 19:46:38,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:38,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353649319] [2021-11-22 19:46:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:38,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:38,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:38,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353649319] [2021-11-22 19:46:38,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353649319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:38,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:38,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:46:38,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611788751] [2021-11-22 19:46:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:38,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:46:38,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:46:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:46:38,294 INFO L87 Difference]: Start difference. First operand 400 states and 468 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:38,329 INFO L93 Difference]: Finished difference Result 488 states and 566 transitions. [2021-11-22 19:46:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:46:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 19:46:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:38,332 INFO L225 Difference]: With dead ends: 488 [2021-11-22 19:46:38,332 INFO L226 Difference]: Without dead ends: 452 [2021-11-22 19:46:38,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:46:38,333 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 105 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:38,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 881 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:46:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-11-22 19:46:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 403. [2021-11-22 19:46:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 392 states have (on average 1.2015306122448979) internal successors, (471), 402 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 471 transitions. [2021-11-22 19:46:38,365 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 471 transitions. Word has length 67 [2021-11-22 19:46:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:38,365 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 471 transitions. [2021-11-22 19:46:38,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 471 transitions. [2021-11-22 19:46:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-22 19:46:38,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:38,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:38,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:46:38,368 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1075510280, now seen corresponding path program 1 times [2021-11-22 19:46:38,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:38,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923754253] [2021-11-22 19:46:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:38,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:38,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:38,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923754253] [2021-11-22 19:46:38,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923754253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:38,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:38,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:46:38,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281454963] [2021-11-22 19:46:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:38,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:46:38,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:38,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:46:38,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:46:38,568 INFO L87 Difference]: Start difference. First operand 403 states and 471 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:38,656 INFO L93 Difference]: Finished difference Result 427 states and 498 transitions. [2021-11-22 19:46:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:46:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-22 19:46:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:38,658 INFO L225 Difference]: With dead ends: 427 [2021-11-22 19:46:38,658 INFO L226 Difference]: Without dead ends: 425 [2021-11-22 19:46:38,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:38,659 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 437 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:38,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 607 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:46:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-11-22 19:46:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 401. [2021-11-22 19:46:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 1.1994884910485935) internal successors, (469), 400 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 469 transitions. [2021-11-22 19:46:38,674 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 469 transitions. Word has length 68 [2021-11-22 19:46:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:38,675 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 469 transitions. [2021-11-22 19:46:38,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 469 transitions. [2021-11-22 19:46:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-22 19:46:38,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:38,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:38,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:46:38,676 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1645574354, now seen corresponding path program 1 times [2021-11-22 19:46:38,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:38,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182990347] [2021-11-22 19:46:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:38,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:38,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:38,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182990347] [2021-11-22 19:46:38,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182990347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:38,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:38,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:46:38,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855617221] [2021-11-22 19:46:38,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:38,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:46:38,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:46:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:38,826 INFO L87 Difference]: Start difference. First operand 401 states and 469 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:39,149 INFO L93 Difference]: Finished difference Result 606 states and 692 transitions. [2021-11-22 19:46:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:46:39,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-22 19:46:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:39,152 INFO L225 Difference]: With dead ends: 606 [2021-11-22 19:46:39,152 INFO L226 Difference]: Without dead ends: 589 [2021-11-22 19:46:39,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:46:39,153 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 255 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:39,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 1152 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:46:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-11-22 19:46:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 405. [2021-11-22 19:46:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 395 states have (on average 1.1949367088607594) internal successors, (472), 404 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 472 transitions. [2021-11-22 19:46:39,170 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 472 transitions. Word has length 68 [2021-11-22 19:46:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:39,170 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 472 transitions. [2021-11-22 19:46:39,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 472 transitions. [2021-11-22 19:46:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-22 19:46:39,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:39,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:39,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:46:39,172 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1840046316, now seen corresponding path program 1 times [2021-11-22 19:46:39,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:39,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632718975] [2021-11-22 19:46:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:39,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:39,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:39,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632718975] [2021-11-22 19:46:39,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632718975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:39,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:39,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:46:39,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562845947] [2021-11-22 19:46:39,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:39,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:46:39,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:39,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:46:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:46:39,538 INFO L87 Difference]: Start difference. First operand 405 states and 472 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:42,133 INFO L93 Difference]: Finished difference Result 1397 states and 1612 transitions. [2021-11-22 19:46:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-22 19:46:42,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-22 19:46:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:42,137 INFO L225 Difference]: With dead ends: 1397 [2021-11-22 19:46:42,137 INFO L226 Difference]: Without dead ends: 1059 [2021-11-22 19:46:42,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=706, Invalid=2600, Unknown=0, NotChecked=0, Total=3306 [2021-11-22 19:46:42,139 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 1729 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:42,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1729 Valid, 1711 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:46:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2021-11-22 19:46:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 511. [2021-11-22 19:46:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 501 states have (on average 1.1936127744510978) internal successors, (598), 510 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 598 transitions. [2021-11-22 19:46:42,162 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 598 transitions. Word has length 68 [2021-11-22 19:46:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:42,163 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 598 transitions. [2021-11-22 19:46:42,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 598 transitions. [2021-11-22 19:46:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:46:42,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:42,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:42,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:46:42,166 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:42,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1410311426, now seen corresponding path program 1 times [2021-11-22 19:46:42,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:42,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218922663] [2021-11-22 19:46:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:42,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:42,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:42,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218922663] [2021-11-22 19:46:42,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218922663] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:42,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:42,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:46:42,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956459154] [2021-11-22 19:46:42,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:42,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:46:42,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:42,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:46:42,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:46:42,588 INFO L87 Difference]: Start difference. First operand 511 states and 598 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:44,309 INFO L93 Difference]: Finished difference Result 1131 states and 1290 transitions. [2021-11-22 19:46:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-22 19:46:44,309 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 19:46:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:44,313 INFO L225 Difference]: With dead ends: 1131 [2021-11-22 19:46:44,313 INFO L226 Difference]: Without dead ends: 1057 [2021-11-22 19:46:44,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2021-11-22 19:46:44,315 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 1255 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:44,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1255 Valid, 3015 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:46:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-11-22 19:46:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 644. [2021-11-22 19:46:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 634 states have (on average 1.1892744479495267) internal successors, (754), 643 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 754 transitions. [2021-11-22 19:46:44,339 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 754 transitions. Word has length 69 [2021-11-22 19:46:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:44,340 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 754 transitions. [2021-11-22 19:46:44,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 754 transitions. [2021-11-22 19:46:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 19:46:44,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:44,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:44,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:46:44,343 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:44,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1880968767, now seen corresponding path program 1 times [2021-11-22 19:46:44,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:44,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472852035] [2021-11-22 19:46:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:44,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:44,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472852035] [2021-11-22 19:46:44,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472852035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:44,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:44,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:46:44,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643903654] [2021-11-22 19:46:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:44,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:46:44,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:46:44,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:46:44,521 INFO L87 Difference]: Start difference. First operand 644 states and 754 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-11-22 19:46:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:44,723 INFO L93 Difference]: Finished difference Result 1287 states and 1491 transitions. [2021-11-22 19:46:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:46:44,723 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-11-22 19:46:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:44,725 INFO L225 Difference]: With dead ends: 1287 [2021-11-22 19:46:44,725 INFO L226 Difference]: Without dead ends: 709 [2021-11-22 19:46:44,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:46:44,726 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 117 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:44,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1340 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:46:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-11-22 19:46:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 640. [2021-11-22 19:46:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 630 states have (on average 1.1571428571428573) internal successors, (729), 639 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 729 transitions. [2021-11-22 19:46:44,763 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 729 transitions. Word has length 70 [2021-11-22 19:46:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:44,763 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 729 transitions. [2021-11-22 19:46:44,763 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-11-22 19:46:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 729 transitions. [2021-11-22 19:46:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 19:46:44,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:44,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:44,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:46:44,765 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1521600790, now seen corresponding path program 1 times [2021-11-22 19:46:44,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:44,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914635015] [2021-11-22 19:46:44,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:44,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:45,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:45,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914635015] [2021-11-22 19:46:45,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914635015] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:45,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:45,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:46:45,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551036563] [2021-11-22 19:46:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:45,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:46:45,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:45,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:46:45,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:46:45,397 INFO L87 Difference]: Start difference. First operand 640 states and 729 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:45,976 INFO L93 Difference]: Finished difference Result 778 states and 882 transitions. [2021-11-22 19:46:45,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:46:45,977 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 19:46:45,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:45,979 INFO L225 Difference]: With dead ends: 778 [2021-11-22 19:46:45,979 INFO L226 Difference]: Without dead ends: 776 [2021-11-22 19:46:45,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:46:45,980 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 1049 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:45,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1049 Valid, 1111 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:46:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2021-11-22 19:46:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 694. [2021-11-22 19:46:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 684 states have (on average 1.1578947368421053) internal successors, (792), 693 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 792 transitions. [2021-11-22 19:46:46,005 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 792 transitions. Word has length 70 [2021-11-22 19:46:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:46,005 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 792 transitions. [2021-11-22 19:46:46,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 792 transitions. [2021-11-22 19:46:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 19:46:46,007 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:46,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:46,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:46:46,007 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -552074714, now seen corresponding path program 1 times [2021-11-22 19:46:46,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:46,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617253193] [2021-11-22 19:46:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:46,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:46,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:46,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617253193] [2021-11-22 19:46:46,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617253193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:46,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:46,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:46:46,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042074223] [2021-11-22 19:46:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:46,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:46:46,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:46:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:46:46,100 INFO L87 Difference]: Start difference. First operand 694 states and 792 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:46,182 INFO L93 Difference]: Finished difference Result 1159 states and 1320 transitions. [2021-11-22 19:46:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:46:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-11-22 19:46:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:46,184 INFO L225 Difference]: With dead ends: 1159 [2021-11-22 19:46:46,184 INFO L226 Difference]: Without dead ends: 536 [2021-11-22 19:46:46,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:46:46,188 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 30 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:46,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 574 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:46:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-11-22 19:46:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 512. [2021-11-22 19:46:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 502 states have (on average 1.1414342629482073) internal successors, (573), 511 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 573 transitions. [2021-11-22 19:46:46,211 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 573 transitions. Word has length 72 [2021-11-22 19:46:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:46,211 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 573 transitions. [2021-11-22 19:46:46,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 573 transitions. [2021-11-22 19:46:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 19:46:46,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:46,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:46,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:46:46,213 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1969339796, now seen corresponding path program 1 times [2021-11-22 19:46:46,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:46,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195088299] [2021-11-22 19:46:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:46,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:47,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195088299] [2021-11-22 19:46:47,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195088299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:47,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:47,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:46:47,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098127528] [2021-11-22 19:46:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:47,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:46:47,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:46:47,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:46:47,212 INFO L87 Difference]: Start difference. First operand 512 states and 573 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:47,632 INFO L93 Difference]: Finished difference Result 870 states and 964 transitions. [2021-11-22 19:46:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:46:47,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-11-22 19:46:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:47,633 INFO L225 Difference]: With dead ends: 870 [2021-11-22 19:46:47,633 INFO L226 Difference]: Without dead ends: 437 [2021-11-22 19:46:47,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:46:47,635 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 951 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:47,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [951 Valid, 888 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:46:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-22 19:46:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 352. [2021-11-22 19:46:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.1461988304093567) internal successors, (392), 351 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 392 transitions. [2021-11-22 19:46:47,649 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 392 transitions. Word has length 72 [2021-11-22 19:46:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:47,649 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 392 transitions. [2021-11-22 19:46:47,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:47,650 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 392 transitions. [2021-11-22 19:46:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-22 19:46:47,650 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:47,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:47,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:46:47,651 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1361604461, now seen corresponding path program 1 times [2021-11-22 19:46:47,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:47,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128767714] [2021-11-22 19:46:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:47,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:47,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-11-22 19:46:47,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:47,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128767714] [2021-11-22 19:46:47,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128767714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:47,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:47,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:46:47,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807214871] [2021-11-22 19:46:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:47,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:46:47,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:46:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:47,904 INFO L87 Difference]: Start difference. First operand 352 states and 392 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:48,377 INFO L93 Difference]: Finished difference Result 810 states and 903 transitions. [2021-11-22 19:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:46:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-22 19:46:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:48,381 INFO L225 Difference]: With dead ends: 810 [2021-11-22 19:46:48,381 INFO L226 Difference]: Without dead ends: 627 [2021-11-22 19:46:48,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:46:48,382 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 718 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:48,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 878 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:46:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-11-22 19:46:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 368. [2021-11-22 19:46:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 358 states have (on average 1.1396648044692737) internal successors, (408), 367 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 408 transitions. [2021-11-22 19:46:48,430 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 408 transitions. Word has length 78 [2021-11-22 19:46:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:48,431 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 408 transitions. [2021-11-22 19:46:48,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 408 transitions. [2021-11-22 19:46:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-22 19:46:48,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:48,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:48,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:46:48,433 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1086849495, now seen corresponding path program 1 times [2021-11-22 19:46:48,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:48,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318872591] [2021-11-22 19:46:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:48,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:48,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:48,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318872591] [2021-11-22 19:46:48,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318872591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:48,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:48,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:46:48,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482420291] [2021-11-22 19:46:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:48,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:46:48,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:48,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:46:48,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:46:48,752 INFO L87 Difference]: Start difference. First operand 368 states and 408 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:49,984 INFO L93 Difference]: Finished difference Result 1123 states and 1245 transitions. [2021-11-22 19:46:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 19:46:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-22 19:46:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:49,988 INFO L225 Difference]: With dead ends: 1123 [2021-11-22 19:46:49,988 INFO L226 Difference]: Without dead ends: 914 [2021-11-22 19:46:49,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2021-11-22 19:46:49,989 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1002 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:49,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1002 Valid, 2063 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 19:46:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-11-22 19:46:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 404. [2021-11-22 19:46:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.131979695431472) internal successors, (446), 403 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 446 transitions. [2021-11-22 19:46:50,037 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 446 transitions. Word has length 78 [2021-11-22 19:46:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:50,037 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 446 transitions. [2021-11-22 19:46:50,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 446 transitions. [2021-11-22 19:46:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-22 19:46:50,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:50,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:50,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:46:50,039 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2116208793, now seen corresponding path program 1 times [2021-11-22 19:46:50,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:50,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528785009] [2021-11-22 19:46:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:50,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:50,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:50,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528785009] [2021-11-22 19:46:50,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528785009] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:50,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:50,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:46:50,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465838129] [2021-11-22 19:46:50,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:50,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:46:50,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:46:50,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:46:50,526 INFO L87 Difference]: Start difference. First operand 404 states and 446 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:51,226 INFO L93 Difference]: Finished difference Result 644 states and 709 transitions. [2021-11-22 19:46:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 19:46:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-22 19:46:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:51,231 INFO L225 Difference]: With dead ends: 644 [2021-11-22 19:46:51,231 INFO L226 Difference]: Without dead ends: 481 [2021-11-22 19:46:51,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:46:51,232 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 961 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:51,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 1313 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:46:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-11-22 19:46:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 392. [2021-11-22 19:46:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 382 states have (on average 1.1335078534031413) internal successors, (433), 391 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 433 transitions. [2021-11-22 19:46:51,252 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 433 transitions. Word has length 78 [2021-11-22 19:46:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:51,252 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 433 transitions. [2021-11-22 19:46:51,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 433 transitions. [2021-11-22 19:46:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:46:51,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:51,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:51,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 19:46:51,254 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1084937190, now seen corresponding path program 1 times [2021-11-22 19:46:51,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996545979] [2021-11-22 19:46:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:51,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:51,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:51,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996545979] [2021-11-22 19:46:51,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996545979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:51,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:51,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:46:51,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753890012] [2021-11-22 19:46:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:51,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:46:51,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:51,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:46:51,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:51,535 INFO L87 Difference]: Start difference. First operand 392 states and 433 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:52,333 INFO L93 Difference]: Finished difference Result 1164 states and 1283 transitions. [2021-11-22 19:46:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:46:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:46:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:52,336 INFO L225 Difference]: With dead ends: 1164 [2021-11-22 19:46:52,336 INFO L226 Difference]: Without dead ends: 913 [2021-11-22 19:46:52,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:46:52,337 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 639 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:52,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 1629 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:46:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-11-22 19:46:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 400. [2021-11-22 19:46:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 390 states have (on average 1.1307692307692307) internal successors, (441), 399 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 441 transitions. [2021-11-22 19:46:52,361 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 441 transitions. Word has length 81 [2021-11-22 19:46:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 441 transitions. [2021-11-22 19:46:52,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 441 transitions. [2021-11-22 19:46:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:46:52,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:52,363 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:52,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 19:46:52,363 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:52,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash -883113256, now seen corresponding path program 1 times [2021-11-22 19:46:52,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:52,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199276347] [2021-11-22 19:46:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:52,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:52,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:52,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199276347] [2021-11-22 19:46:52,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199276347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:52,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:52,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:46:52,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998548013] [2021-11-22 19:46:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:52,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:46:52,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:46:52,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:46:52,587 INFO L87 Difference]: Start difference. First operand 400 states and 441 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:53,228 INFO L93 Difference]: Finished difference Result 804 states and 889 transitions. [2021-11-22 19:46:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:46:53,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:46:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:53,230 INFO L225 Difference]: With dead ends: 804 [2021-11-22 19:46:53,230 INFO L226 Difference]: Without dead ends: 717 [2021-11-22 19:46:53,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:46:53,231 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 436 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:53,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 1717 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:46:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-11-22 19:46:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 424. [2021-11-22 19:46:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 414 states have (on average 1.1304347826086956) internal successors, (468), 423 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 468 transitions. [2021-11-22 19:46:53,253 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 468 transitions. Word has length 81 [2021-11-22 19:46:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:53,253 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 468 transitions. [2021-11-22 19:46:53,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 468 transitions. [2021-11-22 19:46:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 19:46:53,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:53,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:53,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 19:46:53,255 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1720678420, now seen corresponding path program 1 times [2021-11-22 19:46:53,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:53,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837509806] [2021-11-22 19:46:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:53,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:53,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:53,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837509806] [2021-11-22 19:46:53,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837509806] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:53,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:53,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:46:53,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701183886] [2021-11-22 19:46:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:53,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:46:53,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:46:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:46:53,552 INFO L87 Difference]: Start difference. First operand 424 states and 468 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:54,273 INFO L93 Difference]: Finished difference Result 790 states and 872 transitions. [2021-11-22 19:46:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:46:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 19:46:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:54,276 INFO L225 Difference]: With dead ends: 790 [2021-11-22 19:46:54,276 INFO L226 Difference]: Without dead ends: 717 [2021-11-22 19:46:54,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:46:54,277 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 534 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:54,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 1712 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:46:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-11-22 19:46:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 438. [2021-11-22 19:46:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 428 states have (on average 1.1261682242990654) internal successors, (482), 437 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 482 transitions. [2021-11-22 19:46:54,298 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 482 transitions. Word has length 81 [2021-11-22 19:46:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:54,298 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 482 transitions. [2021-11-22 19:46:54,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 482 transitions. [2021-11-22 19:46:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:46:54,300 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:54,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:54,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 19:46:54,300 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash 317299277, now seen corresponding path program 1 times [2021-11-22 19:46:54,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:54,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197210783] [2021-11-22 19:46:54,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:54,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:54,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:54,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197210783] [2021-11-22 19:46:54,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197210783] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:54,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:54,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:46:54,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437625161] [2021-11-22 19:46:54,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:54,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:46:54,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:54,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:46:54,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:54,591 INFO L87 Difference]: Start difference. First operand 438 states and 482 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:55,092 INFO L93 Difference]: Finished difference Result 908 states and 1003 transitions. [2021-11-22 19:46:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:46:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-22 19:46:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:55,095 INFO L225 Difference]: With dead ends: 908 [2021-11-22 19:46:55,095 INFO L226 Difference]: Without dead ends: 709 [2021-11-22 19:46:55,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:46:55,096 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 590 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:55,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 1316 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:46:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-11-22 19:46:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 417. [2021-11-22 19:46:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 407 states have (on average 1.1253071253071254) internal successors, (458), 416 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 458 transitions. [2021-11-22 19:46:55,116 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 458 transitions. Word has length 83 [2021-11-22 19:46:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:55,117 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 458 transitions. [2021-11-22 19:46:55,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 458 transitions. [2021-11-22 19:46:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 19:46:55,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:55,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:55,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 19:46:55,119 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash -778029948, now seen corresponding path program 1 times [2021-11-22 19:46:55,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:55,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052840263] [2021-11-22 19:46:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:55,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:55,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:55,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052840263] [2021-11-22 19:46:55,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052840263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:55,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:55,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:46:55,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415171574] [2021-11-22 19:46:55,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:55,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:46:55,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:46:55,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:46:55,323 INFO L87 Difference]: Start difference. First operand 417 states and 458 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:55,538 INFO L93 Difference]: Finished difference Result 799 states and 883 transitions. [2021-11-22 19:46:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:46:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 19:46:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:55,541 INFO L225 Difference]: With dead ends: 799 [2021-11-22 19:46:55,541 INFO L226 Difference]: Without dead ends: 594 [2021-11-22 19:46:55,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:46:55,542 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 384 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:55,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 608 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:46:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-11-22 19:46:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 409. [2021-11-22 19:46:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 399 states have (on average 1.117794486215539) internal successors, (446), 408 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 446 transitions. [2021-11-22 19:46:55,562 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 446 transitions. Word has length 84 [2021-11-22 19:46:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:55,562 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 446 transitions. [2021-11-22 19:46:55,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 446 transitions. [2021-11-22 19:46:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 19:46:55,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:55,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:55,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 19:46:55,564 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1928589446, now seen corresponding path program 1 times [2021-11-22 19:46:55,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:55,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315325100] [2021-11-22 19:46:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:55,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:55,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:55,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315325100] [2021-11-22 19:46:55,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315325100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:55,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:55,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:46:55,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033261499] [2021-11-22 19:46:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:55,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:46:55,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:46:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:46:55,780 INFO L87 Difference]: Start difference. First operand 409 states and 446 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:56,120 INFO L93 Difference]: Finished difference Result 650 states and 712 transitions. [2021-11-22 19:46:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:46:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 19:46:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:56,122 INFO L225 Difference]: With dead ends: 650 [2021-11-22 19:46:56,122 INFO L226 Difference]: Without dead ends: 563 [2021-11-22 19:46:56,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:46:56,123 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 480 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:56,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 919 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:46:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-11-22 19:46:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 415. [2021-11-22 19:46:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 405 states have (on average 1.1209876543209876) internal successors, (454), 414 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 454 transitions. [2021-11-22 19:46:56,143 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 454 transitions. Word has length 84 [2021-11-22 19:46:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:56,143 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 454 transitions. [2021-11-22 19:46:56,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 454 transitions. [2021-11-22 19:46:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 19:46:56,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:56,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:56,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 19:46:56,145 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 237413826, now seen corresponding path program 1 times [2021-11-22 19:46:56,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:56,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551712764] [2021-11-22 19:46:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:56,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:56,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:56,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551712764] [2021-11-22 19:46:56,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551712764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:56,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:56,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:46:56,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938198690] [2021-11-22 19:46:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:56,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:46:56,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:46:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:46:56,376 INFO L87 Difference]: Start difference. First operand 415 states and 454 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:56,820 INFO L93 Difference]: Finished difference Result 642 states and 702 transitions. [2021-11-22 19:46:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:46:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 19:46:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:56,822 INFO L225 Difference]: With dead ends: 642 [2021-11-22 19:46:56,822 INFO L226 Difference]: Without dead ends: 569 [2021-11-22 19:46:56,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:46:56,823 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 385 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:56,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 1213 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:46:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-11-22 19:46:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 429. [2021-11-22 19:46:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 419 states have (on average 1.1169451073985681) internal successors, (468), 428 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 468 transitions. [2021-11-22 19:46:56,844 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 468 transitions. Word has length 84 [2021-11-22 19:46:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:56,844 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 468 transitions. [2021-11-22 19:46:56,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 468 transitions. [2021-11-22 19:46:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 19:46:56,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:56,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:56,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 19:46:56,846 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1145198086, now seen corresponding path program 1 times [2021-11-22 19:46:56,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:56,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160148456] [2021-11-22 19:46:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:56,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:57,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:57,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160148456] [2021-11-22 19:46:57,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160148456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:57,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:57,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:46:57,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47216476] [2021-11-22 19:46:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:57,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:46:57,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:46:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:46:57,239 INFO L87 Difference]: Start difference. First operand 429 states and 468 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:57,973 INFO L93 Difference]: Finished difference Result 841 states and 913 transitions. [2021-11-22 19:46:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 19:46:57,974 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 19:46:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:57,975 INFO L225 Difference]: With dead ends: 841 [2021-11-22 19:46:57,975 INFO L226 Difference]: Without dead ends: 645 [2021-11-22 19:46:57,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:46:57,978 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 916 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:57,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 1772 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:46:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-11-22 19:46:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 440. [2021-11-22 19:46:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 430 states have (on average 1.113953488372093) internal successors, (479), 439 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 479 transitions. [2021-11-22 19:46:57,999 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 479 transitions. Word has length 84 [2021-11-22 19:46:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:58,000 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 479 transitions. [2021-11-22 19:46:58,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 479 transitions. [2021-11-22 19:46:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 19:46:58,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:58,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:58,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 19:46:58,002 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash -575155446, now seen corresponding path program 1 times [2021-11-22 19:46:58,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:58,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213056189] [2021-11-22 19:46:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:58,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:46:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:46:58,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:46:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213056189] [2021-11-22 19:46:58,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213056189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:46:58,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:46:58,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:46:58,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462295529] [2021-11-22 19:46:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:46:58,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:46:58,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:46:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:46:58,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:46:58,630 INFO L87 Difference]: Start difference. First operand 440 states and 479 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:46:59,608 INFO L93 Difference]: Finished difference Result 721 states and 781 transitions. [2021-11-22 19:46:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:46:59,609 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 19:46:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:46:59,611 INFO L225 Difference]: With dead ends: 721 [2021-11-22 19:46:59,611 INFO L226 Difference]: Without dead ends: 606 [2021-11-22 19:46:59,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:46:59,612 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 1116 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:46:59,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1116 Valid, 2179 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:46:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-11-22 19:46:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 441. [2021-11-22 19:46:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 431 states have (on average 1.1090487238979119) internal successors, (478), 440 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 478 transitions. [2021-11-22 19:46:59,636 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 478 transitions. Word has length 84 [2021-11-22 19:46:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:46:59,637 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 478 transitions. [2021-11-22 19:46:59,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:46:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 478 transitions. [2021-11-22 19:46:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 19:46:59,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:46:59,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:46:59,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 19:46:59,639 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:46:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:46:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash -963374140, now seen corresponding path program 1 times [2021-11-22 19:46:59,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:46:59,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907953354] [2021-11-22 19:46:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:46:59,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:46:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:00,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:00,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907953354] [2021-11-22 19:47:00,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907953354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:00,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:00,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:47:00,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103703269] [2021-11-22 19:47:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:00,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:47:00,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:47:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:47:00,401 INFO L87 Difference]: Start difference. First operand 441 states and 478 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:02,261 INFO L93 Difference]: Finished difference Result 882 states and 954 transitions. [2021-11-22 19:47:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 19:47:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 19:47:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:02,263 INFO L225 Difference]: With dead ends: 882 [2021-11-22 19:47:02,263 INFO L226 Difference]: Without dead ends: 638 [2021-11-22 19:47:02,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2021-11-22 19:47:02,265 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1416 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:02,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1416 Valid, 2067 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:47:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-11-22 19:47:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 366. [2021-11-22 19:47:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 356 states have (on average 1.1067415730337078) internal successors, (394), 365 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 394 transitions. [2021-11-22 19:47:02,286 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 394 transitions. Word has length 84 [2021-11-22 19:47:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:02,287 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 394 transitions. [2021-11-22 19:47:02,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 394 transitions. [2021-11-22 19:47:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:47:02,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:02,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:02,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-22 19:47:02,289 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash -232175038, now seen corresponding path program 1 times [2021-11-22 19:47:02,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655675210] [2021-11-22 19:47:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:02,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:02,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:02,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655675210] [2021-11-22 19:47:02,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655675210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:02,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:02,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:47:02,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014813963] [2021-11-22 19:47:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:02,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:47:02,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:02,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:47:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:47:02,502 INFO L87 Difference]: Start difference. First operand 366 states and 394 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:02,556 INFO L93 Difference]: Finished difference Result 518 states and 563 transitions. [2021-11-22 19:47:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:47:02,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-22 19:47:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:02,559 INFO L225 Difference]: With dead ends: 518 [2021-11-22 19:47:02,559 INFO L226 Difference]: Without dead ends: 412 [2021-11-22 19:47:02,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:47:02,560 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 235 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:02,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 715 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:47:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-11-22 19:47:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 355. [2021-11-22 19:47:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 345 states have (on average 1.107246376811594) internal successors, (382), 354 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 382 transitions. [2021-11-22 19:47:02,580 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 382 transitions. Word has length 85 [2021-11-22 19:47:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:02,580 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 382 transitions. [2021-11-22 19:47:02,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 382 transitions. [2021-11-22 19:47:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:47:02,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:02,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:02,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-22 19:47:02,582 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash -147220661, now seen corresponding path program 1 times [2021-11-22 19:47:02,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:02,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277258936] [2021-11-22 19:47:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:02,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:03,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:03,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277258936] [2021-11-22 19:47:03,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277258936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:03,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:03,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:47:03,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351520775] [2021-11-22 19:47:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:03,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:47:03,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:47:03,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:47:03,209 INFO L87 Difference]: Start difference. First operand 355 states and 382 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:04,043 INFO L93 Difference]: Finished difference Result 601 states and 649 transitions. [2021-11-22 19:47:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:47:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-22 19:47:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:04,045 INFO L225 Difference]: With dead ends: 601 [2021-11-22 19:47:04,045 INFO L226 Difference]: Without dead ends: 553 [2021-11-22 19:47:04,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:47:04,046 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 1425 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:04,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 1472 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:47:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-11-22 19:47:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 450. [2021-11-22 19:47:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 440 states have (on average 1.1090909090909091) internal successors, (488), 449 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 488 transitions. [2021-11-22 19:47:04,087 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 488 transitions. Word has length 85 [2021-11-22 19:47:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:04,087 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 488 transitions. [2021-11-22 19:47:04,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 488 transitions. [2021-11-22 19:47:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:47:04,088 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:04,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:04,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-22 19:47:04,088 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash -68305920, now seen corresponding path program 1 times [2021-11-22 19:47:04,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:04,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211337451] [2021-11-22 19:47:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:04,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:47:04,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:04,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211337451] [2021-11-22 19:47:04,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211337451] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:04,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:04,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:47:04,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832515808] [2021-11-22 19:47:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:04,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:47:04,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:47:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:47:04,479 INFO L87 Difference]: Start difference. First operand 450 states and 488 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-11-22 19:47:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:04,992 INFO L93 Difference]: Finished difference Result 500 states and 539 transitions. [2021-11-22 19:47:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:47:04,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-11-22 19:47:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:04,993 INFO L225 Difference]: With dead ends: 500 [2021-11-22 19:47:04,993 INFO L226 Difference]: Without dead ends: 355 [2021-11-22 19:47:04,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:47:04,994 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 447 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:04,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 1432 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:47:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-11-22 19:47:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 348. [2021-11-22 19:47:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 338 states have (on average 1.1035502958579881) internal successors, (373), 347 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 373 transitions. [2021-11-22 19:47:05,014 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 373 transitions. Word has length 87 [2021-11-22 19:47:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:05,014 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 373 transitions. [2021-11-22 19:47:05,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-11-22 19:47:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 373 transitions. [2021-11-22 19:47:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:47:05,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:05,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:05,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-22 19:47:05,015 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1411227847, now seen corresponding path program 1 times [2021-11-22 19:47:05,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:05,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911913213] [2021-11-22 19:47:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:05,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:05,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:05,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911913213] [2021-11-22 19:47:05,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911913213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:05,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:05,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:47:05,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296827956] [2021-11-22 19:47:05,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:05,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:47:05,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:05,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:47:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:47:05,857 INFO L87 Difference]: Start difference. First operand 348 states and 373 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-11-22 19:47:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:06,230 INFO L93 Difference]: Finished difference Result 457 states and 492 transitions. [2021-11-22 19:47:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:47:06,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-11-22 19:47:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:06,231 INFO L225 Difference]: With dead ends: 457 [2021-11-22 19:47:06,231 INFO L226 Difference]: Without dead ends: 390 [2021-11-22 19:47:06,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:47:06,232 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 557 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:06,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 771 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:47:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-22 19:47:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 341. [2021-11-22 19:47:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.1027190332326284) internal successors, (365), 340 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 365 transitions. [2021-11-22 19:47:06,252 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 365 transitions. Word has length 87 [2021-11-22 19:47:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:06,253 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 365 transitions. [2021-11-22 19:47:06,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-11-22 19:47:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 365 transitions. [2021-11-22 19:47:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:47:06,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:06,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:06,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-22 19:47:06,254 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash -279947773, now seen corresponding path program 1 times [2021-11-22 19:47:06,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:06,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964940839] [2021-11-22 19:47:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:06,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:07,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:07,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964940839] [2021-11-22 19:47:07,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964940839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:07,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:07,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-22 19:47:07,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019309582] [2021-11-22 19:47:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:07,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-22 19:47:07,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:07,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-22 19:47:07,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:47:07,615 INFO L87 Difference]: Start difference. First operand 341 states and 365 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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-11-22 19:47:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:09,253 INFO L93 Difference]: Finished difference Result 472 states and 509 transitions. [2021-11-22 19:47:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:47:09,253 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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-11-22 19:47:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:09,255 INFO L225 Difference]: With dead ends: 472 [2021-11-22 19:47:09,255 INFO L226 Difference]: Without dead ends: 394 [2021-11-22 19:47:09,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2021-11-22 19:47:09,256 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 1221 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:09,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1221 Valid, 1648 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:47:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-22 19:47:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 340. [2021-11-22 19:47:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 330 states have (on average 1.1) internal successors, (363), 339 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 363 transitions. [2021-11-22 19:47:09,278 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 363 transitions. Word has length 87 [2021-11-22 19:47:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:09,278 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 363 transitions. [2021-11-22 19:47:09,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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-11-22 19:47:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 363 transitions. [2021-11-22 19:47:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:47:09,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:09,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:09,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-22 19:47:09,280 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1868295675, now seen corresponding path program 1 times [2021-11-22 19:47:09,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:09,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229193135] [2021-11-22 19:47:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:09,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:10,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229193135] [2021-11-22 19:47:10,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229193135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:10,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:10,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-22 19:47:10,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904761271] [2021-11-22 19:47:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:10,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-22 19:47:10,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:10,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-22 19:47:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:47:10,563 INFO L87 Difference]: Start difference. First operand 340 states and 363 transitions. Second operand has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 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-11-22 19:47:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:11,659 INFO L93 Difference]: Finished difference Result 449 states and 482 transitions. [2021-11-22 19:47:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:47:11,660 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 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-11-22 19:47:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:11,661 INFO L225 Difference]: With dead ends: 449 [2021-11-22 19:47:11,661 INFO L226 Difference]: Without dead ends: 389 [2021-11-22 19:47:11,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2021-11-22 19:47:11,662 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 799 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:11,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [799 Valid, 1467 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:47:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-22 19:47:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 320. [2021-11-22 19:47:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.1) internal successors, (341), 319 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 341 transitions. [2021-11-22 19:47:11,681 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 341 transitions. Word has length 87 [2021-11-22 19:47:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:11,681 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 341 transitions. [2021-11-22 19:47:11,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 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-11-22 19:47:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 341 transitions. [2021-11-22 19:47:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-22 19:47:11,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:11,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:11,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-22 19:47:11,682 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1214270724, now seen corresponding path program 1 times [2021-11-22 19:47:11,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:11,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144258950] [2021-11-22 19:47:11,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:11,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:11,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:11,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144258950] [2021-11-22 19:47:11,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144258950] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:11,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:11,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:47:11,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261301589] [2021-11-22 19:47:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:11,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:47:11,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:47:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:47:11,905 INFO L87 Difference]: Start difference. First operand 320 states and 341 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:12,288 INFO L93 Difference]: Finished difference Result 537 states and 577 transitions. [2021-11-22 19:47:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:47:12,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-22 19:47:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:12,290 INFO L225 Difference]: With dead ends: 537 [2021-11-22 19:47:12,290 INFO L226 Difference]: Without dead ends: 388 [2021-11-22 19:47:12,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:47:12,291 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 208 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:12,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1158 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:47:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-22 19:47:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 320. [2021-11-22 19:47:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.096774193548387) internal successors, (340), 319 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 340 transitions. [2021-11-22 19:47:12,307 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 340 transitions. Word has length 89 [2021-11-22 19:47:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:12,307 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 340 transitions. [2021-11-22 19:47:12,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 340 transitions. [2021-11-22 19:47:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-22 19:47:12,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:12,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:12,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-22 19:47:12,308 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash 171932670, now seen corresponding path program 1 times [2021-11-22 19:47:12,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:12,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680773129] [2021-11-22 19:47:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:12,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:12,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:12,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680773129] [2021-11-22 19:47:12,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680773129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:12,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:12,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-22 19:47:12,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84043981] [2021-11-22 19:47:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:12,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 19:47:12,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 19:47:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:47:12,884 INFO L87 Difference]: Start difference. First operand 320 states and 340 transitions. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:14,629 INFO L93 Difference]: Finished difference Result 459 states and 494 transitions. [2021-11-22 19:47:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-22 19:47:14,629 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-22 19:47:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:14,631 INFO L225 Difference]: With dead ends: 459 [2021-11-22 19:47:14,631 INFO L226 Difference]: Without dead ends: 457 [2021-11-22 19:47:14,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=793, Invalid=3367, Unknown=0, NotChecked=0, Total=4160 [2021-11-22 19:47:14,633 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 931 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:14,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 1343 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:47:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-22 19:47:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 312. [2021-11-22 19:47:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 303 states have (on average 1.0957095709570956) internal successors, (332), 311 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 332 transitions. [2021-11-22 19:47:14,667 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 332 transitions. Word has length 89 [2021-11-22 19:47:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:14,668 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 332 transitions. [2021-11-22 19:47:14,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 332 transitions. [2021-11-22 19:47:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-22 19:47:14,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:14,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:14,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-22 19:47:14,669 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash -466373153, now seen corresponding path program 1 times [2021-11-22 19:47:14,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:14,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133794485] [2021-11-22 19:47:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:14,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:15,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133794485] [2021-11-22 19:47:15,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133794485] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:47:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660797347] [2021-11-22 19:47:15,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:15,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:47:15,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:47:15,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:47:15,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 19:47:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:15,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 2749 conjuncts, 108 conjunts are in the unsatisfiable core [2021-11-22 19:47:15,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:47:15,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:47:16,016 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:47:16,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-11-22 19:47:16,040 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-11-22 19:47:16,045 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 16 treesize of output 12 [2021-11-22 19:47:16,324 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 19:47:16,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2021-11-22 19:47:16,359 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 19:47:16,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-22 19:47:16,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:47:16,829 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 18 treesize of output 8 [2021-11-22 19:47:16,924 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:47:16,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-22 19:47:16,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-11-22 19:47:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:17,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:47:17,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:47:17,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:47:17,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:47:17,441 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) 18446744073709551616) 0))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|) is different from false [2021-11-22 19:47:17,452 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) 18446744073709551616) 0))) (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0)) is different from false [2021-11-22 19:47:17,507 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| Int) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| Int) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1816 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816)) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| v_ArrVal_1817)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) .cse1) 18446744073709551616) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6|)))) is different from false [2021-11-22 19:47:18,184 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1| (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| Int) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| Int) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1816 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816)) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| v_ArrVal_1817)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) .cse1) 18446744073709551616) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6|))))) is different from false [2021-11-22 19:47:18,234 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| Int) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| Int) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1816 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816)) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| v_ArrVal_1817)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) .cse1) 18446744073709551616) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6|))))) is different from false [2021-11-22 19:47:18,291 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) 18446744073709551616) 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| Int) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| Int) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1816 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816)) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| v_ArrVal_1817)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) .cse1) 18446744073709551616) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6|))))) is different from false [2021-11-22 19:47:18,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 243 [2021-11-22 19:47:19,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 8) v_ArrVal_1812))) (.cse4 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (or (let ((.cse0 (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) (.cse2 (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (.cse1 (or (forall ((v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= 0 (mod (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 8) v_ArrVal_1812)) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816) v_ArrVal_1817 v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) 18446744073709551616)))) (< 0 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) (not (= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))))) (and (or (not .cse0) (and (forall ((v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= (mod (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 8) v_ArrVal_1812)) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816) |c_ULTIMATE.start_bounded_malloc_#res#1.base| v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) .cse1) (not .cse2)) (or (and .cse0 .cse2) (and (forall ((v_arrayElimCell_8 Int) (v_ArrVal_1819 Int) (v_ArrVal_1818 (Array Int Int))) (not (= (mod (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 8) v_ArrVal_1812)) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816) v_arrayElimCell_8 v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) .cse1)))) (= (mod (select (select .cse3 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse4) 18446744073709551616) 0) (= (mod (select (select (store .cse3 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse4) 18446744073709551616) 0)))) is different from false [2021-11-22 19:47:22,726 INFO L354 Elim1Store]: treesize reduction 23, result has 58.9 percent of original size [2021-11-22 19:47:22,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 236 treesize of output 212 [2021-11-22 19:47:22,743 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:22,744 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 571 treesize of output 563 [2021-11-22 19:47:22,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 648 treesize of output 624 [2021-11-22 19:47:22,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 654 treesize of output 646 [2021-11-22 19:47:22,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 714 treesize of output 698 [2021-11-22 19:47:22,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 732 treesize of output 724 [2021-11-22 19:47:22,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 758 treesize of output 750 [2021-11-22 19:47:23,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-11-22 19:47:23,123 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:23,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-11-22 19:47:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:47:23,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660797347] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:47:23,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:47:23,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 43 [2021-11-22 19:47:23,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551177153] [2021-11-22 19:47:23,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:47:23,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-22 19:47:23,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:23,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-22 19:47:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=975, Unknown=12, NotChecked=710, Total=1806 [2021-11-22 19:47:23,414 INFO L87 Difference]: Start difference. First operand 312 states and 332 transitions. Second operand has 43 states, 43 states have (on average 5.837209302325581) internal successors, (251), 43 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:23,848 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) (let ((.cse0 (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|)) (.cse3 (not .cse4))) (and .cse0 (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) 16) 18446744073709551616) 0)) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| Int) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| Int) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1816 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (or (= (mod (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse2) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| v_ArrVal_1817)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) .cse2) 18446744073709551616) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6|)))) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) .cse3 (or (and .cse0 .cse3) (and .cse4 |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1|)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)))) is different from false [2021-11-22 19:47:23,852 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| Int) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| Int) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1816 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| v_ArrVal_1816)) (.cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (or (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse1) 18446744073709551616) 0) (not (= (mod (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_6|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6| v_ArrVal_1817)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) v_ArrVal_1818) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_1819) .cse1) 18446744073709551616) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_6|)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:47:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:26,472 INFO L93 Difference]: Finished difference Result 581 states and 623 transitions. [2021-11-22 19:47:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-22 19:47:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.837209302325581) internal successors, (251), 43 states have internal predecessors, (251), 0 states have call successors, (0), 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 96 [2021-11-22 19:47:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:26,474 INFO L225 Difference]: With dead ends: 581 [2021-11-22 19:47:26,474 INFO L226 Difference]: Without dead ends: 494 [2021-11-22 19:47:26,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 167 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=565, Invalid=3363, Unknown=26, NotChecked=1596, Total=5550 [2021-11-22 19:47:26,477 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 1369 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 5363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3511 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:26,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1369 Valid, 4097 Invalid, 5363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1787 Invalid, 0 Unknown, 3511 Unchecked, 1.1s Time] [2021-11-22 19:47:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-11-22 19:47:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 334. [2021-11-22 19:47:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 325 states have (on average 1.0953846153846154) internal successors, (356), 333 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 356 transitions. [2021-11-22 19:47:26,499 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 356 transitions. Word has length 96 [2021-11-22 19:47:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:26,500 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 356 transitions. [2021-11-22 19:47:26,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.837209302325581) internal successors, (251), 43 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 356 transitions. [2021-11-22 19:47:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-22 19:47:26,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:26,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:26,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 19:47:26,711 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,SelfDestructingSolverStorable42 [2021-11-22 19:47:26,711 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1899383335, now seen corresponding path program 1 times [2021-11-22 19:47:26,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:26,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006350012] [2021-11-22 19:47:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:26,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:27,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006350012] [2021-11-22 19:47:27,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006350012] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:47:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399006740] [2021-11-22 19:47:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:27,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:47:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:47:27,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:47:27,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 19:47:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:27,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 2746 conjuncts, 92 conjunts are in the unsatisfiable core [2021-11-22 19:47:27,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:47:27,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:47:27,904 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:47:27,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-11-22 19:47:27,917 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 16 treesize of output 12 [2021-11-22 19:47:28,010 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 19:47:28,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-22 19:47:28,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:47:28,285 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 18 treesize of output 8 [2021-11-22 19:47:28,404 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:47:28,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2021-11-22 19:47:28,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:47:28,487 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:28,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2021-11-22 19:47:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:28,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:47:28,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1928 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_1928) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_~len#1| (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)))) (<= (mod .cse0 18446744073709551616) (mod (select (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| .cse0) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))))) is different from false [2021-11-22 19:47:28,732 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1928 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_1928) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_~len#1| (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)))) (<= (mod .cse0 18446744073709551616) (mod (select (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| .cse0) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))))) |c_ULTIMATE.start_aws_byte_buf_write_#t~short1171#1|) is different from false [2021-11-22 19:47:28,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2021-11-22 19:47:28,743 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:47:28,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 87 treesize of output 75 [2021-11-22 19:47:28,757 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:47:28,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 66 [2021-11-22 19:47:29,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7| Int) (v_ArrVal_1927 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7| v_ArrVal_1927)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7|))) is different from false [2021-11-22 19:47:30,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2021-11-22 19:47:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:47:30,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399006740] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:47:30,409 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:47:30,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 33 [2021-11-22 19:47:30,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009851306] [2021-11-22 19:47:30,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:47:30,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-22 19:47:30,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-22 19:47:30,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=790, Unknown=3, NotChecked=174, Total=1056 [2021-11-22 19:47:30,411 INFO L87 Difference]: Start difference. First operand 334 states and 356 transitions. Second operand has 33 states, 33 states have (on average 7.090909090909091) internal successors, (234), 33 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-11-22 19:47:31,177 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7| Int) (v_ArrVal_1927 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7| v_ArrVal_1927)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) is different from false [2021-11-22 19:47:31,789 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7| Int) (v_ArrVal_1927 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_7|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7| v_ArrVal_1927)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_7|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0)) is different from false [2021-11-22 19:47:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:33,276 INFO L93 Difference]: Finished difference Result 512 states and 550 transitions. [2021-11-22 19:47:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 19:47:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.090909090909091) internal successors, (234), 33 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) Word has length 96 [2021-11-22 19:47:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:33,280 INFO L225 Difference]: With dead ends: 512 [2021-11-22 19:47:33,280 INFO L226 Difference]: Without dead ends: 440 [2021-11-22 19:47:33,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=310, Invalid=1960, Unknown=6, NotChecked=480, Total=2756 [2021-11-22 19:47:33,282 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 847 mSDsluCounter, 3391 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 789 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:33,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [847 Valid, 3564 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1069 Invalid, 0 Unknown, 789 Unchecked, 0.7s Time] [2021-11-22 19:47:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-22 19:47:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 348. [2021-11-22 19:47:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 339 states have (on average 1.0943952802359882) internal successors, (371), 347 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 371 transitions. [2021-11-22 19:47:33,309 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 371 transitions. Word has length 96 [2021-11-22 19:47:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:33,310 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 371 transitions. [2021-11-22 19:47:33,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.090909090909091) internal successors, (234), 33 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-11-22 19:47:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 371 transitions. [2021-11-22 19:47:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-22 19:47:33,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:33,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:33,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 19:47:33,539 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,SelfDestructingSolverStorable43 [2021-11-22 19:47:33,539 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash -143062932, now seen corresponding path program 1 times [2021-11-22 19:47:33,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:33,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89442843] [2021-11-22 19:47:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:33,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:34,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:34,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89442843] [2021-11-22 19:47:34,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89442843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:34,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:34,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:47:34,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316258243] [2021-11-22 19:47:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:34,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:47:34,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:34,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:47:34,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:47:34,530 INFO L87 Difference]: Start difference. First operand 348 states and 371 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:35,218 INFO L93 Difference]: Finished difference Result 391 states and 418 transitions. [2021-11-22 19:47:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:47:35,218 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-11-22 19:47:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:35,219 INFO L225 Difference]: With dead ends: 391 [2021-11-22 19:47:35,219 INFO L226 Difference]: Without dead ends: 324 [2021-11-22 19:47:35,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2021-11-22 19:47:35,220 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 842 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:35,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [842 Valid, 1073 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:47:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-22 19:47:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-11-22 19:47:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 315 states have (on average 1.0952380952380953) internal successors, (345), 323 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 345 transitions. [2021-11-22 19:47:35,244 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 345 transitions. Word has length 96 [2021-11-22 19:47:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:35,244 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 345 transitions. [2021-11-22 19:47:35,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 345 transitions. [2021-11-22 19:47:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:47:35,245 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:35,245 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:35,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-22 19:47:35,246 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash -405098837, now seen corresponding path program 1 times [2021-11-22 19:47:35,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:35,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307710470] [2021-11-22 19:47:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:35,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:35,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:35,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307710470] [2021-11-22 19:47:35,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307710470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:35,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:35,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:47:35,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050196075] [2021-11-22 19:47:35,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:35,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:47:35,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:47:35,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:47:35,470 INFO L87 Difference]: Start difference. First operand 324 states and 345 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:35,815 INFO L93 Difference]: Finished difference Result 474 states and 506 transitions. [2021-11-22 19:47:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:47:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-22 19:47:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:35,817 INFO L225 Difference]: With dead ends: 474 [2021-11-22 19:47:35,817 INFO L226 Difference]: Without dead ends: 415 [2021-11-22 19:47:35,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:47:35,818 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 360 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:35,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 820 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:47:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-11-22 19:47:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 324. [2021-11-22 19:47:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 315 states have (on average 1.092063492063492) internal successors, (344), 323 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 344 transitions. [2021-11-22 19:47:35,842 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 344 transitions. Word has length 97 [2021-11-22 19:47:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:35,843 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 344 transitions. [2021-11-22 19:47:35,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 344 transitions. [2021-11-22 19:47:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:47:35,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:35,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:35,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-22 19:47:35,844 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1426167191, now seen corresponding path program 1 times [2021-11-22 19:47:35,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:35,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638969544] [2021-11-22 19:47:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:35,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:37,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:37,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638969544] [2021-11-22 19:47:37,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638969544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:37,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:37,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-22 19:47:37,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309084258] [2021-11-22 19:47:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:37,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-22 19:47:37,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-22 19:47:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:47:37,093 INFO L87 Difference]: Start difference. First operand 324 states and 344 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:38,283 INFO L93 Difference]: Finished difference Result 373 states and 398 transitions. [2021-11-22 19:47:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:47:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-22 19:47:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:38,285 INFO L225 Difference]: With dead ends: 373 [2021-11-22 19:47:38,285 INFO L226 Difference]: Without dead ends: 371 [2021-11-22 19:47:38,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:47:38,286 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 770 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:38,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1156 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:47:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-11-22 19:47:38,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 328. [2021-11-22 19:47:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 319 states have (on average 1.0940438871473355) internal successors, (349), 327 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 349 transitions. [2021-11-22 19:47:38,312 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 349 transitions. Word has length 97 [2021-11-22 19:47:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:38,312 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 349 transitions. [2021-11-22 19:47:38,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 349 transitions. [2021-11-22 19:47:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 19:47:38,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:38,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:38,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-22 19:47:38,314 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 361465714, now seen corresponding path program 1 times [2021-11-22 19:47:38,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:38,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271951889] [2021-11-22 19:47:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:38,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:39,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:39,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271951889] [2021-11-22 19:47:39,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271951889] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:47:39,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226628284] [2021-11-22 19:47:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:39,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:47:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:47:39,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:47:39,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 19:47:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:40,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 111 conjunts are in the unsatisfiable core [2021-11-22 19:47:40,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:47:40,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:47:40,224 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:47:40,225 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-11-22 19:47:40,271 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 20 treesize of output 16 [2021-11-22 19:47:40,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-22 19:47:41,057 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:47:41,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-11-22 19:47:41,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-22 19:47:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:41,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:47:41,460 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2178) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2180) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 0))) is different from false [2021-11-22 19:47:41,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse0) v_ArrVal_2178) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2180) .cse0)) 0))) is different from false [2021-11-22 19:47:41,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) .cse0) v_ArrVal_2178) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset| v_ArrVal_2180) .cse0)) 0))) is different from false [2021-11-22 19:47:41,610 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2176 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8|) 0 v_ArrVal_2176)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2178)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2180) .cse1)) 0))) is different from false [2021-11-22 19:47:41,726 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 256) 0) (forall ((v_ArrVal_2176 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8|) 0 v_ArrVal_2176)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse1) v_ArrVal_2178)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2180) .cse1)) 0)))) is different from false [2021-11-22 19:47:42,091 INFO L354 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2021-11-22 19:47:42,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 252 treesize of output 196 [2021-11-22 19:47:42,109 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:42,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 276 treesize of output 280 [2021-11-22 19:47:42,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 324 [2021-11-22 19:47:42,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:47:42,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:47:42,778 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 19:47:42,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:42,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 216 treesize of output 196 [2021-11-22 19:47:42,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:47:42,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:47:42,920 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 19:47:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:47:43,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226628284] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:47:43,394 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:47:43,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 55 [2021-11-22 19:47:43,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348348825] [2021-11-22 19:47:43,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:47:43,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-22 19:47:43,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-22 19:47:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2213, Unknown=41, NotChecked=500, Total=2970 [2021-11-22 19:47:43,397 INFO L87 Difference]: Start difference. First operand 328 states and 349 transitions. Second operand has 55 states, 55 states have (on average 5.0) internal successors, (275), 55 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:43,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (not (= (select .cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 0)) (= |c_ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) 0) (forall ((v_ArrVal_2176 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8|) 0 v_ArrVal_2176)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse2) v_ArrVal_2178)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2180) .cse2)) 0))) (not (= (select .cse0 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) is different from false [2021-11-22 19:47:43,511 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (and (not (= (select .cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) 0) (forall ((v_ArrVal_2176 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8|) 0 v_ArrVal_2176)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse2) v_ArrVal_2178)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2180) .cse2)) 0))) (not (= (select .cse0 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:47:43,677 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse1 8))) (and (not (= .cse0 0)) (not (= (select .cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) 0) (or (= (mod |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 256) 0) (forall ((v_ArrVal_2176 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse3 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8|) 0 v_ArrVal_2176)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse3) v_ArrVal_2178)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2180) .cse3)) 0)))) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0)))) is different from false [2021-11-22 19:47:43,719 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse1 8))) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= .cse0 0)) (not (= (select .cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) 0) (forall ((v_ArrVal_2176 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse3 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8|) 0 v_ArrVal_2176)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse3) v_ArrVal_2178)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2180) .cse3)) 0))) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0)))) is different from false [2021-11-22 19:47:43,726 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8))) (and (= .cse0 |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (not (= |c_ULTIMATE.start_save_byte_from_array_~array#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 8) 0) (forall ((v_ArrVal_2176 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2180 Int)) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_8|) 0 v_ArrVal_2176)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse2) v_ArrVal_2178)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2180) .cse2)) 0))) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:47:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:46,468 INFO L93 Difference]: Finished difference Result 575 states and 616 transitions. [2021-11-22 19:47:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-22 19:47:46,468 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.0) internal successors, (275), 55 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-22 19:47:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:46,470 INFO L225 Difference]: With dead ends: 575 [2021-11-22 19:47:46,470 INFO L226 Difference]: Without dead ends: 573 [2021-11-22 19:47:46,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=886, Invalid=7258, Unknown=86, NotChecked=1870, Total=10100 [2021-11-22 19:47:46,472 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 1850 mSDsluCounter, 6826 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 7123 SdHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2069 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:46,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1850 Valid, 7123 Invalid, 3784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1536 Invalid, 0 Unknown, 2069 Unchecked, 0.9s Time] [2021-11-22 19:47:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-22 19:47:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 328. [2021-11-22 19:47:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 319 states have (on average 1.0940438871473355) internal successors, (349), 327 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 349 transitions. [2021-11-22 19:47:46,502 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 349 transitions. Word has length 98 [2021-11-22 19:47:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:46,503 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 349 transitions. [2021-11-22 19:47:46,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.0) internal successors, (275), 55 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 349 transitions. [2021-11-22 19:47:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 19:47:46,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:46,504 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:46,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 19:47:46,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:47:46,719 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1067562071, now seen corresponding path program 2 times [2021-11-22 19:47:46,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:46,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931075945] [2021-11-22 19:47:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:46,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:46,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:46,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931075945] [2021-11-22 19:47:46,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931075945] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:47:46,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474889733] [2021-11-22 19:47:46,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 19:47:46,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:47:46,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:47:46,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:47:46,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 19:47:48,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 19:47:48,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 19:47:48,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 2765 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 19:47:48,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:47:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:48,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:47:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:48,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474889733] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:47:48,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:47:48,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-22 19:47:48,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248756155] [2021-11-22 19:47:48,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:47:48,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:47:48,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:48,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:47:48,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:47:48,830 INFO L87 Difference]: Start difference. First operand 328 states and 349 transitions. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:48,896 INFO L93 Difference]: Finished difference Result 475 states and 512 transitions. [2021-11-22 19:47:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:47:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-22 19:47:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:48,898 INFO L225 Difference]: With dead ends: 475 [2021-11-22 19:47:48,898 INFO L226 Difference]: Without dead ends: 357 [2021-11-22 19:47:48,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:47:48,898 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 497 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:48,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 1393 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:47:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-22 19:47:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 314. [2021-11-22 19:47:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 305 states have (on average 1.0852459016393443) internal successors, (331), 313 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 331 transitions. [2021-11-22 19:47:48,914 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 331 transitions. Word has length 98 [2021-11-22 19:47:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:48,914 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 331 transitions. [2021-11-22 19:47:48,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:47:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 331 transitions. [2021-11-22 19:47:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:47:48,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:48,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:48,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 19:47:49,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-22 19:47:49,116 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:47:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1218870112, now seen corresponding path program 1 times [2021-11-22 19:47:49,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494708052] [2021-11-22 19:47:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:49,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:50,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:50,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494708052] [2021-11-22 19:47:50,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494708052] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:47:50,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504673954] [2021-11-22 19:47:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:50,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:47:50,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:47:50,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:47:50,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 19:47:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:50,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 132 conjunts are in the unsatisfiable core [2021-11-22 19:47:50,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:47:50,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:47:50,911 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 19:47:50,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 19:47:50,926 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 16 treesize of output 12 [2021-11-22 19:47:50,930 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-11-22 19:47:51,206 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-22 19:47:51,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2021-11-22 19:47:51,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-11-22 19:47:51,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2021-11-22 19:47:51,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:47:51,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2021-11-22 19:47:51,371 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:47:51,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2021-11-22 19:47:51,460 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 19:47:51,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 70 [2021-11-22 19:47:51,477 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:47:51,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2021-11-22 19:47:51,499 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-11-22 19:47:51,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 55 [2021-11-22 19:47:51,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:47:51,916 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 18 treesize of output 8 [2021-11-22 19:47:52,005 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:47:52,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-22 19:47:52,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-11-22 19:47:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:47:52,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:47:52,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2453 Int) (v_ArrVal_2451 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2451) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2453) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:47:52,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2453 Int) (v_ArrVal_2451 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2451) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2453) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:47:52,312 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short677#1| (forall ((v_ArrVal_2453 Int) (v_ArrVal_2451 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2451) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2453) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0)))) is different from false [2021-11-22 19:47:52,321 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0) (forall ((v_ArrVal_2453 Int) (v_ArrVal_2451 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2451) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2453) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616) 0)))) is different from false [2021-11-22 19:47:52,330 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2453 Int) (v_ArrVal_2451 (Array Int Int))) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) v_ArrVal_2451) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset| v_ArrVal_2453) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) 18446744073709551616) 0))) (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) 18446744073709551616) 0)) is different from false [2021-11-22 19:47:57,013 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:57,013 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 179 [2021-11-22 19:47:57,056 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:57,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1193 treesize of output 1199 [2021-11-22 19:47:57,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1451 treesize of output 1419 [2021-11-22 19:47:57,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:47:57,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:47:57,390 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:57,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 131 treesize of output 135 [2021-11-22 19:47:57,534 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:47:57,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 148 treesize of output 148 [2021-11-22 19:48:54,368 INFO L354 Elim1Store]: treesize reduction 145, result has 38.8 percent of original size [2021-11-22 19:48:54,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 386 treesize of output 316 [2021-11-22 19:48:54,395 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:48:54,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 958 treesize of output 956 [2021-11-22 19:48:54,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1092 treesize of output 1056 [2021-11-22 19:48:54,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1112 treesize of output 1096 [2021-11-22 19:48:54,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1164 treesize of output 1148 [2021-11-22 19:48:54,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1216 treesize of output 1200 [2021-11-22 19:48:54,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1268 treesize of output 1252 [2021-11-22 19:48:54,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:48:54,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-11-22 19:48:55,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:48:55,030 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 19:48:55,047 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 19:48:55,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:48:55,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 108 treesize of output 96 [2021-11-22 19:48:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:48:57,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504673954] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:48:57,783 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:48:57,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 49 [2021-11-22 19:48:57,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133340883] [2021-11-22 19:48:57,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:48:57,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-22 19:48:57,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:48:57,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-22 19:48:57,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1656, Unknown=48, NotChecked=440, Total=2352 [2021-11-22 19:48:57,784 INFO L87 Difference]: Start difference. First operand 314 states and 331 transitions. Second operand has 49 states, 49 states have (on average 5.3061224489795915) internal successors, (260), 49 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:49:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:49:00,702 INFO L93 Difference]: Finished difference Result 537 states and 570 transitions. [2021-11-22 19:49:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-22 19:49:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.3061224489795915) internal successors, (260), 49 states have internal predecessors, (260), 0 states have call successors, (0), 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 99 [2021-11-22 19:49:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:49:00,703 INFO L225 Difference]: With dead ends: 537 [2021-11-22 19:49:00,703 INFO L226 Difference]: Without dead ends: 452 [2021-11-22 19:49:00,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 171 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=732, Invalid=4642, Unknown=48, NotChecked=740, Total=6162 [2021-11-22 19:49:00,705 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 1540 mSDsluCounter, 4931 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 5176 SdHoareTripleChecker+Invalid, 4252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2571 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:49:00,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1540 Valid, 5176 Invalid, 4252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1623 Invalid, 0 Unknown, 2571 Unchecked, 0.9s Time] [2021-11-22 19:49:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-11-22 19:49:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 305. [2021-11-22 19:49:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 296 states have (on average 1.0777027027027026) internal successors, (319), 304 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:49:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 319 transitions. [2021-11-22 19:49:00,729 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 319 transitions. Word has length 99 [2021-11-22 19:49:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:49:00,729 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 319 transitions. [2021-11-22 19:49:00,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.3061224489795915) internal successors, (260), 49 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:49:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 319 transitions. [2021-11-22 19:49:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:49:00,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:49:00,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:49:00,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-22 19:49:00,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-22 19:49:00,944 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:49:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:49:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash -214140070, now seen corresponding path program 1 times [2021-11-22 19:49:00,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:49:00,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317438349] [2021-11-22 19:49:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:00,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:49:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:12,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:49:12,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317438349] [2021-11-22 19:49:12,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317438349] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:49:12,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769576528] [2021-11-22 19:49:12,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:49:12,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:49:12,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:49:12,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:49:12,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-22 19:49:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:49:13,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 111 conjunts are in the unsatisfiable core [2021-11-22 19:49:13,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:49:13,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:49:13,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:13,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-11-22 19:49:13,552 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-11-22 19:49:13,692 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:49:13,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 15 [2021-11-22 19:49:13,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-22 19:49:13,754 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:49:13,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-22 19:49:13,831 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 19:49:13,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2021-11-22 19:49:14,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:49:14,164 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-11-22 19:49:14,288 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:49:14,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2021-11-22 19:49:14,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:49:14,371 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:14,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2021-11-22 19:49:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:49:14,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:49:14,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2598 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2598) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|) |c_ULTIMATE.start_aws_byte_buf_write_~len#1|))) (<= (mod .cse0 18446744073709551616) (mod (select (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| .cse0) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))))) is different from false [2021-11-22 19:49:14,643 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2598 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2598) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_~len#1| (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)))) (<= (mod .cse0 18446744073709551616) (mod (select (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| .cse0) (+ 16 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 18446744073709551616))))) |c_ULTIMATE.start_aws_byte_buf_write_#t~short1171#1|) is different from false [2021-11-22 19:49:14,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2021-11-22 19:49:14,652 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:49:14,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 87 treesize of output 81 [2021-11-22 19:49:14,656 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 19:49:14,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 74 treesize of output 62 [2021-11-22 19:49:15,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))) is different from false [2021-11-22 19:49:15,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int) (v_ArrVal_2595 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2595))) (store .cse0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select .cse0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))) is different from false [2021-11-22 19:49:15,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old_byte_from_buf~0#1.base_14| Int) (v_ArrVal_2595 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.base_17| Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old_byte_from_buf~0#1.base_14| v_ArrVal_2595))) (store .cse0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select .cse0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.base_17| 1) |v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old_byte_from_buf~0#1.base_14|) 0)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))) is different from false [2021-11-22 19:49:16,272 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:16,272 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2021-11-22 19:49:16,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:16,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 269 [2021-11-22 19:49:16,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 301 [2021-11-22 19:49:16,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-11-22 19:49:16,516 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:49:16,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 50 treesize of output 50 [2021-11-22 19:49:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:49:17,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769576528] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:49:17,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:49:17,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 46 [2021-11-22 19:49:17,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160441700] [2021-11-22 19:49:17,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:49:17,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-22 19:49:17,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:49:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-22 19:49:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1495, Unknown=6, NotChecked=410, Total=2070 [2021-11-22 19:49:17,392 INFO L87 Difference]: Start difference. First operand 305 states and 319 transitions. Second operand has 46 states, 46 states have (on average 6.065217391304348) internal successors, (279), 46 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:49:17,981 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< (+ |c_ULTIMATE.start_bounded_malloc_#res#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (= |c_ULTIMATE.start_save_byte_from_array_~size#1| (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|) (< (+ (select .cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int) (v_ArrVal_2595 (Array Int Int))) (or (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2595))) (store .cse1 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select .cse1 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (not (= (select .cse0 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) is different from false [2021-11-22 19:49:17,984 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_save_byte_from_array_~size#1| (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|)) (< (+ (select .cse0 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int) (v_ArrVal_2595 (Array Int Int))) (or (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2595))) (store .cse1 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select .cse1 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))) (not (= (select .cse0 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:49:18,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (and (or (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (<= (* 18446744073709551616 (div (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|))) (let ((.cse0 (div .cse2 18446744073709551616))) (+ 18446744073709551616 (* .cse0 18446744073709551616) (* .cse1 (- 1)) (* (div (+ .cse1 (* .cse0 (- 18446744073709551616))) 18446744073709551616) 36893488147419103232) .cse2))) 18446744073709551616)) .cse1)) (and (<= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (* 256 (div |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256))) (<= 0 |c_ULTIMATE.start_assume_abort_if_not_~cond#1|))) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< (+ (select .cse3 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int) (v_ArrVal_2595 (Array Int Int))) (or (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2595))) (store .cse4 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select .cse4 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))) (not (= (select .cse3 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:49:18,011 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (<= (* 18446744073709551616 (div (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|))) (let ((.cse0 (div .cse2 18446744073709551616))) (+ 18446744073709551616 (* .cse0 18446744073709551616) (* .cse1 (- 1)) (* (div (+ .cse1 (* .cse0 (- 18446744073709551616))) 18446744073709551616) 36893488147419103232) .cse2))) 18446744073709551616)) .cse1)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< (+ (select .cse3 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int) (v_ArrVal_2595 (Array Int Int))) (or (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2595))) (store .cse4 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select .cse4 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597))) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))) (not (= (select .cse3 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0))) is different from false [2021-11-22 19:49:18,706 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 1) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|))) (<= (* 18446744073709551616 (div (+ 18446744073709551616 (* (div .cse0 18446744073709551616) 36893488147419103232) (* .cse0 (- 1))) 18446744073709551616)) .cse0)) (< (+ (select .cse1 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (not (= (select .cse1 8) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| Int) (v_ArrVal_2597 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_10|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10| v_ArrVal_2597)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8)) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_10|))))) is different from false [2021-11-22 19:49:58,937 WARN L227 SmtUtils]: Spent 39.09s on a formula simplification. DAG size of input: 138 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 19:50:00,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:50:01,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:50:49,147 WARN L227 SmtUtils]: Spent 46.35s on a formula simplification. DAG size of input: 150 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 19:50:51,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:50:58,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:51:00,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:51:02,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:51:04,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:51:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:51:06,794 INFO L93 Difference]: Finished difference Result 466 states and 494 transitions. [2021-11-22 19:51:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 19:51:06,795 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.065217391304348) internal successors, (279), 46 states have internal predecessors, (279), 0 states have call successors, (0), 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 99 [2021-11-22 19:51:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:51:06,797 INFO L225 Difference]: With dead ends: 466 [2021-11-22 19:51:06,797 INFO L226 Difference]: Without dead ends: 394 [2021-11-22 19:51:06,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 96.7s TimeCoverageRelationStatistics Valid=405, Invalid=2814, Unknown=13, NotChecked=1190, Total=4422 [2021-11-22 19:51:06,798 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 803 mSDsluCounter, 4626 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 52 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1247 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:51:06,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [803 Valid, 4860 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1524 Invalid, 5 Unknown, 1247 Unchecked, 17.1s Time] [2021-11-22 19:51:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-22 19:51:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 305. [2021-11-22 19:51:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 296 states have (on average 1.0743243243243243) internal successors, (318), 304 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:51:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 318 transitions. [2021-11-22 19:51:06,815 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 318 transitions. Word has length 99 [2021-11-22 19:51:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:51:06,816 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 318 transitions. [2021-11-22 19:51:06,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.065217391304348) internal successors, (279), 46 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:51:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 318 transitions. [2021-11-22 19:51:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:51:06,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:51:06,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:51:06,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-22 19:51:07,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:51:07,028 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:51:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:51:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash -451964373, now seen corresponding path program 1 times [2021-11-22 19:51:07,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:51:07,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532920313] [2021-11-22 19:51:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:51:07,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:51:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:51:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:51:40,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:51:40,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532920313] [2021-11-22 19:51:40,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532920313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:51:40,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:51:40,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-11-22 19:51:40,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583556761] [2021-11-22 19:51:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:51:40,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-22 19:51:40,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:51:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-22 19:51:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1025, Unknown=1, NotChecked=0, Total=1122 [2021-11-22 19:51:40,708 INFO L87 Difference]: Start difference. First operand 305 states and 318 transitions. Second operand has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:52:00,817 INFO L93 Difference]: Finished difference Result 401 states and 422 transitions. [2021-11-22 19:52:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:52:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2021-11-22 19:52:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:52:00,818 INFO L225 Difference]: With dead ends: 401 [2021-11-22 19:52:00,818 INFO L226 Difference]: Without dead ends: 399 [2021-11-22 19:52:00,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=317, Invalid=2034, Unknown=1, NotChecked=0, Total=2352 [2021-11-22 19:52:00,819 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 1102 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:52:00,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 2167 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2021-11-22 19:52:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-11-22 19:52:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 307. [2021-11-22 19:52:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 298 states have (on average 1.0738255033557047) internal successors, (320), 306 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 320 transitions. [2021-11-22 19:52:00,838 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 320 transitions. Word has length 99 [2021-11-22 19:52:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:52:00,838 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 320 transitions. [2021-11-22 19:52:00,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 320 transitions. [2021-11-22 19:52:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 19:52:00,839 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:52:00,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:52:00,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-22 19:52:00,840 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:52:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:52:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash 677572787, now seen corresponding path program 1 times [2021-11-22 19:52:00,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:52:00,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492371438] [2021-11-22 19:52:00,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:52:00,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:52:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:52:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:52:01,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:52:01,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492371438] [2021-11-22 19:52:01,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492371438] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:52:01,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84610765] [2021-11-22 19:52:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:52:01,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:52:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:52:01,731 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:52:01,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-22 19:52:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:52:02,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 2812 conjuncts, 149 conjunts are in the unsatisfiable core [2021-11-22 19:52:02,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:52:02,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:52:02,336 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 19:52:02,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 19:52:02,382 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 27 treesize of output 23 [2021-11-22 19:52:02,629 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-11-22 19:52:02,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2021-11-22 19:52:02,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-11-22 19:52:02,723 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:52:02,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2021-11-22 19:52:02,773 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 19:52:02,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-11-22 19:52:03,423 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:52:03,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2021-11-22 19:52:03,429 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 29 treesize of output 28 [2021-11-22 19:52:03,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:52:03,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:52:03,467 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-11-22 19:52:03,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-11-22 19:52:03,471 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-11-22 19:52:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:52:03,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:52:03,784 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2801 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2798) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2801) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 0))) (forall ((v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2799 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2799) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) 0)))) is different from false [2021-11-22 19:52:03,831 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2801 Int)) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse0) v_ArrVal_2798) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2801) .cse0)) 0))) (forall ((v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2799 Int)) (not (= 0 (let ((.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse1) v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2799) .cse1)))))) is different from false [2021-11-22 19:52:03,855 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2801 Int)) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse0) v_ArrVal_2798) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2801) .cse0)) 0))) (forall ((v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2799 Int)) (not (= 0 (let ((.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse1) v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2799) .cse1))))) (= (mod |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256) 0)) is different from false [2021-11-22 19:52:03,914 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2801 Int)) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse0) v_ArrVal_2798) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2801) .cse0)) 0))) (= (mod |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 256) 0) (forall ((v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2799 Int)) (not (= 0 (let ((.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) .cse1) v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| v_ArrVal_2799) .cse1)))))) is different from false [2021-11-22 19:52:04,146 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:04,147 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 66 treesize of output 70 [2021-11-22 19:52:04,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-11-22 19:52:04,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:52:04,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:52:04,179 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:04,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 61 [2021-11-22 19:52:04,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| Int) (v_ArrVal_2797 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| Int) (v_ArrVal_2796 Int) (v_ArrVal_2799 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| v_ArrVal_2796))) (.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse2))) (or (not (= (select (store (select (store .cse0 .cse1 v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2799) .cse2) 0)) (not (= .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (<= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11|))))) is different from false [2021-11-22 19:52:04,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| Int) (v_ArrVal_2797 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| Int) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_ArrVal_2799 Int)) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2794))) (store .cse3 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| (store (select .cse3 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| v_ArrVal_2796)))) (.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse2))) (or (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= (select (store (select (store .cse1 .cse0 v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2799) .cse2) 0)) (<= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11|))))) is different from false [2021-11-22 19:52:04,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| Int) (v_ArrVal_2797 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| Int) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_ArrVal_2799 Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old_byte_from_buf~0#1.base_16| Int) (|v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.base_19| Int)) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old_byte_from_buf~0#1.base_16| v_ArrVal_2794))) (store .cse3 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| (store (select .cse3 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| v_ArrVal_2796)))) (.cse2 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse2))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.base_19| 1) |v_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old_byte_from_buf~0#1.base_16|) 0)) (not (= (select (store (select (store .cse0 .cse1 v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2799) .cse2) 0)) (<= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11|) (not (= .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)))))) is different from false [2021-11-22 19:52:06,265 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:06,265 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 100 [2021-11-22 19:52:06,287 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:06,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4614 treesize of output 4382 [2021-11-22 19:52:06,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5900 treesize of output 5496 [2021-11-22 19:52:06,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5856 treesize of output 5760 [2021-11-22 19:52:06,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-11-22 19:52:06,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:52:06,985 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:06,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 55 treesize of output 55 [2021-11-22 19:52:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:52:07,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84610765] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:52:07,843 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:52:07,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 26] total 59 [2021-11-22 19:52:07,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747216747] [2021-11-22 19:52:07,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:52:07,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-22 19:52:07,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:52:07,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-22 19:52:07,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2401, Unknown=7, NotChecked=742, Total=3422 [2021-11-22 19:52:07,844 INFO L87 Difference]: Start difference. First operand 307 states and 320 transitions. Second operand has 59 states, 59 states have (on average 4.966101694915254) internal successors, (293), 59 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:08,579 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse2 (select .cse8 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (.cse0 (select .cse8 8))) (and (<= |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (not (= .cse0 0)) (not (= .cse1 0)) (= (select |c_#valid| .cse2) 1) (not (= (select .cse3 8) 0)) (= .cse1 1) (<= 1 |c_ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) (= (select |c_#valid| |c_ULTIMATE.start_bounded_malloc_#res#1.base|) 1) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= .cse2 0)) (not (= .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| Int) (v_ArrVal_2797 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| Int) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_ArrVal_2799 Int)) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2794))) (store .cse7 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| (store (select .cse7 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| v_ArrVal_2796)))) (.cse6 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse6))) (or (not (= .cse4 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= (select (store (select (store .cse5 .cse4 v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2799) .cse6) 0)) (<= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11|))))) (not (= (select .cse3 (+ 8 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse2)) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) (< 0 |c_#StackHeapBarrier|)))) is different from false [2021-11-22 19:52:08,582 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse6 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (.cse0 (select .cse6 8))) (and (not (= .cse0 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= .cse1 0)) (not (= .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| Int) (v_ArrVal_2797 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| Int) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_ArrVal_2799 Int)) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2794))) (store .cse5 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| (store (select .cse5 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| v_ArrVal_2796)))) (.cse4 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse4))) (or (not (= .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= (select (store (select (store .cse3 .cse2 v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2799) .cse4) 0)) (<= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11|))))) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse1)) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (< 0 |c_#StackHeapBarrier|)))) is different from false [2021-11-22 19:52:08,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse5 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (.cse0 (select .cse5 8))) (and (not (= .cse0 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) 0)) (not (= .cse1 0)) (not (= .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (not (= .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| Int) (v_ArrVal_2797 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| Int) (v_ArrVal_2796 Int) (v_ArrVal_2799 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11|) |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11| v_ArrVal_2796))) (.cse4 (+ |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) .cse4))) (or (not (= (select (store (select (store .cse2 .cse3 v_ArrVal_2797) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| v_ArrVal_2799) .cse4) 0)) (not (= .cse3 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|)) (<= |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.base_11| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_aws_byte_buf_write_u8_~#c#1.offset_11|))))) (= |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset| 0) (< 0 |c_#StackHeapBarrier|)))) is different from false [2021-11-22 19:52:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:52:10,674 INFO L93 Difference]: Finished difference Result 440 states and 467 transitions. [2021-11-22 19:52:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-11-22 19:52:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 4.966101694915254) internal successors, (293), 59 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 19:52:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:52:10,676 INFO L225 Difference]: With dead ends: 440 [2021-11-22 19:52:10,676 INFO L226 Difference]: Without dead ends: 438 [2021-11-22 19:52:10,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1170, Invalid=9780, Unknown=10, NotChecked=2150, Total=13110 [2021-11-22 19:52:10,677 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 738 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 4891 SdHoareTripleChecker+Invalid, 4348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2503 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:52:10,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 4891 Invalid, 4348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1695 Invalid, 0 Unknown, 2503 Unchecked, 0.8s Time] [2021-11-22 19:52:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-22 19:52:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 299. [2021-11-22 19:52:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 291 states have (on average 1.0721649484536082) internal successors, (312), 298 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 312 transitions. [2021-11-22 19:52:10,695 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 312 transitions. Word has length 101 [2021-11-22 19:52:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:52:10,695 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 312 transitions. [2021-11-22 19:52:10,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.966101694915254) internal successors, (293), 59 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 312 transitions. [2021-11-22 19:52:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 19:52:10,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:52:10,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:52:10,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-22 19:52:10,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:52:10,897 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:52:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:52:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash -545926515, now seen corresponding path program 1 times [2021-11-22 19:52:10,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:52:10,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285111913] [2021-11-22 19:52:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:52:10,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:52:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:52:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:52:11,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:52:11,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285111913] [2021-11-22 19:52:11,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285111913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:52:11,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:52:11,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:52:11,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809146013] [2021-11-22 19:52:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:52:11,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:52:11,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:52:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:52:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:52:11,676 INFO L87 Difference]: Start difference. First operand 299 states and 312 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:52:12,042 INFO L93 Difference]: Finished difference Result 363 states and 383 transitions. [2021-11-22 19:52:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:52:12,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2021-11-22 19:52:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:52:12,043 INFO L225 Difference]: With dead ends: 363 [2021-11-22 19:52:12,043 INFO L226 Difference]: Without dead ends: 361 [2021-11-22 19:52:12,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:52:12,044 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 410 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:52:12,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 871 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:52:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-11-22 19:52:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 301. [2021-11-22 19:52:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 293 states have (on average 1.0716723549488054) internal successors, (314), 300 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-11-22 19:52:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 314 transitions. [2021-11-22 19:52:12,068 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 314 transitions. Word has length 101 [2021-11-22 19:52:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:52:12,068 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 314 transitions. [2021-11-22 19:52:12,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:52:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 314 transitions. [2021-11-22 19:52:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-22 19:52:12,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:52:12,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:52:12,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-22 19:52:12,069 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-22 19:52:12,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:52:12,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1122422397, now seen corresponding path program 1 times [2021-11-22 19:52:12,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:52:12,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129921470] [2021-11-22 19:52:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:52:12,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:52:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:52:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:52:13,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:52:13,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129921470] [2021-11-22 19:52:13,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129921470] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:52:13,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246179569] [2021-11-22 19:52:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:52:13,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:52:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:52:13,814 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:52:13,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-22 19:52:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:52:14,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 107 conjunts are in the unsatisfiable core [2021-11-22 19:52:14,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:52:14,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:52:14,373 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 19:52:14,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 19:52:14,414 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-11-22 19:52:14,709 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-22 19:52:14,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2021-11-22 19:52:14,808 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-11-22 19:52:14,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2021-11-22 19:52:14,820 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-22 19:52:14,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 61 [2021-11-22 19:52:14,829 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:52:14,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2021-11-22 19:52:15,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:52:15,546 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2021-11-22 19:52:15,724 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-11-22 19:52:15,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2021-11-22 19:52:15,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2021-11-22 19:52:16,149 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-22 19:52:16,149 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 62 treesize of output 38 [2021-11-22 19:52:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:52:16,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:52:16,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2968 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_memcpy_impl_~dst#1.base| v_ArrVal_2968))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (store .cse2 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| (+ (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|) |c_ULTIMATE.start_aws_byte_buf_write_~len#1|))))))) (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.offset|) 1) 18446744073709551616) (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|) 18446744073709551616)))) is different from false [2021-11-22 19:52:16,577 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2968 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|)) v_ArrVal_2968))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.base|))) (store .cse2 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset| (+ (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_~buf#1.offset|) |c_ULTIMATE.start_aws_byte_buf_write_~len#1|))))))) (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|) 18446744073709551616) (mod (+ (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.offset|) 1) 18446744073709551616)))) is different from false [2021-11-22 19:52:16,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2968 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|)) v_ArrVal_2968))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.base|))) (store .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset| (+ (select .cse2 |c_ULTIMATE.start_aws_byte_buf_write_u8_~buf#1.offset|) 1))))))) (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#old~0#1.offset|) 1) 18446744073709551616) (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_write_u8_harness_~#buf~3#1.offset|) 18446744073709551616)))) is different from false [2021-11-22 19:52:16,829 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:16,830 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 4309 treesize of output 4221 [2021-11-22 19:52:16,850 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:16,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4797 treesize of output 4429 [2021-11-22 19:52:16,876 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:52:16,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4717 treesize of output 4537 Killed by 15