./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_reserve_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 de3da06dbfc8734cb93dce42b312357899e8d9cc914b94ba94740650fa2d8258 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:56:25,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:56:25,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:56:25,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:56:25,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:56:25,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:56:25,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:56:25,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:56:25,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:56:25,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:56:25,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:56:25,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:56:25,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:56:25,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:56:25,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:56:25,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:56:25,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:56:25,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:56:25,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:56:25,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:56:25,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:56:25,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:56:25,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:56:25,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:56:25,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:56:25,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:56:25,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:56:25,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:56:25,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:56:25,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:56:25,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:56:25,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:56:25,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:56:25,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:56:25,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:56:25,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:56:25,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:56:25,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:56:25,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:56:25,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:56:25,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:56:25,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:56:25,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 10:56:25,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:56:25,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:56:25,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:56:25,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:56:25,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:56:25,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:56:25,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:56:25,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:56:25,898 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:56:25,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:56:25,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:56:25,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:56:25,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:56:25,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:56:25,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:56:25,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:56:25,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:56:25,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:56:25,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:56:25,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:56:25,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:56:25,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:25,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:56:25,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:56:25,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:56:25,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:56:25,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:56:25,901 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:56:25,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:56:25,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:56:25,902 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 -> de3da06dbfc8734cb93dce42b312357899e8d9cc914b94ba94740650fa2d8258 [2022-07-12 10:56:26,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:56:26,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:56:26,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:56:26,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:56:26,118 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:56:26,119 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_reserve_harness.i [2022-07-12 10:56:26,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0f2738e/f65eb58a0af24719996c9dad03848c47/FLAGacdbd8c3d [2022-07-12 10:56:26,744 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:56:26,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i [2022-07-12 10:56:26,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0f2738e/f65eb58a0af24719996c9dad03848c47/FLAGacdbd8c3d [2022-07-12 10:56:27,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0f2738e/f65eb58a0af24719996c9dad03848c47 [2022-07-12 10:56:27,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:56:27,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:56:27,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:27,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:56:27,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:56:27,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:27" (1/1) ... [2022-07-12 10:56:27,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625b1200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:27, skipping insertion in model container [2022-07-12 10:56:27,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:27" (1/1) ... [2022-07-12 10:56:27,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:56:27,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:56:27,492 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_reserve_harness.i[4494,4507] [2022-07-12 10:56:27,498 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_reserve_harness.i[4554,4567] [2022-07-12 10:56:28,032 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,032 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,036 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,036 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,037 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,048 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,049 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,051 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,051 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,281 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:28,282 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:28,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:28,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:28,284 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:28,285 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:28,285 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:28,286 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:28,286 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:28,287 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:28,432 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:28,448 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,449 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,508 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,510 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:28,611 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:56:28,630 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_reserve_harness.i[4494,4507] [2022-07-12 10:56:28,630 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_reserve_harness.i[4554,4567] [2022-07-12 10:56:28,664 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,666 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,667 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,667 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,668 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,680 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,681 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,682 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,683 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,740 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:28,741 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:28,741 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:28,742 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:28,742 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:28,742 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:28,743 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:28,748 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:28,750 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:28,751 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:28,771 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:28,783 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,783 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,821 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,822 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:28,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:28,992 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:56:28,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28 WrapperNode [2022-07-12 10:56:28,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:28,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:28,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:56:28,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:56:28,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,171 INFO L137 Inliner]: procedures = 692, calls = 2621, calls flagged for inlining = 60, calls inlined = 10, statements flattened = 957 [2022-07-12 10:56:29,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:29,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:56:29,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:56:29,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:56:29,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:56:29,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:56:29,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:56:29,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:56:29,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (1/1) ... [2022-07-12 10:56:29,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:29,290 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) [2022-07-12 10:56:29,307 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 [2022-07-12 10:56:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-12 10:56:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-12 10:56:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:56:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:56:29,323 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:56:29,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:56:29,324 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-12 10:56:29,324 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-12 10:56:29,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:56:29,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:56:29,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:56:29,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:56:29,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:56:29,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:56:29,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:56:29,325 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:56:29,325 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:56:29,325 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_realloc [2022-07-12 10:56:29,325 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_realloc [2022-07-12 10:56:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_reserve [2022-07-12 10:56:29,326 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_reserve [2022-07-12 10:56:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-12 10:56:29,326 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-12 10:56:29,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:56:29,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:56:29,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:56:29,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:56:29,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:56:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 10:56:29,328 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 10:56:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 10:56:29,328 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 10:56:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:56:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:56:29,585 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:56:29,586 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:56:30,351 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:56:30,358 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:56:30,358 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 10:56:30,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:30 BoogieIcfgContainer [2022-07-12 10:56:30,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:56:30,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:56:30,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:56:30,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:56:30,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:56:27" (1/3) ... [2022-07-12 10:56:30,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78aa9bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:30, skipping insertion in model container [2022-07-12 10:56:30,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:28" (2/3) ... [2022-07-12 10:56:30,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78aa9bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:30, skipping insertion in model container [2022-07-12 10:56:30,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:30" (3/3) ... [2022-07-12 10:56:30,367 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reserve_harness.i [2022-07-12 10:56:30,378 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:56:30,378 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:56:30,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:56:30,454 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@123c58a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ba19ca3 [2022-07-12 10:56:30,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:56:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 37 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-12 10:56:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 10:56:30,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:30,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2022-07-12 10:56:30,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash 122195533, now seen corresponding path program 1 times [2022-07-12 10:56:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:30,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785399133] [2022-07-12 10:56:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:56:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:56:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785399133] [2022-07-12 10:56:30,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785399133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:30,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:30,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:56:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565529732] [2022-07-12 10:56:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:30,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:56:30,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:56:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:56:30,999 INFO L87 Difference]: Start difference. First operand has 153 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 37 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 10:56:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:31,206 INFO L93 Difference]: Finished difference Result 318 states and 453 transitions. [2022-07-12 10:56:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:56:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-12 10:56:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:31,217 INFO L225 Difference]: With dead ends: 318 [2022-07-12 10:56:31,218 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 10:56:31,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:56:31,223 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:31,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 232 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:56:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 10:56:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2022-07-12 10:56:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 98 states have internal predecessors, (120), 37 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-07-12 10:56:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 193 transitions. [2022-07-12 10:56:31,265 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 193 transitions. Word has length 48 [2022-07-12 10:56:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:31,265 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 193 transitions. [2022-07-12 10:56:31,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 10:56:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 193 transitions. [2022-07-12 10:56:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 10:56:31,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:31,268 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-07-12 10:56:31,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:56:31,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1409458321, now seen corresponding path program 1 times [2022-07-12 10:56:31,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:31,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119061367] [2022-07-12 10:56:31,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:31,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:56:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:56:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119061367] [2022-07-12 10:56:31,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119061367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:31,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:31,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:56:31,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814037138] [2022-07-12 10:56:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:31,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:56:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:56:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:31,520 INFO L87 Difference]: Start difference. First operand 146 states and 193 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 10:56:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:32,054 INFO L93 Difference]: Finished difference Result 323 states and 440 transitions. [2022-07-12 10:56:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-07-12 10:56:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:32,056 INFO L225 Difference]: With dead ends: 323 [2022-07-12 10:56:32,056 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 10:56:32,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:56:32,058 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 311 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:32,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 327 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:56:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 10:56:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 149. [2022-07-12 10:56:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 101 states have internal predecessors, (122), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2022-07-12 10:56:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 199 transitions. [2022-07-12 10:56:32,072 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 199 transitions. Word has length 50 [2022-07-12 10:56:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:32,073 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 199 transitions. [2022-07-12 10:56:32,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 10:56:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2022-07-12 10:56:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 10:56:32,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:32,075 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-07-12 10:56:32,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:56:32,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash -564986084, now seen corresponding path program 1 times [2022-07-12 10:56:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:32,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12869062] [2022-07-12 10:56:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:32,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:56:32,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:32,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12869062] [2022-07-12 10:56:32,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12869062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:32,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:32,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:32,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871558822] [2022-07-12 10:56:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:32,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:32,384 INFO L87 Difference]: Start difference. First operand 149 states and 199 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 10:56:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:32,980 INFO L93 Difference]: Finished difference Result 261 states and 346 transitions. [2022-07-12 10:56:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:56:32,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2022-07-12 10:56:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:32,986 INFO L225 Difference]: With dead ends: 261 [2022-07-12 10:56:32,986 INFO L226 Difference]: Without dead ends: 203 [2022-07-12 10:56:32,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:56:32,988 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 269 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:32,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 533 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:56:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-12 10:56:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 153. [2022-07-12 10:56:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 104 states have internal predecessors, (125), 37 states have call successors, (37), 11 states have call predecessors, (37), 13 states have return successors, (41), 37 states have call predecessors, (41), 36 states have call successors, (41) [2022-07-12 10:56:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 203 transitions. [2022-07-12 10:56:33,011 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 203 transitions. Word has length 56 [2022-07-12 10:56:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:33,011 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 203 transitions. [2022-07-12 10:56:33,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 10:56:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 203 transitions. [2022-07-12 10:56:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 10:56:33,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:33,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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] [2022-07-12 10:56:33,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:56:33,014 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1211897445, now seen corresponding path program 1 times [2022-07-12 10:56:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390981949] [2022-07-12 10:56:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:56:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:56:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:33,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390981949] [2022-07-12 10:56:33,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390981949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:33,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877077324] [2022-07-12 10:56:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:33,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:33,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:33,215 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) [2022-07-12 10:56:33,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:56:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:56:33,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:56:33,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:33,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877077324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:33,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:33,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-07-12 10:56:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210198697] [2022-07-12 10:56:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:33,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:56:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:56:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:56:33,811 INFO L87 Difference]: Start difference. First operand 153 states and 203 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-12 10:56:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:34,003 INFO L93 Difference]: Finished difference Result 280 states and 370 transitions. [2022-07-12 10:56:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2022-07-12 10:56:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:34,005 INFO L225 Difference]: With dead ends: 280 [2022-07-12 10:56:34,005 INFO L226 Difference]: Without dead ends: 150 [2022-07-12 10:56:34,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:56:34,007 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 258 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:34,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 621 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:56:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-12 10:56:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-12 10:56:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 100 states have (on average 1.22) internal successors, (122), 101 states have internal predecessors, (122), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 36 states have call successors, (37) [2022-07-12 10:56:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 196 transitions. [2022-07-12 10:56:34,040 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 196 transitions. Word has length 63 [2022-07-12 10:56:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:34,041 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 196 transitions. [2022-07-12 10:56:34,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-12 10:56:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2022-07-12 10:56:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 10:56:34,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:34,042 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:34,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:34,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:34,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash -747455974, now seen corresponding path program 1 times [2022-07-12 10:56:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:34,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763050536] [2022-07-12 10:56:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:34,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:56:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:56:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:34,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763050536] [2022-07-12 10:56:34,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763050536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:34,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:34,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:56:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49808594] [2022-07-12 10:56:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:34,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:56:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:56:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:56:34,524 INFO L87 Difference]: Start difference. First operand 150 states and 196 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:35,214 INFO L93 Difference]: Finished difference Result 212 states and 286 transitions. [2022-07-12 10:56:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:56:35,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2022-07-12 10:56:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:35,217 INFO L225 Difference]: With dead ends: 212 [2022-07-12 10:56:35,217 INFO L226 Difference]: Without dead ends: 210 [2022-07-12 10:56:35,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:56:35,218 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 298 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:35,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 693 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:56:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-12 10:56:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 159. [2022-07-12 10:56:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 108 states have internal predecessors, (128), 38 states have call successors, (38), 12 states have call predecessors, (38), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2022-07-12 10:56:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2022-07-12 10:56:35,237 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 68 [2022-07-12 10:56:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:35,237 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2022-07-12 10:56:35,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2022-07-12 10:56:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 10:56:35,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:35,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:35,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:56:35,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:35,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2108361110, now seen corresponding path program 1 times [2022-07-12 10:56:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:35,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234528210] [2022-07-12 10:56:35,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:56:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 10:56:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 10:56:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:35,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234528210] [2022-07-12 10:56:35,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234528210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:35,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:35,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007984402] [2022-07-12 10:56:35,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:35,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:35,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:35,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:35,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:35,474 INFO L87 Difference]: Start difference. First operand 159 states and 210 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:36,044 INFO L93 Difference]: Finished difference Result 281 states and 367 transitions. [2022-07-12 10:56:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:56:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2022-07-12 10:56:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:36,046 INFO L225 Difference]: With dead ends: 281 [2022-07-12 10:56:36,046 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 10:56:36,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:56:36,047 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 117 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:36,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 571 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:56:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 10:56:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 159. [2022-07-12 10:56:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 108 states have internal predecessors, (128), 38 states have call successors, (38), 12 states have call predecessors, (38), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2022-07-12 10:56:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2022-07-12 10:56:36,056 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 70 [2022-07-12 10:56:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:36,057 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2022-07-12 10:56:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2022-07-12 10:56:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 10:56:36,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:36,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:36,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:56:36,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:36,059 INFO L85 PathProgramCache]: Analyzing trace with hash -856300446, now seen corresponding path program 1 times [2022-07-12 10:56:36,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:36,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534193981] [2022-07-12 10:56:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:56:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 10:56:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:36,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534193981] [2022-07-12 10:56:36,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534193981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:36,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:36,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:56:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090021327] [2022-07-12 10:56:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:36,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:56:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:56:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:36,288 INFO L87 Difference]: Start difference. First operand 159 states and 210 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:36,788 INFO L93 Difference]: Finished difference Result 377 states and 539 transitions. [2022-07-12 10:56:36,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:56:36,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2022-07-12 10:56:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:36,790 INFO L225 Difference]: With dead ends: 377 [2022-07-12 10:56:36,790 INFO L226 Difference]: Without dead ends: 234 [2022-07-12 10:56:36,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:56:36,791 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 377 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:36,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 367 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:56:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-12 10:56:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 164. [2022-07-12 10:56:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 113 states have internal predecessors, (135), 38 states have call successors, (38), 12 states have call predecessors, (38), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2022-07-12 10:56:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 217 transitions. [2022-07-12 10:56:36,818 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 217 transitions. Word has length 72 [2022-07-12 10:56:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:36,818 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 217 transitions. [2022-07-12 10:56:36,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 217 transitions. [2022-07-12 10:56:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 10:56:36,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:36,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:56:36,820 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash -598135008, now seen corresponding path program 1 times [2022-07-12 10:56:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:36,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863860552] [2022-07-12 10:56:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:56:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:56:37,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:37,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863860552] [2022-07-12 10:56:37,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863860552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:37,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341040543] [2022-07-12 10:56:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:37,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:37,209 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) [2022-07-12 10:56:37,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:56:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 10:56:37,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:37,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-12 10:56:37,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:56:37,856 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 10:56:37,857 INFO L390 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 24 treesize of output 1 [2022-07-12 10:56:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:56:37,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:37,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341040543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:37,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:37,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 18 [2022-07-12 10:56:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449226383] [2022-07-12 10:56:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:56:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:56:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:56:37,860 INFO L87 Difference]: Start difference. First operand 164 states and 217 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 10:56:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:37,960 INFO L93 Difference]: Finished difference Result 335 states and 441 transitions. [2022-07-12 10:56:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:56:37,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 72 [2022-07-12 10:56:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:37,964 INFO L225 Difference]: With dead ends: 335 [2022-07-12 10:56:37,964 INFO L226 Difference]: Without dead ends: 183 [2022-07-12 10:56:37,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:56:37,966 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 19 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1337 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 134 Unchecked, 0.1s Time] [2022-07-12 10:56:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-12 10:56:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-07-12 10:56:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 131 states have internal predecessors, (158), 38 states have call successors, (38), 13 states have call predecessors, (38), 15 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2022-07-12 10:56:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2022-07-12 10:56:37,974 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 72 [2022-07-12 10:56:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:37,974 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2022-07-12 10:56:37,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 10:56:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2022-07-12 10:56:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 10:56:37,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:37,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:38,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:38,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-12 10:56:38,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash -951223390, now seen corresponding path program 1 times [2022-07-12 10:56:38,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:38,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390050560] [2022-07-12 10:56:38,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:38,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 10:56:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:56:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:56:38,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:38,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390050560] [2022-07-12 10:56:38,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390050560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:38,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787190070] [2022-07-12 10:56:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:38,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:38,340 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) [2022-07-12 10:56:38,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:56:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 2502 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:38,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:56:38,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:38,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787190070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:38,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:38,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-07-12 10:56:38,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736778871] [2022-07-12 10:56:38,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:38,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:56:38,737 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 10:56:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:38,763 INFO L93 Difference]: Finished difference Result 344 states and 460 transitions. [2022-07-12 10:56:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2022-07-12 10:56:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:38,765 INFO L225 Difference]: With dead ends: 344 [2022-07-12 10:56:38,765 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 10:56:38,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:38,767 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 20 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:38,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 568 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:56:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 10:56:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 175. [2022-07-12 10:56:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 38 states have call successors, (38), 13 states have call predecessors, (38), 14 states have return successors, (43), 38 states have call predecessors, (43), 37 states have call successors, (43) [2022-07-12 10:56:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 230 transitions. [2022-07-12 10:56:38,776 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 230 transitions. Word has length 72 [2022-07-12 10:56:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:38,776 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 230 transitions. [2022-07-12 10:56:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 10:56:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 230 transitions. [2022-07-12 10:56:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 10:56:38,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:38,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:38,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 10:56:39,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:39,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -188012506, now seen corresponding path program 1 times [2022-07-12 10:56:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:39,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338280703] [2022-07-12 10:56:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 10:56:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:56:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 10:56:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:56:39,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338280703] [2022-07-12 10:56:39,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338280703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300191840] [2022-07-12 10:56:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:39,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:39,206 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) [2022-07-12 10:56:39,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:56:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 10:56:39,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:56:39,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:39,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300191840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:39,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:39,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 13 [2022-07-12 10:56:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526424153] [2022-07-12 10:56:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:39,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:39,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:56:39,601 INFO L87 Difference]: Start difference. First operand 175 states and 230 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 10:56:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:39,722 INFO L93 Difference]: Finished difference Result 332 states and 439 transitions. [2022-07-12 10:56:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2022-07-12 10:56:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:39,724 INFO L225 Difference]: With dead ends: 332 [2022-07-12 10:56:39,724 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 10:56:39,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:56:39,725 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 12 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:39,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1431 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:56:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 10:56:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-07-12 10:56:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 126 states have (on average 1.2142857142857142) internal successors, (153), 128 states have internal predecessors, (153), 38 states have call successors, (38), 13 states have call predecessors, (38), 15 states have return successors, (48), 38 states have call predecessors, (48), 37 states have call successors, (48) [2022-07-12 10:56:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2022-07-12 10:56:39,734 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 76 [2022-07-12 10:56:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:39,734 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2022-07-12 10:56:39,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 10:56:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-07-12 10:56:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 10:56:39,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:39,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:39,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:39,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:39,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash 908856363, now seen corresponding path program 1 times [2022-07-12 10:56:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:39,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808600430] [2022-07-12 10:56:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:56:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:56:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:40,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808600430] [2022-07-12 10:56:40,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808600430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:40,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838218104] [2022-07-12 10:56:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:40,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:40,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:40,104 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) [2022-07-12 10:56:40,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:56:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:40,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:56:40,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:40,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838218104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:40,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:40,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-07-12 10:56:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029604384] [2022-07-12 10:56:40,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:40,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:56:40,454 INFO L87 Difference]: Start difference. First operand 180 states and 239 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 10:56:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:40,480 INFO L93 Difference]: Finished difference Result 342 states and 461 transitions. [2022-07-12 10:56:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:40,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2022-07-12 10:56:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:40,482 INFO L225 Difference]: With dead ends: 342 [2022-07-12 10:56:40,482 INFO L226 Difference]: Without dead ends: 183 [2022-07-12 10:56:40,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:40,483 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 9 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:40,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 561 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:56:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-12 10:56:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2022-07-12 10:56:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 128 states have internal predecessors, (151), 38 states have call successors, (38), 13 states have call predecessors, (38), 15 states have return successors, (48), 38 states have call predecessors, (48), 37 states have call successors, (48) [2022-07-12 10:56:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 237 transitions. [2022-07-12 10:56:40,490 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 237 transitions. Word has length 78 [2022-07-12 10:56:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:40,491 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 237 transitions. [2022-07-12 10:56:40,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 10:56:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 237 transitions. [2022-07-12 10:56:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 10:56:40,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:40,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:40,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:40,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 10:56:40,706 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1518245265, now seen corresponding path program 1 times [2022-07-12 10:56:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:40,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4170950] [2022-07-12 10:56:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:56:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:56:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:40,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4170950] [2022-07-12 10:56:40,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4170950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111511322] [2022-07-12 10:56:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:40,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:40,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:40,846 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) [2022-07-12 10:56:40,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 10:56:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:41,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:41,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:56:41,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:41,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111511322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:41,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:41,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-07-12 10:56:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031928037] [2022-07-12 10:56:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:41,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:56:41,216 INFO L87 Difference]: Start difference. First operand 180 states and 237 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 10:56:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:41,239 INFO L93 Difference]: Finished difference Result 348 states and 473 transitions. [2022-07-12 10:56:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2022-07-12 10:56:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:41,240 INFO L225 Difference]: With dead ends: 348 [2022-07-12 10:56:41,240 INFO L226 Difference]: Without dead ends: 189 [2022-07-12 10:56:41,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:41,242 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 34 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 559 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:56:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-12 10:56:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2022-07-12 10:56:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 122 states have (on average 1.180327868852459) internal successors, (144), 124 states have internal predecessors, (144), 38 states have call successors, (38), 13 states have call predecessors, (38), 15 states have return successors, (48), 38 states have call predecessors, (48), 37 states have call successors, (48) [2022-07-12 10:56:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 230 transitions. [2022-07-12 10:56:41,251 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 230 transitions. Word has length 78 [2022-07-12 10:56:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:41,252 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 230 transitions. [2022-07-12 10:56:41,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 10:56:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2022-07-12 10:56:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 10:56:41,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:41,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:41,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:41,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:41,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1074344591, now seen corresponding path program 1 times [2022-07-12 10:56:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:41,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574086574] [2022-07-12 10:56:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:41,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:56:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 10:56:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:42,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574086574] [2022-07-12 10:56:42,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574086574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:42,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787479575] [2022-07-12 10:56:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:42,184 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) [2022-07-12 10:56:42,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 10:56:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 2516 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 10:56:42,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:42,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:56:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:56:43,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:43,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787479575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:43,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:56:43,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-12 10:56:43,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424209713] [2022-07-12 10:56:43,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:43,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 10:56:43,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:43,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 10:56:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2022-07-12 10:56:43,266 INFO L87 Difference]: Start difference. First operand 176 states and 230 transitions. Second operand has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 22 states have internal predecessors, (97), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-12 10:56:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:45,320 INFO L93 Difference]: Finished difference Result 366 states and 491 transitions. [2022-07-12 10:56:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:56:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 22 states have internal predecessors, (97), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 78 [2022-07-12 10:56:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:45,322 INFO L225 Difference]: With dead ends: 366 [2022-07-12 10:56:45,322 INFO L226 Difference]: Without dead ends: 316 [2022-07-12 10:56:45,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1699, Unknown=2, NotChecked=0, Total=2070 [2022-07-12 10:56:45,324 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 424 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 963 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:45,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1200 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2319 Invalid, 0 Unknown, 963 Unchecked, 1.5s Time] [2022-07-12 10:56:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-12 10:56:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 228. [2022-07-12 10:56:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 45 states have call successors, (45), 15 states have call predecessors, (45), 20 states have return successors, (60), 47 states have call predecessors, (60), 44 states have call successors, (60) [2022-07-12 10:56:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 295 transitions. [2022-07-12 10:56:45,345 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 295 transitions. Word has length 78 [2022-07-12 10:56:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:45,345 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 295 transitions. [2022-07-12 10:56:45,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 22 states have internal predecessors, (97), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-12 10:56:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 295 transitions. [2022-07-12 10:56:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 10:56:45,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:45,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:45,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:45,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:45,567 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 94245687, now seen corresponding path program 1 times [2022-07-12 10:56:45,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:45,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954903003] [2022-07-12 10:56:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:45,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:56:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:56:45,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:45,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954903003] [2022-07-12 10:56:45,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954903003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:45,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204089965] [2022-07-12 10:56:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:45,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:45,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:45,971 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) [2022-07-12 10:56:45,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 10:56:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 10:56:46,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:46,347 INFO L390 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 6 treesize of output 5 [2022-07-12 10:56:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:56:46,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:49,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204089965] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:49,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:56:49,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2022-07-12 10:56:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270585878] [2022-07-12 10:56:49,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:49,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 10:56:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 10:56:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 10:56:49,264 INFO L87 Difference]: Start difference. First operand 228 states and 295 transitions. Second operand has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 23 states have internal predecessors, (83), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 10:56:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:52,117 INFO L93 Difference]: Finished difference Result 418 states and 588 transitions. [2022-07-12 10:56:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 10:56:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 23 states have internal predecessors, (83), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 78 [2022-07-12 10:56:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:52,119 INFO L225 Difference]: With dead ends: 418 [2022-07-12 10:56:52,120 INFO L226 Difference]: Without dead ends: 386 [2022-07-12 10:56:52,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=541, Invalid=2645, Unknown=6, NotChecked=0, Total=3192 [2022-07-12 10:56:52,121 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 478 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 4469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1236 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:52,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1237 Invalid, 4469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2861 Invalid, 0 Unknown, 1236 Unchecked, 1.9s Time] [2022-07-12 10:56:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-12 10:56:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 269. [2022-07-12 10:56:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 194 states have (on average 1.1546391752577319) internal successors, (224), 197 states have internal predecessors, (224), 51 states have call successors, (51), 17 states have call predecessors, (51), 23 states have return successors, (77), 54 states have call predecessors, (77), 50 states have call successors, (77) [2022-07-12 10:56:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 352 transitions. [2022-07-12 10:56:52,137 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 352 transitions. Word has length 78 [2022-07-12 10:56:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:52,138 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 352 transitions. [2022-07-12 10:56:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 23 states have internal predecessors, (83), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 10:56:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 352 transitions. [2022-07-12 10:56:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 10:56:52,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:52,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:52,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:52,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 10:56:52,348 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash 352411125, now seen corresponding path program 1 times [2022-07-12 10:56:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:52,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132088221] [2022-07-12 10:56:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:56:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 10:56:52,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:52,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132088221] [2022-07-12 10:56:52,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132088221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:52,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:52,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:56:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157825691] [2022-07-12 10:56:52,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:52,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:56:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:56:52,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:52,549 INFO L87 Difference]: Start difference. First operand 269 states and 352 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:53,071 INFO L93 Difference]: Finished difference Result 549 states and 769 transitions. [2022-07-12 10:56:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:53,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2022-07-12 10:56:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:53,074 INFO L225 Difference]: With dead ends: 549 [2022-07-12 10:56:53,074 INFO L226 Difference]: Without dead ends: 320 [2022-07-12 10:56:53,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:56:53,075 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 314 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:53,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 369 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:56:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-12 10:56:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 267. [2022-07-12 10:56:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 192 states have (on average 1.140625) internal successors, (219), 195 states have internal predecessors, (219), 51 states have call successors, (51), 17 states have call predecessors, (51), 23 states have return successors, (77), 54 states have call predecessors, (77), 50 states have call successors, (77) [2022-07-12 10:56:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 347 transitions. [2022-07-12 10:56:53,092 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 347 transitions. Word has length 78 [2022-07-12 10:56:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:53,092 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 347 transitions. [2022-07-12 10:56:53,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 347 transitions. [2022-07-12 10:56:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 10:56:53,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:53,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:53,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:56:53,095 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash -258842695, now seen corresponding path program 1 times [2022-07-12 10:56:53,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:53,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457598352] [2022-07-12 10:56:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:56:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 10:56:53,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:53,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457598352] [2022-07-12 10:56:53,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457598352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:53,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305525445] [2022-07-12 10:56:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:53,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:53,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:53,854 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:53,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 10:56:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 10:56:54,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:54,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:56:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:56:55,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:55,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305525445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:55,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:56:55,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2022-07-12 10:56:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526535486] [2022-07-12 10:56:55,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:55,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 10:56:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 10:56:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 10:56:55,640 INFO L87 Difference]: Start difference. First operand 267 states and 347 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-12 10:56:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:58,573 INFO L93 Difference]: Finished difference Result 387 states and 531 transitions. [2022-07-12 10:56:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 10:56:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 78 [2022-07-12 10:56:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:58,576 INFO L225 Difference]: With dead ends: 387 [2022-07-12 10:56:58,576 INFO L226 Difference]: Without dead ends: 355 [2022-07-12 10:56:58,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=493, Invalid=2263, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 10:56:58,577 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 473 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 639 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:58,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 914 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1409 Invalid, 0 Unknown, 639 Unchecked, 1.2s Time] [2022-07-12 10:56:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-12 10:56:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 291. [2022-07-12 10:56:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.1320754716981132) internal successors, (240), 218 states have internal predecessors, (240), 53 states have call successors, (53), 18 states have call predecessors, (53), 25 states have return successors, (81), 54 states have call predecessors, (81), 52 states have call successors, (81) [2022-07-12 10:56:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 374 transitions. [2022-07-12 10:56:58,597 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 374 transitions. Word has length 78 [2022-07-12 10:56:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:58,598 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 374 transitions. [2022-07-12 10:56:58,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-12 10:56:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 374 transitions. [2022-07-12 10:56:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 10:56:58,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:58,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:58,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:58,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 10:56:58,815 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash 394720380, now seen corresponding path program 1 times [2022-07-12 10:56:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:58,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723447147] [2022-07-12 10:56:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:56:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:56:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:56:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 10:56:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:59,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723447147] [2022-07-12 10:56:59,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723447147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:59,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:59,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:56:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054617701] [2022-07-12 10:56:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:59,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:56:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:56:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:56:59,025 INFO L87 Difference]: Start difference. First operand 291 states and 374 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:59,874 INFO L93 Difference]: Finished difference Result 347 states and 471 transitions. [2022-07-12 10:56:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:56:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2022-07-12 10:56:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:59,876 INFO L225 Difference]: With dead ends: 347 [2022-07-12 10:56:59,876 INFO L226 Difference]: Without dead ends: 345 [2022-07-12 10:56:59,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:56:59,876 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 145 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:59,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 872 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 10:56:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-12 10:56:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 291. [2022-07-12 10:56:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.1320754716981132) internal successors, (240), 218 states have internal predecessors, (240), 53 states have call successors, (53), 18 states have call predecessors, (53), 25 states have return successors, (81), 54 states have call predecessors, (81), 52 states have call successors, (81) [2022-07-12 10:56:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 374 transitions. [2022-07-12 10:56:59,892 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 374 transitions. Word has length 80 [2022-07-12 10:56:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:59,892 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 374 transitions. [2022-07-12 10:56:59,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:56:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 374 transitions. [2022-07-12 10:56:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 10:56:59,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:59,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:56:59,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 10:56:59,894 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1080266240, now seen corresponding path program 1 times [2022-07-12 10:56:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:59,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158150659] [2022-07-12 10:56:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:57:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:57:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:57:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:00,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158150659] [2022-07-12 10:57:00,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158150659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:00,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:00,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-12 10:57:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049770361] [2022-07-12 10:57:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:00,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 10:57:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 10:57:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:57:00,371 INFO L87 Difference]: Start difference. First operand 291 states and 374 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 10:57:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:01,986 INFO L93 Difference]: Finished difference Result 366 states and 496 transitions. [2022-07-12 10:57:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 10:57:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2022-07-12 10:57:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:01,989 INFO L225 Difference]: With dead ends: 366 [2022-07-12 10:57:01,989 INFO L226 Difference]: Without dead ends: 364 [2022-07-12 10:57:01,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 10:57:01,990 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 372 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:01,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 882 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 10:57:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-12 10:57:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 291. [2022-07-12 10:57:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.1320754716981132) internal successors, (240), 218 states have internal predecessors, (240), 53 states have call successors, (53), 18 states have call predecessors, (53), 25 states have return successors, (81), 54 states have call predecessors, (81), 52 states have call successors, (81) [2022-07-12 10:57:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 374 transitions. [2022-07-12 10:57:02,007 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 374 transitions. Word has length 80 [2022-07-12 10:57:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:02,007 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 374 transitions. [2022-07-12 10:57:02,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 10:57:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 374 transitions. [2022-07-12 10:57:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 10:57:02,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:02,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-07-12 10:57:02,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 10:57:02,009 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash -650434166, now seen corresponding path program 1 times [2022-07-12 10:57:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:02,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687018204] [2022-07-12 10:57:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:02,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:57:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 10:57:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:02,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687018204] [2022-07-12 10:57:02,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687018204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:02,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:02,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:57:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96735228] [2022-07-12 10:57:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:02,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:57:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:02,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:57:02,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:57:02,158 INFO L87 Difference]: Start difference. First operand 291 states and 374 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 10:57:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:02,563 INFO L93 Difference]: Finished difference Result 330 states and 435 transitions. [2022-07-12 10:57:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:57:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 81 [2022-07-12 10:57:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:02,565 INFO L225 Difference]: With dead ends: 330 [2022-07-12 10:57:02,565 INFO L226 Difference]: Without dead ends: 328 [2022-07-12 10:57:02,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:57:02,566 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 112 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:02,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 874 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:57:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-12 10:57:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 296. [2022-07-12 10:57:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 215 states have (on average 1.130232558139535) internal successors, (243), 221 states have internal predecessors, (243), 54 states have call successors, (54), 19 states have call predecessors, (54), 26 states have return successors, (82), 55 states have call predecessors, (82), 53 states have call successors, (82) [2022-07-12 10:57:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 379 transitions. [2022-07-12 10:57:02,598 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 379 transitions. Word has length 81 [2022-07-12 10:57:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:02,598 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 379 transitions. [2022-07-12 10:57:02,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 10:57:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 379 transitions. [2022-07-12 10:57:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 10:57:02,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:02,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:02,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 10:57:02,600 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -306040688, now seen corresponding path program 1 times [2022-07-12 10:57:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:02,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96845379] [2022-07-12 10:57:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:57:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:57:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 10:57:02,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:02,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96845379] [2022-07-12 10:57:02,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96845379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:02,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:02,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:57:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473044959] [2022-07-12 10:57:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:02,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:02,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:57:02,908 INFO L87 Difference]: Start difference. First operand 296 states and 379 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 6 states have internal predecessors, (48), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 10:57:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:03,656 INFO L93 Difference]: Finished difference Result 365 states and 495 transitions. [2022-07-12 10:57:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:57:03,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 6 states have internal predecessors, (48), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2022-07-12 10:57:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:03,658 INFO L225 Difference]: With dead ends: 365 [2022-07-12 10:57:03,658 INFO L226 Difference]: Without dead ends: 363 [2022-07-12 10:57:03,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:57:03,658 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 302 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:03,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 485 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 10:57:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-12 10:57:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 304. [2022-07-12 10:57:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.1278538812785388) internal successors, (247), 225 states have internal predecessors, (247), 57 states have call successors, (57), 20 states have call predecessors, (57), 27 states have return successors, (85), 58 states have call predecessors, (85), 56 states have call successors, (85) [2022-07-12 10:57:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 389 transitions. [2022-07-12 10:57:03,678 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 389 transitions. Word has length 86 [2022-07-12 10:57:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:03,678 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 389 transitions. [2022-07-12 10:57:03,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 6 states have internal predecessors, (48), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 10:57:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 389 transitions. [2022-07-12 10:57:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 10:57:03,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:03,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 10:57:03,679 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash 748766864, now seen corresponding path program 1 times [2022-07-12 10:57:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:03,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334319410] [2022-07-12 10:57:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:57:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 10:57:04,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:04,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334319410] [2022-07-12 10:57:04,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334319410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:04,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545356200] [2022-07-12 10:57:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:04,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:04,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:04,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:04,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 10:57:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 10:57:04,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:04,463 INFO L390 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 [2022-07-12 10:57:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:57:05,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:57:05,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545356200] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:05,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:05,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 34 [2022-07-12 10:57:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762698069] [2022-07-12 10:57:05,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:05,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 10:57:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:05,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 10:57:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 10:57:05,466 INFO L87 Difference]: Start difference. First operand 304 states and 389 transitions. Second operand has 34 states, 33 states have (on average 4.545454545454546) internal successors, (150), 29 states have internal predecessors, (150), 11 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-12 10:57:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:08,291 INFO L93 Difference]: Finished difference Result 708 states and 947 transitions. [2022-07-12 10:57:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 10:57:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.545454545454546) internal successors, (150), 29 states have internal predecessors, (150), 11 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) Word has length 85 [2022-07-12 10:57:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:08,293 INFO L225 Difference]: With dead ends: 708 [2022-07-12 10:57:08,293 INFO L226 Difference]: Without dead ends: 444 [2022-07-12 10:57:08,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 159 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=456, Invalid=3704, Unknown=0, NotChecked=0, Total=4160 [2022-07-12 10:57:08,295 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 433 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 3344 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 3344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:08,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 2407 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 3344 Invalid, 0 Unknown, 304 Unchecked, 1.9s Time] [2022-07-12 10:57:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-12 10:57:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 330. [2022-07-12 10:57:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 242 states have (on average 1.128099173553719) internal successors, (273), 250 states have internal predecessors, (273), 57 states have call successors, (57), 21 states have call predecessors, (57), 30 states have return successors, (89), 58 states have call predecessors, (89), 56 states have call successors, (89) [2022-07-12 10:57:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 419 transitions. [2022-07-12 10:57:08,315 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 419 transitions. Word has length 85 [2022-07-12 10:57:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:08,315 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 419 transitions. [2022-07-12 10:57:08,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.545454545454546) internal successors, (150), 29 states have internal predecessors, (150), 11 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-12 10:57:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 419 transitions. [2022-07-12 10:57:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:57:08,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:08,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:08,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:08,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 10:57:08,524 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1622871588, now seen corresponding path program 1 times [2022-07-12 10:57:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:08,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603283896] [2022-07-12 10:57:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:57:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 10:57:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603283896] [2022-07-12 10:57:08,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603283896] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744091787] [2022-07-12 10:57:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:08,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:08,713 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:08,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 10:57:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 2528 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 10:57:09,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:09,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:09,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:09,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:09,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 10:57:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:09,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 10:57:09,475 INFO L390 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 15 treesize of output 7 [2022-07-12 10:57:09,478 INFO L390 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 15 treesize of output 7 [2022-07-12 10:57:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 10:57:09,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:09,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744091787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:09,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:09,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2022-07-12 10:57:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949723815] [2022-07-12 10:57:09,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:09,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:57:09,492 INFO L87 Difference]: Start difference. First operand 330 states and 419 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-12 10:57:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:09,692 INFO L93 Difference]: Finished difference Result 689 states and 883 transitions. [2022-07-12 10:57:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:57:09,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 89 [2022-07-12 10:57:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:09,695 INFO L225 Difference]: With dead ends: 689 [2022-07-12 10:57:09,695 INFO L226 Difference]: Without dead ends: 421 [2022-07-12 10:57:09,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:57:09,697 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 29 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:09,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1028 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-07-12 10:57:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-07-12 10:57:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 371. [2022-07-12 10:57:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 274 states have (on average 1.1167883211678833) internal successors, (306), 282 states have internal predecessors, (306), 62 states have call successors, (62), 26 states have call predecessors, (62), 34 states have return successors, (95), 62 states have call predecessors, (95), 61 states have call successors, (95) [2022-07-12 10:57:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 463 transitions. [2022-07-12 10:57:09,721 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 463 transitions. Word has length 89 [2022-07-12 10:57:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:09,722 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 463 transitions. [2022-07-12 10:57:09,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-12 10:57:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 463 transitions. [2022-07-12 10:57:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:57:09,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:09,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:09,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:09,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 10:57:09,944 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1189142502, now seen corresponding path program 1 times [2022-07-12 10:57:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393659067] [2022-07-12 10:57:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:57:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 10:57:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393659067] [2022-07-12 10:57:10,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393659067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325261964] [2022-07-12 10:57:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:10,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:10,116 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:10,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 10:57:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 2533 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 10:57:10,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 10:57:10,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:10,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325261964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:10,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:10,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2022-07-12 10:57:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102480025] [2022-07-12 10:57:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:10,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:57:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:57:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:57:10,538 INFO L87 Difference]: Start difference. First operand 371 states and 463 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 10:57:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:10,598 INFO L93 Difference]: Finished difference Result 659 states and 827 transitions. [2022-07-12 10:57:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:57:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2022-07-12 10:57:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:10,600 INFO L225 Difference]: With dead ends: 659 [2022-07-12 10:57:10,601 INFO L226 Difference]: Without dead ends: 372 [2022-07-12 10:57:10,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:57:10,602 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 10 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:10,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:57:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-12 10:57:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2022-07-12 10:57:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 275 states have (on average 1.1163636363636364) internal successors, (307), 282 states have internal predecessors, (307), 62 states have call successors, (62), 26 states have call predecessors, (62), 34 states have return successors, (95), 63 states have call predecessors, (95), 61 states have call successors, (95) [2022-07-12 10:57:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 464 transitions. [2022-07-12 10:57:10,622 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 464 transitions. Word has length 89 [2022-07-12 10:57:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:10,622 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 464 transitions. [2022-07-12 10:57:10,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 10:57:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 464 transitions. [2022-07-12 10:57:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 10:57:10,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:10,624 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:10,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:10,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 10:57:10,835 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:10,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash 119789218, now seen corresponding path program 1 times [2022-07-12 10:57:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:10,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614449706] [2022-07-12 10:57:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:10,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:57:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:57:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:57:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 10:57:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:11,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614449706] [2022-07-12 10:57:11,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614449706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:11,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:11,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:57:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896417865] [2022-07-12 10:57:11,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:11,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:11,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:57:11,041 INFO L87 Difference]: Start difference. First operand 372 states and 464 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 10:57:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:11,783 INFO L93 Difference]: Finished difference Result 437 states and 579 transitions. [2022-07-12 10:57:11,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:57:11,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2022-07-12 10:57:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:11,785 INFO L225 Difference]: With dead ends: 437 [2022-07-12 10:57:11,785 INFO L226 Difference]: Without dead ends: 435 [2022-07-12 10:57:11,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:57:11,786 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 157 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:11,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 510 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:57:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-12 10:57:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 394. [2022-07-12 10:57:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 290 states have (on average 1.1172413793103448) internal successors, (324), 298 states have internal predecessors, (324), 66 states have call successors, (66), 27 states have call predecessors, (66), 37 states have return successors, (106), 68 states have call predecessors, (106), 65 states have call successors, (106) [2022-07-12 10:57:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2022-07-12 10:57:11,808 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 92 [2022-07-12 10:57:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:11,809 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2022-07-12 10:57:11,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 10:57:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2022-07-12 10:57:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 10:57:11,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:11,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-07-12 10:57:11,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 10:57:11,810 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1126537668, now seen corresponding path program 1 times [2022-07-12 10:57:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:11,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710964851] [2022-07-12 10:57:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 10:57:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710964851] [2022-07-12 10:57:12,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710964851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379894647] [2022-07-12 10:57:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:12,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:12,084 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:12,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 10:57:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:12,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 2543 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 10:57:12,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:12,463 INFO L390 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 6 treesize of output 5 [2022-07-12 10:57:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:57:13,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:57:13,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379894647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:13,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:13,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 14] total 37 [2022-07-12 10:57:13,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024752029] [2022-07-12 10:57:13,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:13,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 10:57:13,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 10:57:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 10:57:13,968 INFO L87 Difference]: Start difference. First operand 394 states and 496 transitions. Second operand has 37 states, 37 states have (on average 4.324324324324325) internal successors, (160), 34 states have internal predecessors, (160), 9 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-07-12 10:57:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:18,870 INFO L93 Difference]: Finished difference Result 757 states and 1005 transitions. [2022-07-12 10:57:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 10:57:18,871 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.324324324324325) internal successors, (160), 34 states have internal predecessors, (160), 9 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) Word has length 96 [2022-07-12 10:57:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:18,873 INFO L225 Difference]: With dead ends: 757 [2022-07-12 10:57:18,874 INFO L226 Difference]: Without dead ends: 633 [2022-07-12 10:57:18,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 185 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=577, Invalid=3455, Unknown=0, NotChecked=0, Total=4032 [2022-07-12 10:57:18,875 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 345 mSDsluCounter, 3172 mSDsCounter, 0 mSdLazyCounter, 5069 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 5805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 583 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:18,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 3453 Invalid, 5805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 5069 Invalid, 0 Unknown, 583 Unchecked, 3.7s Time] [2022-07-12 10:57:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-07-12 10:57:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 484. [2022-07-12 10:57:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 352 states have (on average 1.1392045454545454) internal successors, (401), 365 states have internal predecessors, (401), 86 states have call successors, (86), 29 states have call predecessors, (86), 45 states have return successors, (152), 89 states have call predecessors, (152), 85 states have call successors, (152) [2022-07-12 10:57:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 639 transitions. [2022-07-12 10:57:18,907 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 639 transitions. Word has length 96 [2022-07-12 10:57:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:18,907 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 639 transitions. [2022-07-12 10:57:18,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.324324324324325) internal successors, (160), 34 states have internal predecessors, (160), 9 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-07-12 10:57:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 639 transitions. [2022-07-12 10:57:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:57:18,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:18,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-07-12 10:57:18,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 10:57:19,128 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1329458343, now seen corresponding path program 1 times [2022-07-12 10:57:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:19,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508001238] [2022-07-12 10:57:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:57:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-12 10:57:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:19,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508001238] [2022-07-12 10:57:19,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508001238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:19,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:19,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:57:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268866670] [2022-07-12 10:57:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:19,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:57:19,434 INFO L87 Difference]: Start difference. First operand 484 states and 639 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-12 10:57:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:20,083 INFO L93 Difference]: Finished difference Result 843 states and 1120 transitions. [2022-07-12 10:57:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:57:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 91 [2022-07-12 10:57:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:20,086 INFO L225 Difference]: With dead ends: 843 [2022-07-12 10:57:20,086 INFO L226 Difference]: Without dead ends: 531 [2022-07-12 10:57:20,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:57:20,088 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 132 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:20,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 683 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:57:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-07-12 10:57:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 509. [2022-07-12 10:57:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 366 states have (on average 1.1366120218579234) internal successors, (416), 380 states have internal predecessors, (416), 94 states have call successors, (94), 30 states have call predecessors, (94), 48 states have return successors, (169), 98 states have call predecessors, (169), 93 states have call successors, (169) [2022-07-12 10:57:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 679 transitions. [2022-07-12 10:57:20,124 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 679 transitions. Word has length 91 [2022-07-12 10:57:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:20,125 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 679 transitions. [2022-07-12 10:57:20,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-12 10:57:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 679 transitions. [2022-07-12 10:57:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 10:57:20,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:20,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-07-12 10:57:20,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 10:57:20,127 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash -223113860, now seen corresponding path program 1 times [2022-07-12 10:57:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:20,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732203346] [2022-07-12 10:57:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:20,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:57:20,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:20,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732203346] [2022-07-12 10:57:20,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732203346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:20,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726673884] [2022-07-12 10:57:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:20,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:20,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:20,865 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:20,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 10:57:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 2553 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 10:57:21,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:21,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 34 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:57:21,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:57:22,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726673884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:22,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:22,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 11] total 36 [2022-07-12 10:57:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242585046] [2022-07-12 10:57:22,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:22,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 10:57:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:22,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 10:57:22,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 10:57:22,533 INFO L87 Difference]: Start difference. First operand 509 states and 679 transitions. Second operand has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 32 states have internal predecessors, (149), 9 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-12 10:57:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:25,505 INFO L93 Difference]: Finished difference Result 748 states and 959 transitions. [2022-07-12 10:57:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 10:57:25,506 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 32 states have internal predecessors, (149), 9 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) Word has length 96 [2022-07-12 10:57:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:25,508 INFO L225 Difference]: With dead ends: 748 [2022-07-12 10:57:25,508 INFO L226 Difference]: Without dead ends: 616 [2022-07-12 10:57:25,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2022-07-12 10:57:25,510 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 527 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:25,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1493 Invalid, 3356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2635 Invalid, 0 Unknown, 520 Unchecked, 2.0s Time] [2022-07-12 10:57:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-07-12 10:57:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 506. [2022-07-12 10:57:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 365 states have (on average 1.1342465753424658) internal successors, (414), 377 states have internal predecessors, (414), 94 states have call successors, (94), 30 states have call predecessors, (94), 46 states have return successors, (156), 98 states have call predecessors, (156), 93 states have call successors, (156) [2022-07-12 10:57:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 664 transitions. [2022-07-12 10:57:25,556 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 664 transitions. Word has length 96 [2022-07-12 10:57:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:25,556 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 664 transitions. [2022-07-12 10:57:25,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 32 states have internal predecessors, (149), 9 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-12 10:57:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 664 transitions. [2022-07-12 10:57:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 10:57:25,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:25,559 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:25,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:25,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:25,767 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1572301202, now seen corresponding path program 1 times [2022-07-12 10:57:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:25,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790906735] [2022-07-12 10:57:25,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:25,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:57:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:57:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:57:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 10:57:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 10:57:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:26,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790906735] [2022-07-12 10:57:26,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790906735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:26,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:26,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:57:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717021494] [2022-07-12 10:57:26,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:26,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:57:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:57:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:57:26,084 INFO L87 Difference]: Start difference. First operand 506 states and 664 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 10:57:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:26,800 INFO L93 Difference]: Finished difference Result 543 states and 726 transitions. [2022-07-12 10:57:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:57:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2022-07-12 10:57:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:26,802 INFO L225 Difference]: With dead ends: 543 [2022-07-12 10:57:26,803 INFO L226 Difference]: Without dead ends: 541 [2022-07-12 10:57:26,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:57:26,803 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 236 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:26,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 488 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:57:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-12 10:57:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 513. [2022-07-12 10:57:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 370 states have (on average 1.1324324324324324) internal successors, (419), 382 states have internal predecessors, (419), 95 states have call successors, (95), 31 states have call predecessors, (95), 47 states have return successors, (157), 99 states have call predecessors, (157), 94 states have call successors, (157) [2022-07-12 10:57:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 671 transitions. [2022-07-12 10:57:26,858 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 671 transitions. Word has length 99 [2022-07-12 10:57:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:26,858 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 671 transitions. [2022-07-12 10:57:26,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 10:57:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 671 transitions. [2022-07-12 10:57:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 10:57:26,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:26,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-07-12 10:57:26,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 10:57:26,860 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1103427007, now seen corresponding path program 1 times [2022-07-12 10:57:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:26,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321905911] [2022-07-12 10:57:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:27,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:27,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321905911] [2022-07-12 10:57:27,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321905911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:27,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:27,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:57:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091944996] [2022-07-12 10:57:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:27,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:57:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:27,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:57:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:57:27,023 INFO L87 Difference]: Start difference. First operand 513 states and 671 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:57:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:27,512 INFO L93 Difference]: Finished difference Result 523 states and 682 transitions. [2022-07-12 10:57:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:57:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 98 [2022-07-12 10:57:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:27,515 INFO L225 Difference]: With dead ends: 523 [2022-07-12 10:57:27,515 INFO L226 Difference]: Without dead ends: 521 [2022-07-12 10:57:27,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:57:27,516 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 119 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:27,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1090 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:57:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-07-12 10:57:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 513. [2022-07-12 10:57:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 370 states have (on average 1.1324324324324324) internal successors, (419), 382 states have internal predecessors, (419), 95 states have call successors, (95), 31 states have call predecessors, (95), 47 states have return successors, (157), 99 states have call predecessors, (157), 94 states have call successors, (157) [2022-07-12 10:57:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 671 transitions. [2022-07-12 10:57:27,556 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 671 transitions. Word has length 98 [2022-07-12 10:57:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:27,556 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 671 transitions. [2022-07-12 10:57:27,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 10:57:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 671 transitions. [2022-07-12 10:57:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 10:57:27,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:27,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 10:57:27,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 10:57:27,558 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -474748987, now seen corresponding path program 1 times [2022-07-12 10:57:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:27,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779687374] [2022-07-12 10:57:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 10:57:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:27,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779687374] [2022-07-12 10:57:27,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779687374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:27,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194601227] [2022-07-12 10:57:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:27,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:27,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:27,877 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:27,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 10:57:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:28,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 10:57:28,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:57:28,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:29,026 INFO L390 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 28 treesize of output 16 [2022-07-12 10:57:29,089 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 10:57:29,089 INFO L390 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 30 treesize of output 25 [2022-07-12 10:57:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:57:29,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194601227] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:29,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:29,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 25 [2022-07-12 10:57:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070367472] [2022-07-12 10:57:29,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:29,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 10:57:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:29,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 10:57:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-07-12 10:57:29,116 INFO L87 Difference]: Start difference. First operand 513 states and 671 transitions. Second operand has 25 states, 25 states have (on average 5.48) internal successors, (137), 22 states have internal predecessors, (137), 7 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-12 10:57:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:31,149 INFO L93 Difference]: Finished difference Result 725 states and 930 transitions. [2022-07-12 10:57:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 10:57:31,150 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 22 states have internal predecessors, (137), 7 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 98 [2022-07-12 10:57:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:31,152 INFO L225 Difference]: With dead ends: 725 [2022-07-12 10:57:31,152 INFO L226 Difference]: Without dead ends: 624 [2022-07-12 10:57:31,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 200 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=1574, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 10:57:31,154 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 303 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:31,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1558 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2576 Invalid, 0 Unknown, 418 Unchecked, 1.6s Time] [2022-07-12 10:57:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-07-12 10:57:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 535. [2022-07-12 10:57:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 391 states have (on average 1.1304347826086956) internal successors, (442), 404 states have internal predecessors, (442), 94 states have call successors, (94), 32 states have call predecessors, (94), 49 states have return successors, (155), 98 states have call predecessors, (155), 93 states have call successors, (155) [2022-07-12 10:57:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 691 transitions. [2022-07-12 10:57:31,195 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 691 transitions. Word has length 98 [2022-07-12 10:57:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:31,195 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 691 transitions. [2022-07-12 10:57:31,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 22 states have internal predecessors, (137), 7 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-12 10:57:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 691 transitions. [2022-07-12 10:57:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 10:57:31,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:31,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-07-12 10:57:31,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:31,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:31,406 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 204523267, now seen corresponding path program 1 times [2022-07-12 10:57:31,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:31,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554154103] [2022-07-12 10:57:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 10:57:31,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:31,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554154103] [2022-07-12 10:57:31,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554154103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:31,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:31,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 10:57:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023100151] [2022-07-12 10:57:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 10:57:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:31,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 10:57:31,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:57:31,905 INFO L87 Difference]: Start difference. First operand 535 states and 691 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 10:57:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:33,101 INFO L93 Difference]: Finished difference Result 565 states and 729 transitions. [2022-07-12 10:57:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 10:57:33,102 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 98 [2022-07-12 10:57:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:33,104 INFO L225 Difference]: With dead ends: 565 [2022-07-12 10:57:33,104 INFO L226 Difference]: Without dead ends: 563 [2022-07-12 10:57:33,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2022-07-12 10:57:33,105 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 210 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:33,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1139 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 10:57:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-07-12 10:57:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 539. [2022-07-12 10:57:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 394 states have (on average 1.1294416243654823) internal successors, (445), 407 states have internal predecessors, (445), 94 states have call successors, (94), 33 states have call predecessors, (94), 50 states have return successors, (155), 98 states have call predecessors, (155), 93 states have call successors, (155) [2022-07-12 10:57:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 694 transitions. [2022-07-12 10:57:33,154 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 694 transitions. Word has length 98 [2022-07-12 10:57:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:33,154 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 694 transitions. [2022-07-12 10:57:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 10:57:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 694 transitions. [2022-07-12 10:57:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 10:57:33,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:33,156 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:33,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 10:57:33,156 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 175619793, now seen corresponding path program 1 times [2022-07-12 10:57:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:33,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127008962] [2022-07-12 10:57:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:57:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:57:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 10:57:33,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:33,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127008962] [2022-07-12 10:57:33,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127008962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:33,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:33,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:57:33,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019893428] [2022-07-12 10:57:33,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:33,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:57:33,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:33,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:57:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:57:33,481 INFO L87 Difference]: Start difference. First operand 539 states and 694 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 10:57:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:34,556 INFO L93 Difference]: Finished difference Result 703 states and 884 transitions. [2022-07-12 10:57:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:57:34,556 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 102 [2022-07-12 10:57:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:34,558 INFO L225 Difference]: With dead ends: 703 [2022-07-12 10:57:34,558 INFO L226 Difference]: Without dead ends: 557 [2022-07-12 10:57:34,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:57:34,559 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 277 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:34,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 706 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 10:57:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-07-12 10:57:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 534. [2022-07-12 10:57:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 389 states have (on average 1.1285347043701799) internal successors, (439), 401 states have internal predecessors, (439), 95 states have call successors, (95), 33 states have call predecessors, (95), 49 states have return successors, (151), 99 states have call predecessors, (151), 93 states have call successors, (151) [2022-07-12 10:57:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 685 transitions. [2022-07-12 10:57:34,601 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 685 transitions. Word has length 102 [2022-07-12 10:57:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:34,601 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 685 transitions. [2022-07-12 10:57:34,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 11 states have internal predecessors, (62), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 10:57:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 685 transitions. [2022-07-12 10:57:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 10:57:34,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:34,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 10:57:34,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 10:57:34,603 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2142703970, now seen corresponding path program 1 times [2022-07-12 10:57:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:34,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676011573] [2022-07-12 10:57:34,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:34,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:57:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:57:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:57:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 10:57:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:35,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676011573] [2022-07-12 10:57:35,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676011573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:35,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:35,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:57:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869569275] [2022-07-12 10:57:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:35,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:57:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:35,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:57:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:57:35,254 INFO L87 Difference]: Start difference. First operand 534 states and 685 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 10:57:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:36,134 INFO L93 Difference]: Finished difference Result 566 states and 734 transitions. [2022-07-12 10:57:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:57:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 108 [2022-07-12 10:57:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:36,136 INFO L225 Difference]: With dead ends: 566 [2022-07-12 10:57:36,137 INFO L226 Difference]: Without dead ends: 564 [2022-07-12 10:57:36,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:57:36,137 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 158 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:36,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 642 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 10:57:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-07-12 10:57:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 538. [2022-07-12 10:57:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 392 states have (on average 1.1275510204081634) internal successors, (442), 404 states have internal predecessors, (442), 95 states have call successors, (95), 34 states have call predecessors, (95), 50 states have return successors, (151), 99 states have call predecessors, (151), 93 states have call successors, (151) [2022-07-12 10:57:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 688 transitions. [2022-07-12 10:57:36,183 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 688 transitions. Word has length 108 [2022-07-12 10:57:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:36,184 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 688 transitions. [2022-07-12 10:57:36,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 10:57:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 688 transitions. [2022-07-12 10:57:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 10:57:36,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:36,185 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:36,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 10:57:36,185 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:36,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1928597217, now seen corresponding path program 1 times [2022-07-12 10:57:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:36,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99571456] [2022-07-12 10:57:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 10:57:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 10:57:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:57:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:57:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:57:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:57:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 10:57:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 10:57:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:57:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 10:57:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 10:57:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99571456] [2022-07-12 10:57:36,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99571456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:36,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:36,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:57:36,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350441490] [2022-07-12 10:57:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:36,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:57:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:36,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:57:36,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:57:36,350 INFO L87 Difference]: Start difference. First operand 538 states and 688 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 10:57:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:36,757 INFO L93 Difference]: Finished difference Result 570 states and 741 transitions. [2022-07-12 10:57:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:57:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2022-07-12 10:57:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:36,759 INFO L225 Difference]: With dead ends: 570 [2022-07-12 10:57:36,759 INFO L226 Difference]: Without dead ends: 397 [2022-07-12 10:57:36,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:57:36,760 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 187 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:36,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 333 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:57:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-12 10:57:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 370. [2022-07-12 10:57:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 269 states have (on average 1.1226765799256506) internal successors, (302), 278 states have internal predecessors, (302), 67 states have call successors, (67), 22 states have call predecessors, (67), 33 states have return successors, (105), 69 states have call predecessors, (105), 63 states have call successors, (105) [2022-07-12 10:57:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 474 transitions. [2022-07-12 10:57:36,794 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 474 transitions. Word has length 116 [2022-07-12 10:57:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:36,794 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 474 transitions. [2022-07-12 10:57:36,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 10:57:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 474 transitions. [2022-07-12 10:57:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 10:57:36,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:36,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:36,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 10:57:36,796 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1800394554, now seen corresponding path program 1 times [2022-07-12 10:57:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:36,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898599006] [2022-07-12 10:57:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:36,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:57:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:57:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:57:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 10:57:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:57:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 10:57:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 10:57:37,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:37,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898599006] [2022-07-12 10:57:37,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898599006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:37,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:37,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 10:57:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440626651] [2022-07-12 10:57:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:37,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 10:57:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:37,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 10:57:37,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:57:37,253 INFO L87 Difference]: Start difference. First operand 370 states and 474 transitions. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 12 states have internal predecessors, (55), 7 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-12 10:57:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:38,217 INFO L93 Difference]: Finished difference Result 378 states and 485 transitions. [2022-07-12 10:57:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:57:38,217 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 12 states have internal predecessors, (55), 7 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 120 [2022-07-12 10:57:38,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:38,218 INFO L225 Difference]: With dead ends: 378 [2022-07-12 10:57:38,218 INFO L226 Difference]: Without dead ends: 345 [2022-07-12 10:57:38,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-07-12 10:57:38,219 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 133 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:38,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 666 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 10:57:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-12 10:57:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 328. [2022-07-12 10:57:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 237 states have (on average 1.1265822784810127) internal successors, (267), 244 states have internal predecessors, (267), 60 states have call successors, (60), 21 states have call predecessors, (60), 30 states have return successors, (97), 62 states have call predecessors, (97), 57 states have call successors, (97) [2022-07-12 10:57:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 424 transitions. [2022-07-12 10:57:38,248 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 424 transitions. Word has length 120 [2022-07-12 10:57:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:38,250 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 424 transitions. [2022-07-12 10:57:38,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 12 states have internal predecessors, (55), 7 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-12 10:57:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 424 transitions. [2022-07-12 10:57:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 10:57:38,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:38,251 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:38,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 10:57:38,251 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:38,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2129347606, now seen corresponding path program 1 times [2022-07-12 10:57:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:38,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913540191] [2022-07-12 10:57:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:57:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-12 10:57:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:38,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913540191] [2022-07-12 10:57:38,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913540191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:38,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:38,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:57:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794817903] [2022-07-12 10:57:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:38,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:57:38,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:57:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:57:38,423 INFO L87 Difference]: Start difference. First operand 328 states and 424 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:57:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:38,872 INFO L93 Difference]: Finished difference Result 461 states and 618 transitions. [2022-07-12 10:57:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:57:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2022-07-12 10:57:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:38,874 INFO L225 Difference]: With dead ends: 461 [2022-07-12 10:57:38,874 INFO L226 Difference]: Without dead ends: 358 [2022-07-12 10:57:38,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:57:38,874 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 101 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:38,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 466 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:57:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-12 10:57:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 334. [2022-07-12 10:57:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 242 states have (on average 1.1239669421487604) internal successors, (272), 248 states have internal predecessors, (272), 60 states have call successors, (60), 21 states have call predecessors, (60), 31 states have return successors, (99), 64 states have call predecessors, (99), 57 states have call successors, (99) [2022-07-12 10:57:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 431 transitions. [2022-07-12 10:57:38,907 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 431 transitions. Word has length 121 [2022-07-12 10:57:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:38,907 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 431 transitions. [2022-07-12 10:57:38,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:57:38,907 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2022-07-12 10:57:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 10:57:38,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:38,917 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:38,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 10:57:38,917 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 762400777, now seen corresponding path program 1 times [2022-07-12 10:57:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:38,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659172633] [2022-07-12 10:57:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:57:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:57:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-12 10:57:39,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:39,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659172633] [2022-07-12 10:57:39,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659172633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:39,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:39,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:57:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106731275] [2022-07-12 10:57:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:39,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:57:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:39,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:57:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:57:39,083 INFO L87 Difference]: Start difference. First operand 334 states and 431 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 10:57:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:39,546 INFO L93 Difference]: Finished difference Result 435 states and 568 transitions. [2022-07-12 10:57:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:57:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2022-07-12 10:57:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:39,547 INFO L225 Difference]: With dead ends: 435 [2022-07-12 10:57:39,547 INFO L226 Difference]: Without dead ends: 343 [2022-07-12 10:57:39,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:57:39,548 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 252 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:39,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 480 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:57:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-12 10:57:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 326. [2022-07-12 10:57:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 236 states have (on average 1.1144067796610169) internal successors, (263), 243 states have internal predecessors, (263), 58 states have call successors, (58), 21 states have call predecessors, (58), 31 states have return successors, (97), 61 states have call predecessors, (97), 55 states have call successors, (97) [2022-07-12 10:57:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 418 transitions. [2022-07-12 10:57:39,577 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 418 transitions. Word has length 127 [2022-07-12 10:57:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:39,577 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 418 transitions. [2022-07-12 10:57:39,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 10:57:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 418 transitions. [2022-07-12 10:57:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 10:57:39,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:39,578 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:39,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-12 10:57:39,579 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -258129269, now seen corresponding path program 1 times [2022-07-12 10:57:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:39,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199770264] [2022-07-12 10:57:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:57:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:57:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-12 10:57:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:39,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199770264] [2022-07-12 10:57:39,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199770264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:39,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:39,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:57:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372376095] [2022-07-12 10:57:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:39,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:57:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:57:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:57:39,788 INFO L87 Difference]: Start difference. First operand 326 states and 418 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:57:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:40,415 INFO L93 Difference]: Finished difference Result 353 states and 459 transitions. [2022-07-12 10:57:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:57:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 127 [2022-07-12 10:57:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:40,417 INFO L225 Difference]: With dead ends: 353 [2022-07-12 10:57:40,417 INFO L226 Difference]: Without dead ends: 349 [2022-07-12 10:57:40,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:57:40,417 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 286 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:40,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 609 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:57:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-12 10:57:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 333. [2022-07-12 10:57:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 239 states have (on average 1.112970711297071) internal successors, (266), 246 states have internal predecessors, (266), 61 states have call successors, (61), 22 states have call predecessors, (61), 32 states have return successors, (99), 64 states have call predecessors, (99), 58 states have call successors, (99) [2022-07-12 10:57:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 426 transitions. [2022-07-12 10:57:40,447 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 426 transitions. Word has length 127 [2022-07-12 10:57:40,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:40,447 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 426 transitions. [2022-07-12 10:57:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:57:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 426 transitions. [2022-07-12 10:57:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 10:57:40,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:40,449 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-12 10:57:40,449 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1955749090, now seen corresponding path program 1 times [2022-07-12 10:57:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:40,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988816901] [2022-07-12 10:57:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:57:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 10:57:40,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:40,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988816901] [2022-07-12 10:57:40,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988816901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:40,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:40,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:57:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782992292] [2022-07-12 10:57:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:40,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:57:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:57:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:57:40,632 INFO L87 Difference]: Start difference. First operand 333 states and 426 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 10:57:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:41,047 INFO L93 Difference]: Finished difference Result 460 states and 599 transitions. [2022-07-12 10:57:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:57:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2022-07-12 10:57:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:41,049 INFO L225 Difference]: With dead ends: 460 [2022-07-12 10:57:41,049 INFO L226 Difference]: Without dead ends: 351 [2022-07-12 10:57:41,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:57:41,050 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 173 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:41,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 550 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:57:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-12 10:57:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 333. [2022-07-12 10:57:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 239 states have (on average 1.112970711297071) internal successors, (266), 246 states have internal predecessors, (266), 61 states have call successors, (61), 22 states have call predecessors, (61), 32 states have return successors, (99), 64 states have call predecessors, (99), 58 states have call successors, (99) [2022-07-12 10:57:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 426 transitions. [2022-07-12 10:57:41,080 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 426 transitions. Word has length 128 [2022-07-12 10:57:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:41,080 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 426 transitions. [2022-07-12 10:57:41,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 10:57:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 426 transitions. [2022-07-12 10:57:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 10:57:41,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:41,081 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:57:41,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-12 10:57:41,082 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1110255069, now seen corresponding path program 1 times [2022-07-12 10:57:41,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:41,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020637622] [2022-07-12 10:57:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 10:57:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 10:57:41,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:41,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020637622] [2022-07-12 10:57:41,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020637622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:41,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:41,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:57:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702903196] [2022-07-12 10:57:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:41,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:57:41,264 INFO L87 Difference]: Start difference. First operand 333 states and 426 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:57:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:41,745 INFO L93 Difference]: Finished difference Result 351 states and 450 transitions. [2022-07-12 10:57:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:57:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 129 [2022-07-12 10:57:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:41,760 INFO L225 Difference]: With dead ends: 351 [2022-07-12 10:57:41,761 INFO L226 Difference]: Without dead ends: 349 [2022-07-12 10:57:41,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:57:41,761 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 185 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:41,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 725 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:57:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-12 10:57:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 340. [2022-07-12 10:57:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 242 states have (on average 1.1115702479338843) internal successors, (269), 249 states have internal predecessors, (269), 64 states have call successors, (64), 23 states have call predecessors, (64), 33 states have return successors, (102), 67 states have call predecessors, (102), 61 states have call successors, (102) [2022-07-12 10:57:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 435 transitions. [2022-07-12 10:57:41,792 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 435 transitions. Word has length 129 [2022-07-12 10:57:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:41,793 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 435 transitions. [2022-07-12 10:57:41,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:57:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 435 transitions. [2022-07-12 10:57:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 10:57:41,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:41,794 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-07-12 10:57:41,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 10:57:41,794 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1642854161, now seen corresponding path program 1 times [2022-07-12 10:57:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:41,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170912201] [2022-07-12 10:57:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:57:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:57:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 10:57:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:42,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170912201] [2022-07-12 10:57:42,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170912201] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:42,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621915184] [2022-07-12 10:57:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:42,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:42,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:42,131 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:42,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 10:57:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:42,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 2694 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 10:57:42,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:57:43,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:43,248 INFO L390 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 29 treesize of output 17 [2022-07-12 10:57:43,365 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 10:57:43,366 INFO L390 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 31 treesize of output 26 [2022-07-12 10:57:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:43,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621915184] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:43,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:43,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 27 [2022-07-12 10:57:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599331550] [2022-07-12 10:57:43,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:43,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 10:57:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 10:57:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2022-07-12 10:57:43,396 INFO L87 Difference]: Start difference. First operand 340 states and 435 transitions. Second operand has 27 states, 27 states have (on average 5.777777777777778) internal successors, (156), 22 states have internal predecessors, (156), 7 states have call successors, (31), 8 states have call predecessors, (31), 6 states have return successors, (25), 5 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 10:57:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:46,242 INFO L93 Difference]: Finished difference Result 631 states and 799 transitions. [2022-07-12 10:57:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 10:57:46,243 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.777777777777778) internal successors, (156), 22 states have internal predecessors, (156), 7 states have call successors, (31), 8 states have call predecessors, (31), 6 states have return successors, (25), 5 states have call predecessors, (25), 7 states have call successors, (25) Word has length 131 [2022-07-12 10:57:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:46,244 INFO L225 Difference]: With dead ends: 631 [2022-07-12 10:57:46,245 INFO L226 Difference]: Without dead ends: 381 [2022-07-12 10:57:46,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 280 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=1867, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 10:57:46,246 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 278 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:46,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1179 Invalid, 3484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 2735 Invalid, 0 Unknown, 574 Unchecked, 2.0s Time] [2022-07-12 10:57:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-12 10:57:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 346. [2022-07-12 10:57:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 249 states have (on average 1.104417670682731) internal successors, (275), 255 states have internal predecessors, (275), 63 states have call successors, (63), 24 states have call predecessors, (63), 33 states have return successors, (100), 66 states have call predecessors, (100), 60 states have call successors, (100) [2022-07-12 10:57:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 438 transitions. [2022-07-12 10:57:46,287 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 438 transitions. Word has length 131 [2022-07-12 10:57:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:46,288 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 438 transitions. [2022-07-12 10:57:46,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.777777777777778) internal successors, (156), 22 states have internal predecessors, (156), 7 states have call successors, (31), 8 states have call predecessors, (31), 6 states have return successors, (25), 5 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 10:57:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 438 transitions. [2022-07-12 10:57:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 10:57:46,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:46,289 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-07-12 10:57:46,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-12 10:57:46,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:46,490 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash 291468943, now seen corresponding path program 1 times [2022-07-12 10:57:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:46,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144900568] [2022-07-12 10:57:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:46,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:46,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:46,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:57:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:57:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 10:57:47,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:47,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144900568] [2022-07-12 10:57:47,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144900568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:47,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418617026] [2022-07-12 10:57:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:47,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:47,292 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:47,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 10:57:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:47,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 10:57:47,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:47,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 58 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 10:57:48,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:49,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418617026] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:49,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:49,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 10] total 37 [2022-07-12 10:57:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288856612] [2022-07-12 10:57:49,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:49,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 10:57:49,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:49,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 10:57:49,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 10:57:49,036 INFO L87 Difference]: Start difference. First operand 346 states and 438 transitions. Second operand has 37 states, 36 states have (on average 5.444444444444445) internal successors, (196), 32 states have internal predecessors, (196), 10 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (37), 8 states have call predecessors, (37), 9 states have call successors, (37) [2022-07-12 10:57:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:51,071 INFO L93 Difference]: Finished difference Result 432 states and 547 transitions. [2022-07-12 10:57:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 10:57:51,072 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 5.444444444444445) internal successors, (196), 32 states have internal predecessors, (196), 10 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (37), 8 states have call predecessors, (37), 9 states have call successors, (37) Word has length 131 [2022-07-12 10:57:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:51,073 INFO L225 Difference]: With dead ends: 432 [2022-07-12 10:57:51,073 INFO L226 Difference]: Without dead ends: 407 [2022-07-12 10:57:51,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 267 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=365, Invalid=2715, Unknown=0, NotChecked=0, Total=3080 [2022-07-12 10:57:51,075 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 435 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 491 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:51,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1216 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2288 Invalid, 0 Unknown, 491 Unchecked, 1.3s Time] [2022-07-12 10:57:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-07-12 10:57:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 368. [2022-07-12 10:57:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 265 states have (on average 1.0981132075471698) internal successors, (291), 273 states have internal predecessors, (291), 65 states have call successors, (65), 26 states have call predecessors, (65), 37 states have return successors, (114), 68 states have call predecessors, (114), 62 states have call successors, (114) [2022-07-12 10:57:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 470 transitions. [2022-07-12 10:57:51,110 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 470 transitions. Word has length 131 [2022-07-12 10:57:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:51,110 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 470 transitions. [2022-07-12 10:57:51,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 5.444444444444445) internal successors, (196), 32 states have internal predecessors, (196), 10 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (37), 8 states have call predecessors, (37), 9 states have call successors, (37) [2022-07-12 10:57:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 470 transitions. [2022-07-12 10:57:51,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 10:57:51,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:51,112 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-07-12 10:57:51,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:51,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:51,319 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:51,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1460059221, now seen corresponding path program 1 times [2022-07-12 10:57:51,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:51,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720730780] [2022-07-12 10:57:51,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:51,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:57:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:57:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:57:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:57:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 10:57:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:51,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720730780] [2022-07-12 10:57:51,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720730780] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:51,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725658267] [2022-07-12 10:57:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:51,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:51,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:51,692 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:51,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 10:57:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:52,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 2686 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 10:57:52,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 39 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 10:57:53,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:54,188 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 10:57:54,189 INFO L390 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 39 treesize of output 1 [2022-07-12 10:57:54,351 INFO L356 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-07-12 10:57:54,352 INFO L390 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 39 treesize of output 35 [2022-07-12 10:57:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:54,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725658267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:54,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:54,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 43 [2022-07-12 10:57:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459230638] [2022-07-12 10:57:54,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 10:57:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 10:57:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 10:57:54,431 INFO L87 Difference]: Start difference. First operand 368 states and 470 transitions. Second operand has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 37 states have internal predecessors, (204), 9 states have call successors, (38), 11 states have call predecessors, (38), 9 states have return successors, (34), 9 states have call predecessors, (34), 8 states have call successors, (34) [2022-07-12 10:57:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:59,372 INFO L93 Difference]: Finished difference Result 713 states and 916 transitions. [2022-07-12 10:57:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 10:57:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 37 states have internal predecessors, (204), 9 states have call successors, (38), 11 states have call predecessors, (38), 9 states have return successors, (34), 9 states have call predecessors, (34), 8 states have call successors, (34) Word has length 131 [2022-07-12 10:57:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:59,374 INFO L225 Difference]: With dead ends: 713 [2022-07-12 10:57:59,374 INFO L226 Difference]: Without dead ends: 482 [2022-07-12 10:57:59,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 255 SyntacticMatches, 13 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=794, Invalid=5212, Unknown=0, NotChecked=0, Total=6006 [2022-07-12 10:57:59,377 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 452 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 5561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1012 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:59,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2376 Invalid, 5561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 4353 Invalid, 0 Unknown, 1012 Unchecked, 3.0s Time] [2022-07-12 10:57:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-12 10:57:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 400. [2022-07-12 10:57:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 295 states have (on average 1.0949152542372882) internal successors, (323), 301 states have internal predecessors, (323), 64 states have call successors, (64), 30 states have call predecessors, (64), 40 states have return successors, (107), 68 states have call predecessors, (107), 61 states have call successors, (107) [2022-07-12 10:57:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 494 transitions. [2022-07-12 10:57:59,415 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 494 transitions. Word has length 131 [2022-07-12 10:57:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:59,416 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 494 transitions. [2022-07-12 10:57:59,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 37 states have internal predecessors, (204), 9 states have call successors, (38), 11 states have call predecessors, (38), 9 states have return successors, (34), 9 states have call predecessors, (34), 8 states have call successors, (34) [2022-07-12 10:57:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 494 transitions. [2022-07-12 10:57:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 10:57:59,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:59,417 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-07-12 10:57:59,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:59,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:59,631 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:59,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:59,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2079477013, now seen corresponding path program 1 times [2022-07-12 10:57:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:59,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578286090] [2022-07-12 10:57:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:59,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:57:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:58:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:58:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:58:00,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:00,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578286090] [2022-07-12 10:58:00,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578286090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:00,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638033618] [2022-07-12 10:58:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:00,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:58:00,209 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:58:00,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 10:58:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:00,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 2696 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 10:58:00,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:58:00,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:58:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 10:58:01,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:58:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:58:03,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638033618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:58:03,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:58:03,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 14] total 40 [2022-07-12 10:58:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608026581] [2022-07-12 10:58:03,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:58:03,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 10:58:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 10:58:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1416, Unknown=1, NotChecked=0, Total=1560 [2022-07-12 10:58:03,827 INFO L87 Difference]: Start difference. First operand 400 states and 494 transitions. Second operand has 40 states, 39 states have (on average 5.0256410256410255) internal successors, (196), 35 states have internal predecessors, (196), 9 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2022-07-12 10:58:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:07,060 INFO L93 Difference]: Finished difference Result 471 states and 573 transitions. [2022-07-12 10:58:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 10:58:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.0256410256410255) internal successors, (196), 35 states have internal predecessors, (196), 9 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) Word has length 131 [2022-07-12 10:58:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:07,062 INFO L225 Difference]: With dead ends: 471 [2022-07-12 10:58:07,062 INFO L226 Difference]: Without dead ends: 459 [2022-07-12 10:58:07,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 258 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=745, Invalid=3676, Unknown=1, NotChecked=0, Total=4422 [2022-07-12 10:58:07,064 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 395 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:07,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1066 Invalid, 3335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2615 Invalid, 0 Unknown, 562 Unchecked, 1.7s Time] [2022-07-12 10:58:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-12 10:58:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 430. [2022-07-12 10:58:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 322 states have (on average 1.093167701863354) internal successors, (352), 328 states have internal predecessors, (352), 64 states have call successors, (64), 33 states have call predecessors, (64), 43 states have return successors, (105), 68 states have call predecessors, (105), 61 states have call successors, (105) [2022-07-12 10:58:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 521 transitions. [2022-07-12 10:58:07,103 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 521 transitions. Word has length 131 [2022-07-12 10:58:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:07,103 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 521 transitions. [2022-07-12 10:58:07,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.0256410256410255) internal successors, (196), 35 states have internal predecessors, (196), 9 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2022-07-12 10:58:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 521 transitions. [2022-07-12 10:58:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 10:58:07,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:07,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:58:07,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 10:58:07,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:07,308 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 367115802, now seen corresponding path program 1 times [2022-07-12 10:58:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:07,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722329909] [2022-07-12 10:58:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:58:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:58:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-12 10:58:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722329909] [2022-07-12 10:58:07,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722329909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:07,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:07,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:58:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014214211] [2022-07-12 10:58:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:07,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:58:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:07,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:58:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:58:07,510 INFO L87 Difference]: Start difference. First operand 430 states and 521 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:58:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:08,283 INFO L93 Difference]: Finished difference Result 483 states and 612 transitions. [2022-07-12 10:58:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:58:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 133 [2022-07-12 10:58:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:08,285 INFO L225 Difference]: With dead ends: 483 [2022-07-12 10:58:08,285 INFO L226 Difference]: Without dead ends: 443 [2022-07-12 10:58:08,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2022-07-12 10:58:08,286 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 279 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:08,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 788 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:58:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-12 10:58:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2022-07-12 10:58:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 272 states have (on average 1.0919117647058822) internal successors, (297), 277 states have internal predecessors, (297), 62 states have call successors, (62), 30 states have call predecessors, (62), 37 states have return successors, (96), 64 states have call predecessors, (96), 59 states have call successors, (96) [2022-07-12 10:58:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 455 transitions. [2022-07-12 10:58:08,323 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 455 transitions. Word has length 133 [2022-07-12 10:58:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:08,323 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 455 transitions. [2022-07-12 10:58:08,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:58:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 455 transitions. [2022-07-12 10:58:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 10:58:08,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:08,324 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:58:08,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-12 10:58:08,324 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2135163427, now seen corresponding path program 1 times [2022-07-12 10:58:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:08,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303133973] [2022-07-12 10:58:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 10:58:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 10:58:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:08,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303133973] [2022-07-12 10:58:08,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303133973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:08,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:08,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:58:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728732440] [2022-07-12 10:58:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:08,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:58:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:08,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:58:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:58:08,507 INFO L87 Difference]: Start difference. First operand 372 states and 455 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 10:58:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:08,877 INFO L93 Difference]: Finished difference Result 539 states and 667 transitions. [2022-07-12 10:58:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:58:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 133 [2022-07-12 10:58:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:08,879 INFO L225 Difference]: With dead ends: 539 [2022-07-12 10:58:08,879 INFO L226 Difference]: Without dead ends: 362 [2022-07-12 10:58:08,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:58:08,880 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 175 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:08,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 377 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:58:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-12 10:58:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 356. [2022-07-12 10:58:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 262 states have (on average 1.0763358778625953) internal successors, (282), 267 states have internal predecessors, (282), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (91), 59 states have call predecessors, (91), 54 states have call successors, (91) [2022-07-12 10:58:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 430 transitions. [2022-07-12 10:58:08,918 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 430 transitions. Word has length 133 [2022-07-12 10:58:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:08,918 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 430 transitions. [2022-07-12 10:58:08,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 10:58:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 430 transitions. [2022-07-12 10:58:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 10:58:08,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:08,920 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:58:08,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-12 10:58:08,920 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash -671775652, now seen corresponding path program 1 times [2022-07-12 10:58:08,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:08,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702620701] [2022-07-12 10:58:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:58:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:58:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 10:58:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:09,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702620701] [2022-07-12 10:58:09,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702620701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:09,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:09,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 10:58:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821393501] [2022-07-12 10:58:09,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:09,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 10:58:09,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 10:58:09,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:58:09,473 INFO L87 Difference]: Start difference. First operand 356 states and 430 transitions. Second operand has 21 states, 20 states have (on average 3.85) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 10:58:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:10,897 INFO L93 Difference]: Finished difference Result 370 states and 446 transitions. [2022-07-12 10:58:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:58:10,897 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 133 [2022-07-12 10:58:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:10,898 INFO L225 Difference]: With dead ends: 370 [2022-07-12 10:58:10,899 INFO L226 Difference]: Without dead ends: 349 [2022-07-12 10:58:10,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 10:58:10,899 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 313 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:10,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 716 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 10:58:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-12 10:58:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 341. [2022-07-12 10:58:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 251 states have (on average 1.0756972111553784) internal successors, (270), 256 states have internal predecessors, (270), 55 states have call successors, (55), 27 states have call predecessors, (55), 34 states have return successors, (87), 57 states have call predecessors, (87), 52 states have call successors, (87) [2022-07-12 10:58:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 412 transitions. [2022-07-12 10:58:10,933 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 412 transitions. Word has length 133 [2022-07-12 10:58:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:10,933 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 412 transitions. [2022-07-12 10:58:10,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 10:58:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 412 transitions. [2022-07-12 10:58:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 10:58:10,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:10,935 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:58:10,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-12 10:58:10,935 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1709701502, now seen corresponding path program 1 times [2022-07-12 10:58:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:10,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384078232] [2022-07-12 10:58:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:58:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 10:58:11,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:11,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384078232] [2022-07-12 10:58:11,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384078232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:11,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:11,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 10:58:11,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687337664] [2022-07-12 10:58:11,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:11,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:58:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:11,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:58:11,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:58:11,270 INFO L87 Difference]: Start difference. First operand 341 states and 412 transitions. Second operand has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 8 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-12 10:58:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:11,930 INFO L93 Difference]: Finished difference Result 488 states and 597 transitions. [2022-07-12 10:58:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:58:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 8 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 134 [2022-07-12 10:58:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:11,931 INFO L225 Difference]: With dead ends: 488 [2022-07-12 10:58:11,931 INFO L226 Difference]: Without dead ends: 333 [2022-07-12 10:58:11,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:58:11,932 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 219 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:11,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 656 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:58:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-12 10:58:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-07-12 10:58:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 244 states have (on average 1.0655737704918034) internal successors, (260), 250 states have internal predecessors, (260), 55 states have call successors, (55), 27 states have call predecessors, (55), 33 states have return successors, (85), 55 states have call predecessors, (85), 52 states have call successors, (85) [2022-07-12 10:58:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 400 transitions. [2022-07-12 10:58:11,976 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 400 transitions. Word has length 134 [2022-07-12 10:58:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:11,977 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 400 transitions. [2022-07-12 10:58:11,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 8 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-12 10:58:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 400 transitions. [2022-07-12 10:58:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 10:58:11,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:11,978 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:58:11,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-12 10:58:11,978 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1572439748, now seen corresponding path program 1 times [2022-07-12 10:58:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:11,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514396606] [2022-07-12 10:58:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:58:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 10:58:12,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514396606] [2022-07-12 10:58:12,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514396606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245428576] [2022-07-12 10:58:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:12,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:58:12,599 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:58:12,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 10:58:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:12,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 2764 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 10:58:12,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:58:13,046 INFO L390 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 17 treesize of output 13 [2022-07-12 10:58:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 10:58:17,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:58:17,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245428576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:17,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:58:17,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 28 [2022-07-12 10:58:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487285714] [2022-07-12 10:58:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:58:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:58:17,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=672, Unknown=2, NotChecked=0, Total=756 [2022-07-12 10:58:17,480 INFO L87 Difference]: Start difference. First operand 333 states and 400 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 10:58:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:17,608 INFO L93 Difference]: Finished difference Result 444 states and 523 transitions. [2022-07-12 10:58:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:58:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 134 [2022-07-12 10:58:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:17,609 INFO L225 Difference]: With dead ends: 444 [2022-07-12 10:58:17,609 INFO L226 Difference]: Without dead ends: 330 [2022-07-12 10:58:17,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=99, Invalid=829, Unknown=2, NotChecked=0, Total=930 [2022-07-12 10:58:17,610 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 42 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:17,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 582 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 40 Unchecked, 0.0s Time] [2022-07-12 10:58:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-12 10:58:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2022-07-12 10:58:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 241 states have (on average 1.066390041493776) internal successors, (257), 247 states have internal predecessors, (257), 53 states have call successors, (53), 26 states have call predecessors, (53), 32 states have return successors, (79), 53 states have call predecessors, (79), 50 states have call successors, (79) [2022-07-12 10:58:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 389 transitions. [2022-07-12 10:58:17,644 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 389 transitions. Word has length 134 [2022-07-12 10:58:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:17,644 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 389 transitions. [2022-07-12 10:58:17,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 10:58:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 389 transitions. [2022-07-12 10:58:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 10:58:17,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:17,645 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-07-12 10:58:17,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-12 10:58:17,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-12 10:58:17,846 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash 845092170, now seen corresponding path program 1 times [2022-07-12 10:58:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:17,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753282737] [2022-07-12 10:58:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:17,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:58:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 10:58:18,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:18,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753282737] [2022-07-12 10:58:18,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753282737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:18,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76644676] [2022-07-12 10:58:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:18,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:18,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:58:18,441 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:58:18,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 10:58:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:18,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 2751 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-12 10:58:18,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:58:18,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:58:20,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-12 10:58:20,297 WARN L855 $PredicateComparison]: unable to prove that (exists ((|can_fail_realloc_#Ultimate.C_realloc_#res#1.base| Int)) (and (< |can_fail_realloc_#Ultimate.C_realloc_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1935 (Array Int Int))) (= (store |c_old(#memory_int)| |can_fail_realloc_#Ultimate.C_realloc_#res#1.base| v_ArrVal_1935) |c_#memory_int|)))) is different from true [2022-07-12 10:58:20,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:20,318 INFO L390 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 50 treesize of output 46 [2022-07-12 10:58:20,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:20,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:20,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:20,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:58:20,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2022-07-12 10:58:20,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:20,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:58:20,462 INFO L390 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 58 treesize of output 41 [2022-07-12 10:58:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 38 proven. 37 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 10:58:20,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:58:21,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1937 Int) (|v_can_fail_realloc_#Ultimate.C_realloc_#res#1.base_8| Int)) (or (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |v_can_fail_realloc_#Ultimate.C_realloc_#res#1.base_8| v_ArrVal_1942))) (store .cse0 |c_aws_byte_buf_reserve_aws_mem_realloc_~ptr#1.base| (store (select .cse0 |c_aws_byte_buf_reserve_aws_mem_realloc_~ptr#1.base|) |c_aws_byte_buf_reserve_aws_mem_realloc_~ptr#1.offset| v_ArrVal_1937))) |c_aws_byte_buf_reserve_~buffer#1.base|) |c_aws_byte_buf_reserve_~buffer#1.offset|) 18446744073709551616) (mod |c_aws_byte_buf_reserve_~requested_capacity#1| 18446744073709551616)) (not (< |v_can_fail_realloc_#Ultimate.C_realloc_#res#1.base_8| |c_#StackHeapBarrier|)))) is different from false [2022-07-12 10:58:21,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76644676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:21,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:58:21,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29] total 42 [2022-07-12 10:58:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738015530] [2022-07-12 10:58:21,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:58:21,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 10:58:21,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 10:58:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2058, Unknown=2, NotChecked=186, Total=2450 [2022-07-12 10:58:21,511 INFO L87 Difference]: Start difference. First operand 327 states and 389 transitions. Second operand has 42 states, 40 states have (on average 3.725) internal successors, (149), 38 states have internal predecessors, (149), 12 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (23), 12 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-12 10:58:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:24,083 INFO L93 Difference]: Finished difference Result 479 states and 575 transitions. [2022-07-12 10:58:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-12 10:58:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 3.725) internal successors, (149), 38 states have internal predecessors, (149), 12 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (23), 12 states have call predecessors, (23), 11 states have call successors, (23) Word has length 134 [2022-07-12 10:58:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:24,085 INFO L225 Difference]: With dead ends: 479 [2022-07-12 10:58:24,085 INFO L226 Difference]: Without dead ends: 378 [2022-07-12 10:58:24,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 159 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1799 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=564, Invalid=4956, Unknown=38, NotChecked=294, Total=5852 [2022-07-12 10:58:24,086 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 361 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:24,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1326 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1818 Invalid, 0 Unknown, 1046 Unchecked, 1.3s Time] [2022-07-12 10:58:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-12 10:58:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 325. [2022-07-12 10:58:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 242 states have (on average 1.0661157024793388) internal successors, (258), 247 states have internal predecessors, (258), 51 states have call successors, (51), 26 states have call predecessors, (51), 31 states have return successors, (67), 51 states have call predecessors, (67), 48 states have call successors, (67) [2022-07-12 10:58:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 376 transitions. [2022-07-12 10:58:24,124 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 376 transitions. Word has length 134 [2022-07-12 10:58:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:24,124 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 376 transitions. [2022-07-12 10:58:24,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 3.725) internal successors, (149), 38 states have internal predecessors, (149), 12 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (23), 12 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-12 10:58:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 376 transitions. [2022-07-12 10:58:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 10:58:24,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:24,125 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-07-12 10:58:24,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-12 10:58:24,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-12 10:58:24,326 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1553937270, now seen corresponding path program 1 times [2022-07-12 10:58:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:24,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054789678] [2022-07-12 10:58:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:58:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-12 10:58:25,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:25,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054789678] [2022-07-12 10:58:25,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054789678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:25,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152984392] [2022-07-12 10:58:25,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:25,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:25,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:58:25,760 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:58:25,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 10:58:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:26,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 10:58:26,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:58:26,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:58:37,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2022-07-12 10:58:37,936 WARN L855 $PredicateComparison]: unable to prove that (exists ((|can_fail_realloc_#Ultimate.C_realloc_#res#1.base| Int)) (and (exists ((v_ArrVal_2065 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |can_fail_realloc_#Ultimate.C_realloc_#res#1.base| v_ArrVal_2065))) (< |can_fail_realloc_#Ultimate.C_realloc_#res#1.base| |c_#StackHeapBarrier|))) is different from true [2022-07-12 10:58:37,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:37,956 INFO L390 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 59 treesize of output 53 [2022-07-12 10:58:38,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:38,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:38,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:38,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:58:38,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 52 [2022-07-12 10:58:38,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:58:38,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:58:38,150 INFO L390 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 67 treesize of output 44 [2022-07-12 10:58:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 10:58:38,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:58:43,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152984392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:43,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:58:43,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 46 [2022-07-12 10:58:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975376536] [2022-07-12 10:58:43,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:58:43,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 10:58:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:43,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 10:58:43,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2238, Unknown=39, NotChecked=96, Total=2550 [2022-07-12 10:58:43,259 INFO L87 Difference]: Start difference. First operand 325 states and 376 transitions. Second operand has 46 states, 43 states have (on average 3.7674418604651163) internal successors, (162), 42 states have internal predecessors, (162), 13 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2022-07-12 10:58:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:50,076 INFO L93 Difference]: Finished difference Result 466 states and 531 transitions. [2022-07-12 10:58:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 10:58:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 3.7674418604651163) internal successors, (162), 42 states have internal predecessors, (162), 13 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) Word has length 134 [2022-07-12 10:58:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:50,079 INFO L225 Difference]: With dead ends: 466 [2022-07-12 10:58:50,079 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 10:58:50,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 155 SyntacticMatches, 15 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=745, Invalid=6689, Unknown=52, NotChecked=170, Total=7656 [2022-07-12 10:58:50,095 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 294 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 4429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1287 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:50,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1073 Invalid, 4429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3021 Invalid, 0 Unknown, 1287 Unchecked, 2.9s Time] [2022-07-12 10:58:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 10:58:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2022-07-12 10:58:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 214 states have (on average 1.0654205607476634) internal successors, (228), 218 states have internal predecessors, (228), 44 states have call successors, (44), 23 states have call predecessors, (44), 27 states have return successors, (57), 44 states have call predecessors, (57), 42 states have call successors, (57) [2022-07-12 10:58:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2022-07-12 10:58:50,138 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 134 [2022-07-12 10:58:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:50,138 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2022-07-12 10:58:50,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 3.7674418604651163) internal successors, (162), 42 states have internal predecessors, (162), 13 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2022-07-12 10:58:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2022-07-12 10:58:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 10:58:50,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:50,140 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:58:50,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-12 10:58:50,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:50,340 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash 462581892, now seen corresponding path program 1 times [2022-07-12 10:58:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:50,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393412882] [2022-07-12 10:58:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:58:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 10:58:50,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393412882] [2022-07-12 10:58:50,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393412882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:50,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:50,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:58:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015268749] [2022-07-12 10:58:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:58:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:58:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:58:50,475 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 10:58:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:50,703 INFO L93 Difference]: Finished difference Result 370 states and 430 transitions. [2022-07-12 10:58:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:58:50,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 134 [2022-07-12 10:58:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:50,705 INFO L225 Difference]: With dead ends: 370 [2022-07-12 10:58:50,705 INFO L226 Difference]: Without dead ends: 286 [2022-07-12 10:58:50,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:58:50,706 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:50,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 314 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:58:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-12 10:58:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-07-12 10:58:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 214 states have (on average 1.0560747663551402) internal successors, (226), 218 states have internal predecessors, (226), 44 states have call successors, (44), 23 states have call predecessors, (44), 27 states have return successors, (57), 44 states have call predecessors, (57), 42 states have call successors, (57) [2022-07-12 10:58:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 327 transitions. [2022-07-12 10:58:50,743 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 327 transitions. Word has length 134 [2022-07-12 10:58:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:50,743 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 327 transitions. [2022-07-12 10:58:50,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 10:58:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 327 transitions. [2022-07-12 10:58:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 10:58:50,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:50,744 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-07-12 10:58:50,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-12 10:58:50,744 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -641305329, now seen corresponding path program 1 times [2022-07-12 10:58:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579022969] [2022-07-12 10:58:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:58:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 10:58:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579022969] [2022-07-12 10:58:50,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579022969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:50,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:50,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:58:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28894409] [2022-07-12 10:58:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:50,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:58:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:58:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:58:50,964 INFO L87 Difference]: Start difference. First operand 286 states and 327 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:58:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:51,485 INFO L93 Difference]: Finished difference Result 294 states and 335 transitions. [2022-07-12 10:58:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:58:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 136 [2022-07-12 10:58:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:51,486 INFO L225 Difference]: With dead ends: 294 [2022-07-12 10:58:51,486 INFO L226 Difference]: Without dead ends: 292 [2022-07-12 10:58:51,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:58:51,487 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:51,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 743 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:58:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-12 10:58:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2022-07-12 10:58:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 217 states have (on average 1.055299539170507) internal successors, (229), 221 states have internal predecessors, (229), 45 states have call successors, (45), 24 states have call predecessors, (45), 28 states have return successors, (58), 45 states have call predecessors, (58), 43 states have call successors, (58) [2022-07-12 10:58:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 332 transitions. [2022-07-12 10:58:51,523 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 332 transitions. Word has length 136 [2022-07-12 10:58:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:51,523 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 332 transitions. [2022-07-12 10:58:51,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 10:58:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 332 transitions. [2022-07-12 10:58:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 10:58:51,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:51,524 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 10:58:51,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-07-12 10:58:51,525 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 59759249, now seen corresponding path program 1 times [2022-07-12 10:58:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:51,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421214856] [2022-07-12 10:58:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:58:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 10:58:52,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:52,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421214856] [2022-07-12 10:58:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421214856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:52,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:52,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-12 10:58:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500020730] [2022-07-12 10:58:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:52,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 10:58:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 10:58:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2022-07-12 10:58:52,524 INFO L87 Difference]: Start difference. First operand 291 states and 332 transitions. Second operand has 27 states, 26 states have (on average 3.0) internal successors, (78), 20 states have internal predecessors, (78), 8 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 10:58:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:54,548 INFO L93 Difference]: Finished difference Result 297 states and 337 transitions. [2022-07-12 10:58:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:58:54,549 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 20 states have internal predecessors, (78), 8 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) Word has length 136 [2022-07-12 10:58:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:54,550 INFO L225 Difference]: With dead ends: 297 [2022-07-12 10:58:54,550 INFO L226 Difference]: Without dead ends: 295 [2022-07-12 10:58:54,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1949, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 10:58:54,550 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 202 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:54,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 923 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 10:58:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-12 10:58:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-07-12 10:58:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 220 states have (on average 1.0545454545454545) internal successors, (232), 224 states have internal predecessors, (232), 45 states have call successors, (45), 25 states have call predecessors, (45), 29 states have return successors, (58), 45 states have call predecessors, (58), 43 states have call successors, (58) [2022-07-12 10:58:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 335 transitions. [2022-07-12 10:58:54,590 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 335 transitions. Word has length 136 [2022-07-12 10:58:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:54,590 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 335 transitions. [2022-07-12 10:58:54,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 20 states have internal predecessors, (78), 8 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 10:58:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 335 transitions. [2022-07-12 10:58:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 10:58:54,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:54,591 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:58:54,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-12 10:58:54,592 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2034696283, now seen corresponding path program 1 times [2022-07-12 10:58:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:54,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372282143] [2022-07-12 10:58:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:54,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:54,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 10:58:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:58:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 10:58:55,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:55,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372282143] [2022-07-12 10:58:55,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372282143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:55,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76219646] [2022-07-12 10:58:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:55,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:55,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:58:55,304 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:58:55,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-12 10:58:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:55,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 10:58:55,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:58:55,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:58:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 57 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:58:56,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:58:56,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76219646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:56,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:58:56,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 34 [2022-07-12 10:58:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143775288] [2022-07-12 10:58:56,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:58:56,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 10:58:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 10:58:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 10:58:56,739 INFO L87 Difference]: Start difference. First operand 295 states and 335 transitions. Second operand has 34 states, 33 states have (on average 4.787878787878788) internal successors, (158), 29 states have internal predecessors, (158), 12 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (27), 10 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-12 10:58:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:58,651 INFO L93 Difference]: Finished difference Result 328 states and 371 transitions. [2022-07-12 10:58:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 10:58:58,652 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.787878787878788) internal successors, (158), 29 states have internal predecessors, (158), 12 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (27), 10 states have call predecessors, (27), 11 states have call successors, (27) Word has length 138 [2022-07-12 10:58:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:58,653 INFO L225 Difference]: With dead ends: 328 [2022-07-12 10:58:58,653 INFO L226 Difference]: Without dead ends: 286 [2022-07-12 10:58:58,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 179 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=450, Invalid=3332, Unknown=0, NotChecked=0, Total=3782 [2022-07-12 10:58:58,655 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 336 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:58,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1102 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1910 Invalid, 0 Unknown, 414 Unchecked, 1.0s Time] [2022-07-12 10:58:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-12 10:58:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 277. [2022-07-12 10:58:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 207 states have (on average 1.0531400966183575) internal successors, (218), 211 states have internal predecessors, (218), 42 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (54), 42 states have call predecessors, (54), 41 states have call successors, (54) [2022-07-12 10:58:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 314 transitions. [2022-07-12 10:58:58,705 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 314 transitions. Word has length 138 [2022-07-12 10:58:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:58,706 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 314 transitions. [2022-07-12 10:58:58,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.787878787878788) internal successors, (158), 29 states have internal predecessors, (158), 12 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (27), 10 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-12 10:58:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 314 transitions. [2022-07-12 10:58:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 10:58:58,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:58,707 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 10:58:58,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-12 10:58:58,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:58,908 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:58,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1512809225, now seen corresponding path program 1 times [2022-07-12 10:58:58,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:58,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901867032] [2022-07-12 10:58:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:58,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:58:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:58,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:58,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:58:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:58:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:58:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:58:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:58:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:58:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:58:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 10:58:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 10:58:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:59,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901867032] [2022-07-12 10:58:59,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901867032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:58:59,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:58:59,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:58:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095062747] [2022-07-12 10:58:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:58:59,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:58:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:59,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:58:59,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:58:59,062 INFO L87 Difference]: Start difference. First operand 277 states and 314 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 10:58:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:59,364 INFO L93 Difference]: Finished difference Result 343 states and 387 transitions. [2022-07-12 10:58:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:58:59,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2022-07-12 10:58:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:59,365 INFO L225 Difference]: With dead ends: 343 [2022-07-12 10:58:59,365 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 10:58:59,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:58:59,366 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 174 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:59,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 395 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:58:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 10:58:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 242. [2022-07-12 10:58:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 185 states have (on average 1.0486486486486486) internal successors, (194), 187 states have internal predecessors, (194), 34 states have call successors, (34), 21 states have call predecessors, (34), 22 states have return successors, (38), 33 states have call predecessors, (38), 33 states have call successors, (38) [2022-07-12 10:58:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 266 transitions. [2022-07-12 10:58:59,401 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 266 transitions. Word has length 140 [2022-07-12 10:58:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:59,401 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 266 transitions. [2022-07-12 10:58:59,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 10:58:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2022-07-12 10:58:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 10:58:59,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:59,403 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-07-12 10:58:59,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-07-12 10:58:59,403 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash -271908259, now seen corresponding path program 1 times [2022-07-12 10:58:59,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:59,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148276398] [2022-07-12 10:58:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:59,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:58:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:59,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:58:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:59:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:59:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:59:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:59:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:59:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:59:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:59:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:59:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 10:59:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:59:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:59:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:59:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 10:59:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-12 10:59:00,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148276398] [2022-07-12 10:59:00,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148276398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:59:00,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:59:00,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-12 10:59:00,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238695421] [2022-07-12 10:59:00,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:59:00,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 10:59:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:00,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 10:59:00,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-07-12 10:59:00,759 INFO L87 Difference]: Start difference. First operand 242 states and 266 transitions. Second operand has 27 states, 24 states have (on average 3.0) internal successors, (72), 21 states have internal predecessors, (72), 12 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-07-12 10:59:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:02,113 INFO L93 Difference]: Finished difference Result 258 states and 289 transitions. [2022-07-12 10:59:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 10:59:02,113 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 3.0) internal successors, (72), 21 states have internal predecessors, (72), 12 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) Word has length 158 [2022-07-12 10:59:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:02,114 INFO L225 Difference]: With dead ends: 258 [2022-07-12 10:59:02,114 INFO L226 Difference]: Without dead ends: 256 [2022-07-12 10:59:02,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 10:59:02,115 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 146 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:02,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 444 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 10:59:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-12 10:59:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2022-07-12 10:59:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.047872340425532) internal successors, (197), 190 states have internal predecessors, (197), 34 states have call successors, (34), 22 states have call predecessors, (34), 23 states have return successors, (38), 33 states have call predecessors, (38), 33 states have call successors, (38) [2022-07-12 10:59:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2022-07-12 10:59:02,142 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 158 [2022-07-12 10:59:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:02,142 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2022-07-12 10:59:02,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 3.0) internal successors, (72), 21 states have internal predecessors, (72), 12 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-07-12 10:59:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2022-07-12 10:59:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 10:59:02,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:02,143 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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] [2022-07-12 10:59:02,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-12 10:59:02,143 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1688655625, now seen corresponding path program 1 times [2022-07-12 10:59:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305117232] [2022-07-12 10:59:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:59:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:59:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:59:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:59:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:59:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:59:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:59:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:59:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:59:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:59:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 10:59:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:59:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:59:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:59:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-12 10:59:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:02,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305117232] [2022-07-12 10:59:02,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305117232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:59:02,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:59:02,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:59:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384110407] [2022-07-12 10:59:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:59:02,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:59:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:59:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:59:02,323 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 10:59:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:02,545 INFO L93 Difference]: Finished difference Result 307 states and 337 transitions. [2022-07-12 10:59:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:59:02,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-07-12 10:59:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:02,548 INFO L225 Difference]: With dead ends: 307 [2022-07-12 10:59:02,548 INFO L226 Difference]: Without dead ends: 246 [2022-07-12 10:59:02,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:59:02,548 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 106 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:02,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 253 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:59:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-12 10:59:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-07-12 10:59:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.0425531914893618) internal successors, (196), 190 states have internal predecessors, (196), 34 states have call successors, (34), 22 states have call predecessors, (34), 23 states have return successors, (38), 33 states have call predecessors, (38), 33 states have call successors, (38) [2022-07-12 10:59:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 268 transitions. [2022-07-12 10:59:02,576 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 268 transitions. Word has length 162 [2022-07-12 10:59:02,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:02,577 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 268 transitions. [2022-07-12 10:59:02,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 10:59:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 268 transitions. [2022-07-12 10:59:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 10:59:02,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:02,578 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 10:59:02,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-12 10:59:02,578 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1779804813, now seen corresponding path program 1 times [2022-07-12 10:59:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:02,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442323590] [2022-07-12 10:59:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:59:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:59:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:59:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:59:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:59:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:59:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:59:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:59:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:59:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:59:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 10:59:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:59:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:59:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:59:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 10:59:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 10:59:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 10:59:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 10:59:03,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:03,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442323590] [2022-07-12 10:59:03,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442323590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:59:03,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:59:03,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-12 10:59:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418240329] [2022-07-12 10:59:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:59:03,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 10:59:03,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:03,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 10:59:03,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:59:03,422 INFO L87 Difference]: Start difference. First operand 246 states and 268 transitions. Second operand has 22 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 11 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (19), 10 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-12 10:59:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:04,339 INFO L93 Difference]: Finished difference Result 270 states and 294 transitions. [2022-07-12 10:59:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:59:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 11 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (19), 10 states have call predecessors, (19), 10 states have call successors, (19) Word has length 180 [2022-07-12 10:59:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:04,340 INFO L225 Difference]: With dead ends: 270 [2022-07-12 10:59:04,340 INFO L226 Difference]: Without dead ends: 233 [2022-07-12 10:59:04,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2022-07-12 10:59:04,341 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 222 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:04,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 498 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:59:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-12 10:59:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2022-07-12 10:59:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.0289017341040463) internal successors, (178), 175 states have internal predecessors, (178), 34 states have call successors, (34), 21 states have call predecessors, (34), 22 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37) [2022-07-12 10:59:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 249 transitions. [2022-07-12 10:59:04,369 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 249 transitions. Word has length 180 [2022-07-12 10:59:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:04,370 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 249 transitions. [2022-07-12 10:59:04,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 11 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (19), 10 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-12 10:59:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 249 transitions. [2022-07-12 10:59:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 10:59:04,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:04,371 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 10:59:04,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-12 10:59:04,371 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:04,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:04,371 INFO L85 PathProgramCache]: Analyzing trace with hash -611214535, now seen corresponding path program 1 times [2022-07-12 10:59:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:04,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565261025] [2022-07-12 10:59:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:59:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:59:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:59:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 10:59:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:59:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:59:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 10:59:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 10:59:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:59:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:59:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 10:59:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:59:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:59:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:59:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 10:59:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 10:59:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 10:59:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 66 proven. 7 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 10:59:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:04,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565261025] [2022-07-12 10:59:04,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565261025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:59:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301857613] [2022-07-12 10:59:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:04,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:59:04,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:59:04,792 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:59:04,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-12 10:59:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:05,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 2861 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 10:59:05,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:59:05,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:59:05,658 INFO L390 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 17 treesize of output 13 [2022-07-12 10:59:05,706 INFO L390 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 51 treesize of output 39 [2022-07-12 10:59:07,736 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_reserve_#in~buffer#1.offset_BEFORE_CALL_6| Int) (|v_aws_byte_buf_reserve_#in~buffer#1.base_BEFORE_CALL_6| Int) (aux_div_aux_mod_v_arrayElimCell_33_45_56 Int) (aux_div_aux_mod_aux_mod_v_arrayElimCell_33_45_56_242 Int)) (let ((.cse0 (* aux_div_aux_mod_v_arrayElimCell_33_45_56 18446744073709551616)) (.cse1 (select (select |c_#memory_int| |v_aws_byte_buf_reserve_#in~buffer#1.base_BEFORE_CALL_6|) (+ 16 |v_aws_byte_buf_reserve_#in~buffer#1.offset_BEFORE_CALL_6|)))) (and (< (+ 1 (* 18446744073709551616 aux_div_aux_mod_aux_mod_v_arrayElimCell_33_45_56_242)) (+ .cse0 .cse1)) (< .cse0 18446744073709551616) (< (div (+ (* (- 1) .cse1) 18446744073709551615) (- 18446744073709551616)) (+ aux_div_aux_mod_aux_mod_v_arrayElimCell_33_45_56_242 1))))) is different from true [2022-07-12 10:59:08,214 INFO L390 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 51 treesize of output 39 [2022-07-12 10:59:08,701 INFO L390 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 51 treesize of output 39 [2022-07-12 10:59:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 61 proven. 35 refuted. 15 times theorem prover too weak. 48 trivial. 1 not checked. [2022-07-12 10:59:14,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:59:26,400 INFO L356 Elim1Store]: treesize reduction 14, result has 60.0 percent of original size [2022-07-12 10:59:26,401 INFO L390 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 121 treesize of output 117 [2022-07-12 10:59:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 52 proven. 44 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 10:59:26,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301857613] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:59:26,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:59:26,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26, 19] total 53 [2022-07-12 10:59:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016570755] [2022-07-12 10:59:26,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:59:26,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 10:59:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:26,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 10:59:26,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2427, Unknown=6, NotChecked=100, Total=2756 [2022-07-12 10:59:26,969 INFO L87 Difference]: Start difference. First operand 230 states and 249 transitions. Second operand has 53 states, 50 states have (on average 4.82) internal successors, (241), 48 states have internal predecessors, (241), 18 states have call successors, (50), 9 states have call predecessors, (50), 13 states have return successors, (48), 15 states have call predecessors, (48), 17 states have call successors, (48)