./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_from_array_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 bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 17:01:10,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 17:01:10,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 17:01:10,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 17:01:10,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 17:01:10,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 17:01:10,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 17:01:10,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 17:01:10,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 17:01:10,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 17:01:10,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 17:01:10,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 17:01:10,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 17:01:10,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 17:01:10,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 17:01:10,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 17:01:10,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 17:01:10,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 17:01:10,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 17:01:10,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 17:01:10,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 17:01:10,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 17:01:10,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 17:01:10,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 17:01:10,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 17:01:10,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 17:01:10,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 17:01:10,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 17:01:10,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 17:01:10,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 17:01:10,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 17:01:10,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 17:01:10,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 17:01:10,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 17:01:10,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 17:01:10,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 17:01:10,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 17:01:10,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 17:01:10,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 17:01:10,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 17:01:10,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 17:01:10,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 17:01:10,355 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 17:01:10,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 17:01:10,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 17:01:10,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 17:01:10,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 17:01:10,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 17:01:10,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 17:01:10,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 17:01:10,358 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 17:01:10,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 17:01:10,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 17:01:10,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 17:01:10,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 17:01:10,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 17:01:10,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 17:01:10,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 17:01:10,359 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 17:01:10,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 17:01:10,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 17:01:10,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 17:01:10,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 17:01:10,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:01:10,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 17:01:10,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 17:01:10,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 17:01:10,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 17:01:10,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 17:01:10,361 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 17:01:10,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 17:01:10,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 17:01:10,362 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 17:01:10,362 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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2021-12-14 17:01:10,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 17:01:10,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 17:01:10,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 17:01:10,621 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 17:01:10,621 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 17:01:10,623 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_from_array_harness.i [2021-12-14 17:01:10,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41349235a/2d0f4e0654f34db7ac5b61bafdc00848/FLAGb7a9eec45 [2021-12-14 17:01:11,315 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 17:01:11,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-12-14 17:01:11,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41349235a/2d0f4e0654f34db7ac5b61bafdc00848/FLAGb7a9eec45 [2021-12-14 17:01:11,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41349235a/2d0f4e0654f34db7ac5b61bafdc00848 [2021-12-14 17:01:11,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 17:01:11,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 17:01:11,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 17:01:11,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 17:01:11,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 17:01:11,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:01:11" (1/1) ... [2021-12-14 17:01:11,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c09f1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:11, skipping insertion in model container [2021-12-14 17:01:11,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:01:11" (1/1) ... [2021-12-14 17:01:11,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 17:01:11,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 17:01:12,024 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_from_array_harness.i[4497,4510] [2021-12-14 17:01:12,029 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_from_array_harness.i[4557,4570] [2021-12-14 17:01:12,614 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,615 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,615 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,615 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,616 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,625 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,625 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,626 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:12,627 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,012 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:01:13,013 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:01:13,014 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:01:13,015 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:01:13,017 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:01:13,019 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:01:13,020 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:01:13,020 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:01:13,022 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:01:13,023 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:01:13,149 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:01:13,225 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,226 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:01:13,377 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 17:01:13,400 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_from_array_harness.i[4497,4510] [2021-12-14 17:01:13,403 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_from_array_harness.i[4557,4570] [2021-12-14 17:01:13,428 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,429 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,439 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,440 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,440 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,444 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,444 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,445 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,445 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,467 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:01:13,467 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:01:13,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:01:13,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:01:13,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:01:13,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:01:13,470 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:01:13,470 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:01:13,470 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:01:13,471 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:01:13,527 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:01:13,588 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,588 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:01:13,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:01:13,781 INFO L208 MainTranslator]: Completed translation [2021-12-14 17:01:13,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13 WrapperNode [2021-12-14 17:01:13,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 17:01:13,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 17:01:13,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 17:01:13,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 17:01:13,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:13,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,014 INFO L137 Inliner]: procedures = 690, calls = 2615, calls flagged for inlining = 57, calls inlined = 4, statements flattened = 766 [2021-12-14 17:01:14,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 17:01:14,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 17:01:14,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 17:01:14,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 17:01:14,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 17:01:14,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 17:01:14,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 17:01:14,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 17:01:14,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (1/1) ... [2021-12-14 17:01:14,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:01:14,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:14,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 17:01:14,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 17:01:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-14 17:01:14,166 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-14 17:01:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 17:01:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 17:01:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 17:01:14,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 17:01:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 17:01:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 17:01:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 17:01:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 17:01:14,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 17:01:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-14 17:01:14,169 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-14 17:01:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-14 17:01:14,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-14 17:01:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 17:01:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 17:01:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 17:01:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-14 17:01:14,171 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-14 17:01:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 17:01:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 17:01:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2021-12-14 17:01:14,171 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2021-12-14 17:01:14,409 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 17:01:14,410 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 17:01:15,127 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 17:01:15,134 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 17:01:15,135 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 17:01:15,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:01:15 BoogieIcfgContainer [2021-12-14 17:01:15,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 17:01:15,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 17:01:15,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 17:01:15,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 17:01:15,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:01:11" (1/3) ... [2021-12-14 17:01:15,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7add1395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:01:15, skipping insertion in model container [2021-12-14 17:01:15,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:01:13" (2/3) ... [2021-12-14 17:01:15,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7add1395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:01:15, skipping insertion in model container [2021-12-14 17:01:15,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:01:15" (3/3) ... [2021-12-14 17:01:15,142 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2021-12-14 17:01:15,146 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 17:01:15,146 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 17:01:15,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 17:01:15,193 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 17:01:15,193 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 17:01:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-14 17:01:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 17:01:15,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:15,217 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:15,218 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -537066619, now seen corresponding path program 1 times [2021-12-14 17:01:15,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:15,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569463609] [2021-12-14 17:01:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:15,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:15,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:15,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569463609] [2021-12-14 17:01:15,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569463609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:15,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:15,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 17:01:15,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734365230] [2021-12-14 17:01:15,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:15,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 17:01:15,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:15,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 17:01:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 17:01:15,726 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:15,852 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2021-12-14 17:01:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 17:01:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-12-14 17:01:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:15,865 INFO L225 Difference]: With dead ends: 145 [2021-12-14 17:01:15,865 INFO L226 Difference]: Without dead ends: 68 [2021-12-14 17:01:15,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 17:01:15,875 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:15,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:01:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-14 17:01:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-14 17:01:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-14 17:01:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2021-12-14 17:01:15,920 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 33 [2021-12-14 17:01:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:15,920 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2021-12-14 17:01:15,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2021-12-14 17:01:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 17:01:15,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:15,923 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:15,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 17:01:15,923 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 365093061, now seen corresponding path program 1 times [2021-12-14 17:01:15,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895385985] [2021-12-14 17:01:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:15,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:16,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:16,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895385985] [2021-12-14 17:01:16,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895385985] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:16,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:16,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:01:16,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355478879] [2021-12-14 17:01:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:16,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:01:16,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:01:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:01:16,128 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:16,288 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2021-12-14 17:01:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:01:16,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-12-14 17:01:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:16,290 INFO L225 Difference]: With dead ends: 123 [2021-12-14 17:01:16,290 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 17:01:16,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 17:01:16,292 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:16,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 173 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:01:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 17:01:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-14 17:01:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2021-12-14 17:01:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2021-12-14 17:01:16,299 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 33 [2021-12-14 17:01:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:16,300 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2021-12-14 17:01:16,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2021-12-14 17:01:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 17:01:16,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:16,301 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:16,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 17:01:16,301 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1309209872, now seen corresponding path program 1 times [2021-12-14 17:01:16,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:16,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042047178] [2021-12-14 17:01:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:16,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:16,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:16,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042047178] [2021-12-14 17:01:16,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042047178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:16,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:16,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 17:01:16,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834895005] [2021-12-14 17:01:16,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:16,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 17:01:16,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:16,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 17:01:16,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:01:16,542 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:16,850 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2021-12-14 17:01:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:01:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2021-12-14 17:01:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:16,853 INFO L225 Difference]: With dead ends: 83 [2021-12-14 17:01:16,854 INFO L226 Difference]: Without dead ends: 81 [2021-12-14 17:01:16,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:01:16,856 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:16,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 376 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-14 17:01:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-12-14 17:01:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2021-12-14 17:01:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2021-12-14 17:01:16,868 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 39 [2021-12-14 17:01:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:16,869 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2021-12-14 17:01:16,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2021-12-14 17:01:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 17:01:16,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:16,874 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:16,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 17:01:16,874 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -853000232, now seen corresponding path program 1 times [2021-12-14 17:01:16,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:16,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104188403] [2021-12-14 17:01:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:16,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:17,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:17,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104188403] [2021-12-14 17:01:17,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104188403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:17,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:17,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:01:17,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285340472] [2021-12-14 17:01:17,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:17,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:01:17,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:17,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:01:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:01:17,148 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:17,387 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2021-12-14 17:01:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 17:01:17,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-14 17:01:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:17,388 INFO L225 Difference]: With dead ends: 164 [2021-12-14 17:01:17,388 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 17:01:17,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-12-14 17:01:17,389 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:17,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 217 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 17:01:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2021-12-14 17:01:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2021-12-14 17:01:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2021-12-14 17:01:17,397 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 43 [2021-12-14 17:01:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:17,397 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2021-12-14 17:01:17,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2021-12-14 17:01:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 17:01:17,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:17,399 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:17,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 17:01:17,399 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -594834794, now seen corresponding path program 1 times [2021-12-14 17:01:17,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:17,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579615832] [2021-12-14 17:01:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:17,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:17,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:17,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579615832] [2021-12-14 17:01:17,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579615832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:17,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:17,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 17:01:17,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057191259] [2021-12-14 17:01:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:17,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 17:01:17,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:17,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 17:01:17,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-14 17:01:17,725 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:18,239 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2021-12-14 17:01:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:01:18,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-14 17:01:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:18,240 INFO L225 Difference]: With dead ends: 180 [2021-12-14 17:01:18,240 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 17:01:18,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:01:18,241 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 127 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:18,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 278 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:01:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 17:01:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2021-12-14 17:01:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-14 17:01:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2021-12-14 17:01:18,257 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 43 [2021-12-14 17:01:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:18,258 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2021-12-14 17:01:18,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2021-12-14 17:01:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 17:01:18,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:18,262 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:18,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 17:01:18,263 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:18,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:18,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1874698472, now seen corresponding path program 1 times [2021-12-14 17:01:18,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:18,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539662361] [2021-12-14 17:01:18,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:18,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 17:01:18,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:18,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539662361] [2021-12-14 17:01:18,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539662361] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:18,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782505844] [2021-12-14 17:01:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:18,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:18,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:18,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:18,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 17:01:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:19,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 17:01:19,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:19,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:19,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:19,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:19,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-14 17:01:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:19,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:19,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782505844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:19,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:19,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2021-12-14 17:01:19,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753519272] [2021-12-14 17:01:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:19,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 17:01:19,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 17:01:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-12-14 17:01:19,993 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:20,070 INFO L93 Difference]: Finished difference Result 233 states and 286 transitions. [2021-12-14 17:01:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:01:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-14 17:01:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:20,072 INFO L225 Difference]: With dead ends: 233 [2021-12-14 17:01:20,072 INFO L226 Difference]: Without dead ends: 119 [2021-12-14 17:01:20,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2021-12-14 17:01:20,073 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:20,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 327 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2021-12-14 17:01:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-14 17:01:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2021-12-14 17:01:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 92 states have internal predecessors, (104), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-14 17:01:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2021-12-14 17:01:20,097 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 43 [2021-12-14 17:01:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:20,097 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2021-12-14 17:01:20,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2021-12-14 17:01:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 17:01:20,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:20,099 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:20,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:20,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 17:01:20,307 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:20,308 INFO L85 PathProgramCache]: Analyzing trace with hash 573755484, now seen corresponding path program 1 times [2021-12-14 17:01:20,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:20,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374051505] [2021-12-14 17:01:20,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:20,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:20,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:20,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:20,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374051505] [2021-12-14 17:01:20,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374051505] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:20,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:20,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 17:01:20,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733326598] [2021-12-14 17:01:20,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:20,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 17:01:20,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:20,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 17:01:20,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:01:20,663 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:20,965 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2021-12-14 17:01:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 17:01:20,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-14 17:01:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:20,967 INFO L225 Difference]: With dead ends: 223 [2021-12-14 17:01:20,967 INFO L226 Difference]: Without dead ends: 140 [2021-12-14 17:01:20,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:01:20,968 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:20,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 271 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-14 17:01:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-12-14 17:01:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 98 states have internal predecessors, (112), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-14 17:01:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2021-12-14 17:01:20,982 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 43 [2021-12-14 17:01:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:20,984 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2021-12-14 17:01:20,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2021-12-14 17:01:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 17:01:20,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:20,985 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:20,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 17:01:20,986 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:20,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 831920922, now seen corresponding path program 1 times [2021-12-14 17:01:20,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:20,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930046067] [2021-12-14 17:01:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:20,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:21,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:21,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930046067] [2021-12-14 17:01:21,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930046067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:21,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:21,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:01:21,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073189225] [2021-12-14 17:01:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:21,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:01:21,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:21,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:01:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:01:21,159 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:21,436 INFO L93 Difference]: Finished difference Result 236 states and 300 transitions. [2021-12-14 17:01:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:01:21,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-14 17:01:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:21,437 INFO L225 Difference]: With dead ends: 236 [2021-12-14 17:01:21,437 INFO L226 Difference]: Without dead ends: 147 [2021-12-14 17:01:21,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:01:21,438 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 55 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:21,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 226 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-14 17:01:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2021-12-14 17:01:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 98 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-14 17:01:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2021-12-14 17:01:21,452 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 43 [2021-12-14 17:01:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:21,452 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2021-12-14 17:01:21,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2021-12-14 17:01:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 17:01:21,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:21,453 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:21,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 17:01:21,454 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash -375980076, now seen corresponding path program 1 times [2021-12-14 17:01:21,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:21,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454626643] [2021-12-14 17:01:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:21,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:21,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:21,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454626643] [2021-12-14 17:01:21,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454626643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:21,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:21,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 17:01:21,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476802737] [2021-12-14 17:01:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:21,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 17:01:21,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 17:01:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-14 17:01:21,927 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:22,507 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2021-12-14 17:01:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 17:01:22,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-14 17:01:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:22,508 INFO L225 Difference]: With dead ends: 221 [2021-12-14 17:01:22,509 INFO L226 Difference]: Without dead ends: 132 [2021-12-14 17:01:22,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:01:22,509 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 104 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:22,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 358 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:01:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-14 17:01:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2021-12-14 17:01:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 91 states have internal predecessors, (103), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-14 17:01:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2021-12-14 17:01:22,516 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 43 [2021-12-14 17:01:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:22,516 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2021-12-14 17:01:22,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2021-12-14 17:01:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 17:01:22,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:22,517 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:22,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 17:01:22,518 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1655843754, now seen corresponding path program 1 times [2021-12-14 17:01:22,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:22,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147404262] [2021-12-14 17:01:22,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:22,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:22,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:22,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147404262] [2021-12-14 17:01:22,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147404262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:22,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:22,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 17:01:22,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118591505] [2021-12-14 17:01:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:22,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 17:01:22,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:22,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 17:01:22,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-14 17:01:22,732 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:23,136 INFO L93 Difference]: Finished difference Result 227 states and 280 transitions. [2021-12-14 17:01:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:01:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-14 17:01:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:23,138 INFO L225 Difference]: With dead ends: 227 [2021-12-14 17:01:23,138 INFO L226 Difference]: Without dead ends: 140 [2021-12-14 17:01:23,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:01:23,139 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 113 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:23,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 302 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:01:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-14 17:01:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-12-14 17:01:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 98 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2021-12-14 17:01:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2021-12-14 17:01:23,152 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 43 [2021-12-14 17:01:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:23,153 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2021-12-14 17:01:23,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2021-12-14 17:01:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 17:01:23,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:23,154 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:23,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 17:01:23,154 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1365554723, now seen corresponding path program 1 times [2021-12-14 17:01:23,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:23,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685977885] [2021-12-14 17:01:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:23,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:23,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:23,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685977885] [2021-12-14 17:01:23,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685977885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:23,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:23,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 17:01:23,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402442440] [2021-12-14 17:01:23,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:23,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 17:01:23,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:23,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 17:01:23,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 17:01:23,302 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:23,427 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-12-14 17:01:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:01:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-12-14 17:01:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:23,428 INFO L225 Difference]: With dead ends: 217 [2021-12-14 17:01:23,428 INFO L226 Difference]: Without dead ends: 121 [2021-12-14 17:01:23,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 17:01:23,429 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:23,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 193 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:01:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-14 17:01:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2021-12-14 17:01:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-14 17:01:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2021-12-14 17:01:23,436 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 45 [2021-12-14 17:01:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:23,437 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2021-12-14 17:01:23,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2021-12-14 17:01:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 17:01:23,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:23,438 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:23,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 17:01:23,438 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2043381215, now seen corresponding path program 1 times [2021-12-14 17:01:23,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:23,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832059881] [2021-12-14 17:01:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:23,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:23,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:23,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832059881] [2021-12-14 17:01:23,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832059881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:23,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:23,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 17:01:23,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380070117] [2021-12-14 17:01:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:23,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 17:01:23,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 17:01:23,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:01:23,626 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:23,980 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2021-12-14 17:01:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 17:01:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-12-14 17:01:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:23,982 INFO L225 Difference]: With dead ends: 129 [2021-12-14 17:01:23,982 INFO L226 Difference]: Without dead ends: 127 [2021-12-14 17:01:23,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:01:23,983 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 64 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:23,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 471 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:01:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-14 17:01:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2021-12-14 17:01:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-14 17:01:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-12-14 17:01:23,992 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 45 [2021-12-14 17:01:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:23,993 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-12-14 17:01:23,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 17:01:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-12-14 17:01:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 17:01:23,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:23,993 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:23,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 17:01:23,994 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1342316637, now seen corresponding path program 1 times [2021-12-14 17:01:23,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:23,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126552128] [2021-12-14 17:01:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:23,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:24,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:24,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126552128] [2021-12-14 17:01:24,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126552128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:24,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:24,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-14 17:01:24,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154834131] [2021-12-14 17:01:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:24,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 17:01:24,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 17:01:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2021-12-14 17:01:24,637 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 17:01:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:25,379 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2021-12-14 17:01:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 17:01:25,380 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2021-12-14 17:01:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:25,381 INFO L225 Difference]: With dead ends: 131 [2021-12-14 17:01:25,381 INFO L226 Difference]: Without dead ends: 129 [2021-12-14 17:01:25,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 17:01:25,381 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 92 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:25,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 623 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:01:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-14 17:01:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-12-14 17:01:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2021-12-14 17:01:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-12-14 17:01:25,387 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 45 [2021-12-14 17:01:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:25,387 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-12-14 17:01:25,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 17:01:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-12-14 17:01:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 17:01:25,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:25,388 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:25,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 17:01:25,388 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1476330143, now seen corresponding path program 1 times [2021-12-14 17:01:25,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:25,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447670076] [2021-12-14 17:01:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:25,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:01:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:01:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:25,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447670076] [2021-12-14 17:01:25,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447670076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:25,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:25,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 17:01:25,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695121872] [2021-12-14 17:01:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:25,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 17:01:25,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 17:01:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 17:01:25,627 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:25,914 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2021-12-14 17:01:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 17:01:25,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2021-12-14 17:01:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:25,915 INFO L225 Difference]: With dead ends: 206 [2021-12-14 17:01:25,915 INFO L226 Difference]: Without dead ends: 123 [2021-12-14 17:01:25,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-14 17:01:25,916 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:25,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 250 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-14 17:01:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2021-12-14 17:01:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 85 states have internal predecessors, (95), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-14 17:01:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2021-12-14 17:01:25,921 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 45 [2021-12-14 17:01:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:25,921 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2021-12-14 17:01:25,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 17:01:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2021-12-14 17:01:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 17:01:25,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:25,922 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-14 17:01:25,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 17:01:25,922 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash 316076503, now seen corresponding path program 1 times [2021-12-14 17:01:25,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:25,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344761892] [2021-12-14 17:01:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:25,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 17:01:26,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344761892] [2021-12-14 17:01:26,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344761892] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837619429] [2021-12-14 17:01:26,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:26,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:26,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:26,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:26,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 17:01:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 17:01:26,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 17:01:26,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:26,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837619429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:26,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:26,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-14 17:01:26,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670184165] [2021-12-14 17:01:26,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:26,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 17:01:26,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 17:01:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:01:26,532 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 17:01:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:26,550 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2021-12-14 17:01:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 17:01:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2021-12-14 17:01:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:26,551 INFO L225 Difference]: With dead ends: 201 [2021-12-14 17:01:26,551 INFO L226 Difference]: Without dead ends: 114 [2021-12-14 17:01:26,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 17:01:26,552 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 244 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 [2021-12-14 17:01:26,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 244 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 17:01:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-14 17:01:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2021-12-14 17:01:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 85 states have internal predecessors, (93), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-14 17:01:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2021-12-14 17:01:26,556 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 54 [2021-12-14 17:01:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:26,556 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2021-12-14 17:01:26,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 17:01:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2021-12-14 17:01:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 17:01:26,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:26,557 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-14 17:01:26,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:26,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 17:01:26,766 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash 691123421, now seen corresponding path program 1 times [2021-12-14 17:01:26,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:26,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993284216] [2021-12-14 17:01:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:26,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 17:01:26,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:26,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993284216] [2021-12-14 17:01:26,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993284216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:26,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:26,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 17:01:26,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327011901] [2021-12-14 17:01:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:26,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 17:01:26,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 17:01:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 17:01:26,974 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 17:01:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:27,136 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2021-12-14 17:01:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:01:27,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2021-12-14 17:01:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:27,137 INFO L225 Difference]: With dead ends: 140 [2021-12-14 17:01:27,137 INFO L226 Difference]: Without dead ends: 108 [2021-12-14 17:01:27,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:01:27,138 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:27,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 187 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:01:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-14 17:01:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-14 17:01:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 85 states have internal predecessors, (92), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-14 17:01:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2021-12-14 17:01:27,142 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 54 [2021-12-14 17:01:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:27,142 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2021-12-14 17:01:27,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 17:01:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2021-12-14 17:01:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-14 17:01:27,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:27,143 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:27,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 17:01:27,143 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash -324954328, now seen corresponding path program 1 times [2021-12-14 17:01:27,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:27,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126960482] [2021-12-14 17:01:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:27,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 17:01:27,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:27,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126960482] [2021-12-14 17:01:27,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126960482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:27,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:27,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 17:01:27,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249738780] [2021-12-14 17:01:27,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:27,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 17:01:27,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:27,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 17:01:27,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 17:01:27,327 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 17:01:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:27,576 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2021-12-14 17:01:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:01:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2021-12-14 17:01:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:27,577 INFO L225 Difference]: With dead ends: 116 [2021-12-14 17:01:27,577 INFO L226 Difference]: Without dead ends: 114 [2021-12-14 17:01:27,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:01:27,578 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 92 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:27,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 355 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-14 17:01:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2021-12-14 17:01:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.130952380952381) internal successors, (95), 88 states have internal predecessors, (95), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2021-12-14 17:01:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2021-12-14 17:01:27,582 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 60 [2021-12-14 17:01:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:27,582 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2021-12-14 17:01:27,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 17:01:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2021-12-14 17:01:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 17:01:27,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:27,583 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:27,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 17:01:27,583 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2057101486, now seen corresponding path program 1 times [2021-12-14 17:01:27,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:27,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517948302] [2021-12-14 17:01:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:27,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 17:01:27,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517948302] [2021-12-14 17:01:27,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517948302] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:27,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:27,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 17:01:27,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276097338] [2021-12-14 17:01:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:27,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:01:27,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:01:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:01:27,921 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 17:01:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:28,517 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2021-12-14 17:01:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:01:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-12-14 17:01:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:28,519 INFO L225 Difference]: With dead ends: 173 [2021-12-14 17:01:28,519 INFO L226 Difference]: Without dead ends: 144 [2021-12-14 17:01:28,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-12-14 17:01:28,519 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 184 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:28,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 296 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:01:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-14 17:01:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2021-12-14 17:01:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 9 states have call predecessors, (19), 13 states have return successors, (28), 18 states have call predecessors, (28), 18 states have call successors, (28) [2021-12-14 17:01:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2021-12-14 17:01:28,526 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 64 [2021-12-14 17:01:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:28,526 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2021-12-14 17:01:28,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 17:01:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2021-12-14 17:01:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 17:01:28,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:28,527 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:28,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 17:01:28,529 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:28,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 777237808, now seen corresponding path program 1 times [2021-12-14 17:01:28,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:28,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702732756] [2021-12-14 17:01:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:28,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 17:01:28,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:28,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702732756] [2021-12-14 17:01:28,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702732756] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:28,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654826251] [2021-12-14 17:01:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:28,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:28,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:28,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:28,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 17:01:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:29,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 2508 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-14 17:01:29,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:29,432 INFO L354 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-14 17:01:29,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 17:01:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:30,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:30,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654826251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:30,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:30,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 29 [2021-12-14 17:01:30,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110174240] [2021-12-14 17:01:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:30,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 17:01:30,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 17:01:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2021-12-14 17:01:30,320 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:30,477 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2021-12-14 17:01:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 17:01:30,478 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2021-12-14 17:01:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:30,479 INFO L225 Difference]: With dead ends: 204 [2021-12-14 17:01:30,479 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 17:01:30,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2021-12-14 17:01:30,480 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 30 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:30,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 716 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 114 Unchecked, 0.1s Time] [2021-12-14 17:01:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 17:01:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2021-12-14 17:01:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 114 states have (on average 1.131578947368421) internal successors, (129), 119 states have internal predecessors, (129), 21 states have call successors, (21), 11 states have call predecessors, (21), 16 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2021-12-14 17:01:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2021-12-14 17:01:30,487 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 64 [2021-12-14 17:01:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:30,488 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2021-12-14 17:01:30,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2021-12-14 17:01:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 17:01:30,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:30,489 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:30,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:30,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:30,709 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1069275532, now seen corresponding path program 1 times [2021-12-14 17:01:30,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:30,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501852195] [2021-12-14 17:01:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:30,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:30,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:30,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 17:01:31,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:31,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501852195] [2021-12-14 17:01:31,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501852195] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:31,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323201607] [2021-12-14 17:01:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:31,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:31,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:31,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:31,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 17:01:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:31,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-14 17:01:31,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:31,691 INFO L354 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-14 17:01:31,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 17:01:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:32,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:32,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323201607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:32,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:32,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2021-12-14 17:01:32,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351784570] [2021-12-14 17:01:32,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:32,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 17:01:32,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 17:01:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2021-12-14 17:01:32,666 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:32,767 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-12-14 17:01:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 17:01:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2021-12-14 17:01:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:32,769 INFO L225 Difference]: With dead ends: 212 [2021-12-14 17:01:32,769 INFO L226 Difference]: Without dead ends: 170 [2021-12-14 17:01:32,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2021-12-14 17:01:32,770 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 33 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:32,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 1040 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 201 Unchecked, 0.0s Time] [2021-12-14 17:01:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-14 17:01:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2021-12-14 17:01:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 134 states have internal predecessors, (146), 21 states have call successors, (21), 12 states have call predecessors, (21), 17 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2021-12-14 17:01:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2021-12-14 17:01:32,781 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 64 [2021-12-14 17:01:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:32,782 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2021-12-14 17:01:32,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2021-12-14 17:01:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 17:01:32,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:32,783 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-14 17:01:32,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:33,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:33,004 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:33,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash -418268106, now seen corresponding path program 1 times [2021-12-14 17:01:33,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:33,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182164526] [2021-12-14 17:01:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:33,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 17:01:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 17:01:33,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:33,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182164526] [2021-12-14 17:01:33,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182164526] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:33,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:33,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:01:33,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953778438] [2021-12-14 17:01:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:33,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:01:33,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:01:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:01:33,315 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-14 17:01:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:34,010 INFO L93 Difference]: Finished difference Result 191 states and 231 transitions. [2021-12-14 17:01:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:01:34,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2021-12-14 17:01:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:34,012 INFO L225 Difference]: With dead ends: 191 [2021-12-14 17:01:34,012 INFO L226 Difference]: Without dead ends: 189 [2021-12-14 17:01:34,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:01:34,012 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 87 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:34,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 310 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 17:01:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-14 17:01:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2021-12-14 17:01:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 138 states have internal predecessors, (150), 24 states have call successors, (24), 13 states have call predecessors, (24), 18 states have return successors, (37), 24 states have call predecessors, (37), 23 states have call successors, (37) [2021-12-14 17:01:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2021-12-14 17:01:34,019 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 66 [2021-12-14 17:01:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:34,019 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2021-12-14 17:01:34,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-14 17:01:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2021-12-14 17:01:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 17:01:34,020 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:34,020 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:34,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 17:01:34,021 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash 820275769, now seen corresponding path program 1 times [2021-12-14 17:01:34,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:34,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184172395] [2021-12-14 17:01:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:34,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 17:01:34,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:34,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184172395] [2021-12-14 17:01:34,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184172395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:34,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:34,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 17:01:34,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257228543] [2021-12-14 17:01:34,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:34,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 17:01:34,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 17:01:34,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-14 17:01:34,220 INFO L87 Difference]: Start difference. First operand 176 states and 211 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 17:01:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:34,545 INFO L93 Difference]: Finished difference Result 192 states and 228 transitions. [2021-12-14 17:01:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 17:01:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2021-12-14 17:01:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:34,546 INFO L225 Difference]: With dead ends: 192 [2021-12-14 17:01:34,546 INFO L226 Difference]: Without dead ends: 190 [2021-12-14 17:01:34,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-12-14 17:01:34,547 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 61 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:34,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 454 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-14 17:01:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2021-12-14 17:01:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 144 states have internal predecessors, (155), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (38), 24 states have call predecessors, (38), 23 states have call successors, (38) [2021-12-14 17:01:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 217 transitions. [2021-12-14 17:01:34,553 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 217 transitions. Word has length 66 [2021-12-14 17:01:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:34,553 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 217 transitions. [2021-12-14 17:01:34,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 17:01:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 217 transitions. [2021-12-14 17:01:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 17:01:34,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:34,554 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:34,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 17:01:34,555 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1521340347, now seen corresponding path program 1 times [2021-12-14 17:01:34,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:34,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537147235] [2021-12-14 17:01:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:34,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 17:01:34,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:34,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537147235] [2021-12-14 17:01:34,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537147235] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:34,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046843510] [2021-12-14 17:01:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:34,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:34,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:34,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 17:01:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:35,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-14 17:01:35,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:35,468 INFO L354 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-14 17:01:35,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 17:01:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:36,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:36,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046843510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:36,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:36,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2021-12-14 17:01:36,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398740950] [2021-12-14 17:01:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:36,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:01:36,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:36,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:01:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-12-14 17:01:36,158 INFO L87 Difference]: Start difference. First operand 182 states and 217 transitions. Second operand has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:36,258 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2021-12-14 17:01:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 17:01:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 66 [2021-12-14 17:01:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:36,259 INFO L225 Difference]: With dead ends: 224 [2021-12-14 17:01:36,259 INFO L226 Difference]: Without dead ends: 185 [2021-12-14 17:01:36,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2021-12-14 17:01:36,260 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:36,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 800 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2021-12-14 17:01:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-14 17:01:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2021-12-14 17:01:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 145 states have internal predecessors, (156), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (37), 24 states have call predecessors, (37), 23 states have call successors, (37) [2021-12-14 17:01:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2021-12-14 17:01:36,267 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 66 [2021-12-14 17:01:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:36,267 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2021-12-14 17:01:36,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2021-12-14 17:01:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:01:36,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:36,268 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:36,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:36,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-14 17:01:36,483 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1978442555, now seen corresponding path program 1 times [2021-12-14 17:01:36,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:36,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46156544] [2021-12-14 17:01:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:36,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 17:01:37,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:37,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46156544] [2021-12-14 17:01:37,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46156544] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:37,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175173515] [2021-12-14 17:01:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:37,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:37,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:37,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:37,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 17:01:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:37,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 17:01:37,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:37,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:37,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:37,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:37,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 17:01:37,988 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 17:01:37,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-12-14 17:01:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 17:01:38,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:38,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175173515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:38,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:38,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [22] total 30 [2021-12-14 17:01:38,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615309527] [2021-12-14 17:01:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:38,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 17:01:38,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:38,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 17:01:38,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2021-12-14 17:01:38,030 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 17:01:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:38,141 INFO L93 Difference]: Finished difference Result 308 states and 356 transitions. [2021-12-14 17:01:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 17:01:38,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2021-12-14 17:01:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:38,142 INFO L225 Difference]: With dead ends: 308 [2021-12-14 17:01:38,142 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 17:01:38,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2021-12-14 17:01:38,143 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 28 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:38,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 480 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2021-12-14 17:01:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 17:01:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-12-14 17:01:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 147 states have (on average 1.1224489795918366) internal successors, (165), 153 states have internal predecessors, (165), 24 states have call successors, (24), 13 states have call predecessors, (24), 19 states have return successors, (36), 24 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-14 17:01:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2021-12-14 17:01:38,150 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 70 [2021-12-14 17:01:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:38,150 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2021-12-14 17:01:38,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 17:01:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2021-12-14 17:01:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:01:38,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:38,151 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:38,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:38,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:38,372 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1584075769, now seen corresponding path program 1 times [2021-12-14 17:01:38,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:38,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075088376] [2021-12-14 17:01:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:38,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:38,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075088376] [2021-12-14 17:01:38,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075088376] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533856490] [2021-12-14 17:01:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:38,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:38,952 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:38,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 17:01:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:39,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-14 17:01:39,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:39,524 INFO L354 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-14 17:01:39,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 17:01:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 17:01:40,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:40,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533856490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:40,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:40,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [25] total 37 [2021-12-14 17:01:40,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414634591] [2021-12-14 17:01:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:40,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 17:01:40,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:40,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 17:01:40,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 17:01:40,445 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:40,495 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2021-12-14 17:01:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 17:01:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 70 [2021-12-14 17:01:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:40,497 INFO L225 Difference]: With dead ends: 278 [2021-12-14 17:01:40,497 INFO L226 Difference]: Without dead ends: 227 [2021-12-14 17:01:40,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2021-12-14 17:01:40,498 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 19 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:40,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 833 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 133 Unchecked, 0.0s Time] [2021-12-14 17:01:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-14 17:01:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2021-12-14 17:01:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.1204819277108433) internal successors, (186), 171 states have internal predecessors, (186), 24 states have call successors, (24), 15 states have call predecessors, (24), 20 states have return successors, (33), 24 states have call predecessors, (33), 23 states have call successors, (33) [2021-12-14 17:01:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 243 transitions. [2021-12-14 17:01:40,505 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 243 transitions. Word has length 70 [2021-12-14 17:01:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:40,506 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 243 transitions. [2021-12-14 17:01:40,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 243 transitions. [2021-12-14 17:01:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:01:40,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:40,507 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:40,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:40,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:40,741 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:40,741 INFO L85 PathProgramCache]: Analyzing trace with hash 304212091, now seen corresponding path program 1 times [2021-12-14 17:01:40,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:40,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586363322] [2021-12-14 17:01:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:40,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:41,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:41,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:41,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 17:01:41,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:41,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586363322] [2021-12-14 17:01:41,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586363322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:41,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:41,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 17:01:41,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422964338] [2021-12-14 17:01:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:41,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:01:41,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:41,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:01:41,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:01:41,261 INFO L87 Difference]: Start difference. First operand 211 states and 243 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 17:01:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:41,895 INFO L93 Difference]: Finished difference Result 271 states and 312 transitions. [2021-12-14 17:01:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 17:01:41,895 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2021-12-14 17:01:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:41,896 INFO L225 Difference]: With dead ends: 271 [2021-12-14 17:01:41,897 INFO L226 Difference]: Without dead ends: 230 [2021-12-14 17:01:41,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:01:41,897 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 122 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:41,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 399 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:01:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-14 17:01:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2021-12-14 17:01:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.1151515151515152) internal successors, (184), 172 states have internal predecessors, (184), 24 states have call successors, (24), 15 states have call predecessors, (24), 22 states have return successors, (35), 24 states have call predecessors, (35), 23 states have call successors, (35) [2021-12-14 17:01:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 243 transitions. [2021-12-14 17:01:41,936 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 243 transitions. Word has length 70 [2021-12-14 17:01:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:41,937 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 243 transitions. [2021-12-14 17:01:41,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 17:01:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 243 transitions. [2021-12-14 17:01:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:01:41,938 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:41,938 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:41,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 17:01:41,938 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:41,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash -262437571, now seen corresponding path program 1 times [2021-12-14 17:01:41,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:41,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069632183] [2021-12-14 17:01:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:41,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 17:01:42,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:42,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069632183] [2021-12-14 17:01:42,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069632183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:42,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:42,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:01:42,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389462672] [2021-12-14 17:01:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:42,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:01:42,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:42,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:01:42,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:01:42,162 INFO L87 Difference]: Start difference. First operand 212 states and 243 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 17:01:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:42,268 INFO L93 Difference]: Finished difference Result 302 states and 341 transitions. [2021-12-14 17:01:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:01:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2021-12-14 17:01:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:42,269 INFO L225 Difference]: With dead ends: 302 [2021-12-14 17:01:42,269 INFO L226 Difference]: Without dead ends: 192 [2021-12-14 17:01:42,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:01:42,270 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 114 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:42,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 180 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:01:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-14 17:01:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2021-12-14 17:01:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 143 states have (on average 1.06993006993007) internal successors, (153), 147 states have internal predecessors, (153), 24 states have call successors, (24), 15 states have call predecessors, (24), 19 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2021-12-14 17:01:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2021-12-14 17:01:42,276 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 70 [2021-12-14 17:01:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:42,276 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2021-12-14 17:01:42,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 17:01:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2021-12-14 17:01:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:01:42,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:42,277 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:42,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 17:01:42,277 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1542301249, now seen corresponding path program 1 times [2021-12-14 17:01:42,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:42,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710506400] [2021-12-14 17:01:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:42,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 17:01:43,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710506400] [2021-12-14 17:01:43,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710506400] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:01:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959623961] [2021-12-14 17:01:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:43,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:01:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:01:43,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:01:43,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 17:01:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:43,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-14 17:01:43,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:01:43,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:43,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:43,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 17:01:43,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 17:01:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 17:01:44,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:01:44,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959623961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:44,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:01:44,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [22] total 33 [2021-12-14 17:01:44,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325726198] [2021-12-14 17:01:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:44,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:01:44,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:01:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 17:01:44,461 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:44,519 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2021-12-14 17:01:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 17:01:44,519 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 70 [2021-12-14 17:01:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:44,520 INFO L225 Difference]: With dead ends: 255 [2021-12-14 17:01:44,520 INFO L226 Difference]: Without dead ends: 209 [2021-12-14 17:01:44,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 17:01:44,521 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 18 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:44,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 532 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 127 Unchecked, 0.0s Time] [2021-12-14 17:01:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-14 17:01:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 188. [2021-12-14 17:01:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 144 states have (on average 1.0555555555555556) internal successors, (152), 148 states have internal predecessors, (152), 24 states have call successors, (24), 15 states have call predecessors, (24), 19 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2021-12-14 17:01:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 206 transitions. [2021-12-14 17:01:44,529 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 206 transitions. Word has length 70 [2021-12-14 17:01:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:44,529 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 206 transitions. [2021-12-14 17:01:44,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2021-12-14 17:01:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 17:01:44,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:44,530 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2021-12-14 17:01:44,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 17:01:44,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-14 17:01:44,748 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2083530690, now seen corresponding path program 1 times [2021-12-14 17:01:44,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:44,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381958150] [2021-12-14 17:01:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:44,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 17:01:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 17:01:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 17:01:45,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:45,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381958150] [2021-12-14 17:01:45,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381958150] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:45,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:45,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:01:45,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602125423] [2021-12-14 17:01:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:45,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:01:45,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:01:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:01:45,150 INFO L87 Difference]: Start difference. First operand 188 states and 206 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 17:01:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:45,749 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2021-12-14 17:01:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:01:45,750 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 72 [2021-12-14 17:01:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:45,751 INFO L225 Difference]: With dead ends: 207 [2021-12-14 17:01:45,751 INFO L226 Difference]: Without dead ends: 205 [2021-12-14 17:01:45,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:01:45,752 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 86 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:45,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 310 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:01:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-14 17:01:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2021-12-14 17:01:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 148 states have (on average 1.054054054054054) internal successors, (156), 152 states have internal predecessors, (156), 25 states have call successors, (25), 16 states have call predecessors, (25), 20 states have return successors, (31), 25 states have call predecessors, (31), 24 states have call successors, (31) [2021-12-14 17:01:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2021-12-14 17:01:45,761 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 72 [2021-12-14 17:01:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:45,763 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2021-12-14 17:01:45,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 17:01:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2021-12-14 17:01:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:01:45,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:45,764 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:45,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 17:01:45,764 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash 683060159, now seen corresponding path program 1 times [2021-12-14 17:01:45,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:45,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231579843] [2021-12-14 17:01:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:45,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 17:01:46,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:46,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231579843] [2021-12-14 17:01:46,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231579843] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:46,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:46,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 17:01:46,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799108116] [2021-12-14 17:01:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:46,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:01:46,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:01:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:01:46,064 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 17:01:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:46,658 INFO L93 Difference]: Finished difference Result 247 states and 271 transitions. [2021-12-14 17:01:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 17:01:46,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2021-12-14 17:01:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:46,659 INFO L225 Difference]: With dead ends: 247 [2021-12-14 17:01:46,659 INFO L226 Difference]: Without dead ends: 200 [2021-12-14 17:01:46,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-12-14 17:01:46,660 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 89 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:46,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 268 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:01:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-14 17:01:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2021-12-14 17:01:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 143 states have (on average 1.048951048951049) internal successors, (150), 147 states have internal predecessors, (150), 25 states have call successors, (25), 16 states have call predecessors, (25), 20 states have return successors, (31), 25 states have call predecessors, (31), 24 states have call successors, (31) [2021-12-14 17:01:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2021-12-14 17:01:46,667 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 70 [2021-12-14 17:01:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:46,669 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2021-12-14 17:01:46,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 17:01:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2021-12-14 17:01:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 17:01:46,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:46,670 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:46,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 17:01:46,671 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807610, now seen corresponding path program 1 times [2021-12-14 17:01:46,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:46,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333929501] [2021-12-14 17:01:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:46,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:46,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:47,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:47,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 17:01:47,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:47,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333929501] [2021-12-14 17:01:47,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333929501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:47,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:47,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-14 17:01:47,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238037844] [2021-12-14 17:01:47,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:47,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-14 17:01:47,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:47,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-14 17:01:47,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2021-12-14 17:01:47,198 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:48,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:48,403 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2021-12-14 17:01:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 17:01:48,404 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2021-12-14 17:01:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:48,405 INFO L225 Difference]: With dead ends: 210 [2021-12-14 17:01:48,405 INFO L226 Difference]: Without dead ends: 208 [2021-12-14 17:01:48,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2021-12-14 17:01:48,406 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 109 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:48,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 714 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 17:01:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-14 17:01:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2021-12-14 17:01:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.047945205479452) internal successors, (153), 150 states have internal predecessors, (153), 24 states have call successors, (24), 17 states have call predecessors, (24), 21 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2021-12-14 17:01:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2021-12-14 17:01:48,417 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 72 [2021-12-14 17:01:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:48,418 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2021-12-14 17:01:48,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 17:01:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2021-12-14 17:01:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 17:01:48,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:48,419 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:48,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-14 17:01:48,419 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1210932874, now seen corresponding path program 1 times [2021-12-14 17:01:48,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:48,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531437385] [2021-12-14 17:01:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:48,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 17:01:48,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:48,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531437385] [2021-12-14 17:01:48,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531437385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:48,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:48,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 17:01:48,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356898076] [2021-12-14 17:01:48,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:48,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 17:01:48,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 17:01:48,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-14 17:01:48,666 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 17:01:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:49,177 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2021-12-14 17:01:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 17:01:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2021-12-14 17:01:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:49,179 INFO L225 Difference]: With dead ends: 239 [2021-12-14 17:01:49,179 INFO L226 Difference]: Without dead ends: 196 [2021-12-14 17:01:49,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-12-14 17:01:49,179 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 97 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:49,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 253 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:01:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-14 17:01:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2021-12-14 17:01:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.0425531914893618) internal successors, (147), 144 states have internal predecessors, (147), 23 states have call successors, (23), 17 states have call predecessors, (23), 20 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-14 17:01:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2021-12-14 17:01:49,186 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 72 [2021-12-14 17:01:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:49,186 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2021-12-14 17:01:49,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 17:01:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2021-12-14 17:01:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-14 17:01:49,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:49,186 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2021-12-14 17:01:49,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-14 17:01:49,187 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:49,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1862370124, now seen corresponding path program 1 times [2021-12-14 17:01:49,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:49,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785341161] [2021-12-14 17:01:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:49,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 17:01:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 17:01:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 17:01:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-14 17:01:49,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785341161] [2021-12-14 17:01:49,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785341161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:49,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:49,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 17:01:49,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748885894] [2021-12-14 17:01:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:49,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 17:01:49,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 17:01:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:01:49,447 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 17:01:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:49,729 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2021-12-14 17:01:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 17:01:49,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2021-12-14 17:01:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:49,730 INFO L225 Difference]: With dead ends: 191 [2021-12-14 17:01:49,730 INFO L226 Difference]: Without dead ends: 189 [2021-12-14 17:01:49,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:01:49,733 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 74 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:49,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 222 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:01:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-14 17:01:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-14 17:01:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 144 states have (on average 1.0416666666666667) internal successors, (150), 147 states have internal predecessors, (150), 23 states have call successors, (23), 18 states have call predecessors, (23), 21 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-14 17:01:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2021-12-14 17:01:49,750 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 78 [2021-12-14 17:01:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:49,750 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2021-12-14 17:01:49,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 17:01:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2021-12-14 17:01:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-14 17:01:49,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:49,751 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-14 17:01:49,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-14 17:01:49,751 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1313070, now seen corresponding path program 1 times [2021-12-14 17:01:49,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:49,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961713786] [2021-12-14 17:01:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:49,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:50,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 17:01:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 17:01:50,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:50,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961713786] [2021-12-14 17:01:50,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961713786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:50,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:50,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-14 17:01:50,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141334923] [2021-12-14 17:01:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:50,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 17:01:50,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:50,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 17:01:50,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:01:50,114 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-14 17:01:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:50,696 INFO L93 Difference]: Finished difference Result 237 states and 255 transitions. [2021-12-14 17:01:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:01:50,696 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 78 [2021-12-14 17:01:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:50,697 INFO L225 Difference]: With dead ends: 237 [2021-12-14 17:01:50,697 INFO L226 Difference]: Without dead ends: 194 [2021-12-14 17:01:50,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-12-14 17:01:50,698 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 129 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:50,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 458 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:01:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-14 17:01:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2021-12-14 17:01:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.0390625) internal successors, (133), 131 states have internal predecessors, (133), 23 states have call successors, (23), 17 states have call predecessors, (23), 20 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-14 17:01:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2021-12-14 17:01:50,705 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 78 [2021-12-14 17:01:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:50,705 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2021-12-14 17:01:50,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-14 17:01:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2021-12-14 17:01:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-14 17:01:50,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:50,705 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:50,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-14 17:01:50,706 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1589660972, now seen corresponding path program 1 times [2021-12-14 17:01:50,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:50,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300226113] [2021-12-14 17:01:50,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:50,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:50,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:50,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 17:01:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 17:01:51,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:51,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300226113] [2021-12-14 17:01:51,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300226113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:51,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:51,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:01:51,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999542734] [2021-12-14 17:01:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:51,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:01:51,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:01:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:01:51,132 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-14 17:01:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:51,786 INFO L93 Difference]: Finished difference Result 189 states and 203 transitions. [2021-12-14 17:01:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:01:51,787 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2021-12-14 17:01:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:51,788 INFO L225 Difference]: With dead ends: 189 [2021-12-14 17:01:51,788 INFO L226 Difference]: Without dead ends: 187 [2021-12-14 17:01:51,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:01:51,788 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:51,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 494 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 17:01:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-14 17:01:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2021-12-14 17:01:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 134 states have internal predecessors, (136), 23 states have call successors, (23), 18 states have call predecessors, (23), 21 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-14 17:01:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2021-12-14 17:01:51,797 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 78 [2021-12-14 17:01:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:51,798 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2021-12-14 17:01:51,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-14 17:01:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2021-12-14 17:01:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-14 17:01:51,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:51,799 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2021-12-14 17:01:51,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-14 17:01:51,799 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1440681711, now seen corresponding path program 1 times [2021-12-14 17:01:51,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:51,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405235803] [2021-12-14 17:01:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:51,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:01:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:01:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 17:01:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 17:01:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 17:01:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:01:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-14 17:01:52,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:52,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405235803] [2021-12-14 17:01:52,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405235803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:52,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:52,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 17:01:52,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846808589] [2021-12-14 17:01:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:52,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 17:01:52,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 17:01:52,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 17:01:52,023 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 17:01:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:52,330 INFO L93 Difference]: Finished difference Result 200 states and 211 transitions. [2021-12-14 17:01:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:01:52,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2021-12-14 17:01:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:52,331 INFO L225 Difference]: With dead ends: 200 [2021-12-14 17:01:52,331 INFO L226 Difference]: Without dead ends: 84 [2021-12-14 17:01:52,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:01:52,332 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:52,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 271 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:01:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-14 17:01:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-14 17:01:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-14 17:01:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-12-14 17:01:52,336 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 85 [2021-12-14 17:01:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:52,336 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-12-14 17:01:52,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 17:01:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-12-14 17:01:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 17:01:52,337 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:52,337 INFO L514 BasicCegarLoop]: 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] [2021-12-14 17:01:52,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-14 17:01:52,337 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash 61222880, now seen corresponding path program 1 times [2021-12-14 17:01:52,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:52,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347020462] [2021-12-14 17:01:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:52,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 17:01:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:01:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-14 17:01:52,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:52,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347020462] [2021-12-14 17:01:52,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347020462] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:52,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:52,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:01:52,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868507365] [2021-12-14 17:01:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:52,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:01:52,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:52,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:01:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:01:52,677 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 17:01:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:53,129 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2021-12-14 17:01:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:01:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2021-12-14 17:01:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:53,130 INFO L225 Difference]: With dead ends: 90 [2021-12-14 17:01:53,130 INFO L226 Difference]: Without dead ends: 88 [2021-12-14 17:01:53,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:01:53,130 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:53,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 201 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:01:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-14 17:01:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-14 17:01:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 62 states have internal predecessors, (62), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-14 17:01:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-12-14 17:01:53,135 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 84 [2021-12-14 17:01:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:53,137 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-12-14 17:01:53,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 17:01:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-12-14 17:01:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-14 17:01:53,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:53,138 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2021-12-14 17:01:53,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-14 17:01:53,138 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:53,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2072795247, now seen corresponding path program 1 times [2021-12-14 17:01:53,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:53,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014856518] [2021-12-14 17:01:53,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:53,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 17:01:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:01:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:01:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 17:01:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 17:01:53,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:53,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014856518] [2021-12-14 17:01:53,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014856518] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:53,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:53,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-14 17:01:53,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154919477] [2021-12-14 17:01:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:53,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 17:01:53,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:53,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 17:01:53,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-12-14 17:01:53,445 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-14 17:01:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:53,937 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2021-12-14 17:01:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 17:01:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 97 [2021-12-14 17:01:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:53,938 INFO L225 Difference]: With dead ends: 94 [2021-12-14 17:01:53,938 INFO L226 Difference]: Without dead ends: 90 [2021-12-14 17:01:53,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-12-14 17:01:53,939 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 46 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:53,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 264 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:01:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-14 17:01:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-14 17:01:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.0) internal successors, (63), 63 states have internal predecessors, (63), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-14 17:01:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2021-12-14 17:01:53,943 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 97 [2021-12-14 17:01:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:53,943 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2021-12-14 17:01:53,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-14 17:01:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2021-12-14 17:01:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-14 17:01:53,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:01:53,944 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2021-12-14 17:01:53,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-14 17:01:53,944 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:01:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:01:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash 654673100, now seen corresponding path program 1 times [2021-12-14 17:01:53,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:01:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421129925] [2021-12-14 17:01:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:01:53,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:01:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:01:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 17:01:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:01:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:01:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 17:01:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:01:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 17:01:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:01:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:01:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 17:01:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-14 17:01:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-14 17:01:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-14 17:01:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:01:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-14 17:01:54,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:01:54,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421129925] [2021-12-14 17:01:54,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421129925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:01:54,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:01:54,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-14 17:01:54,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713074184] [2021-12-14 17:01:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:01:54,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 17:01:54,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:01:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 17:01:54,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-12-14 17:01:54,935 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-14 17:01:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:01:55,454 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2021-12-14 17:01:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 17:01:55,454 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 114 [2021-12-14 17:01:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:01:55,455 INFO L225 Difference]: With dead ends: 90 [2021-12-14 17:01:55,455 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 17:01:55,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-12-14 17:01:55,455 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:01:55,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 260 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:01:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 17:01:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 17:01:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 17:01:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 17:01:55,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2021-12-14 17:01:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:01:55,456 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 17:01:55,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-14 17:01:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 17:01:55,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 17:01:55,458 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 17:01:55,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-14 17:01:55,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 17:01:58,231 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-14 17:01:58,231 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-14 17:01:58,231 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-14 17:01:58,231 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-14 17:01:58,231 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-14 17:01:58,231 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2021-12-14 17:01:58,231 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-12-14 17:01:58,231 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-12-14 17:01:58,231 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L854 garLoopResultBuilder]: At program point L8214(line 8214) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse12 (select .cse17 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse11 (select .cse17 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16))) (.cse14 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse15 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse13 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse16 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse5 (select .cse13 .cse16)) (.cse1 (select .cse15 .cse16)) (.cse0 (= (select .cse15 .cse14) 0)) (.cse2 (= (select .cse13 .cse14) 0)) (.cse3 (<= .cse12 .cse11)) (.cse4 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse6 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse7 (= |aws_byte_buf_from_array_#in~len| .cse12)) (.cse8 (<= .cse11 .cse12)) (.cse9 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse10 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse0 (= .cse1 |aws_byte_buf_from_array_#in~bytes.offset|) .cse2 .cse3 .cse4 (= .cse5 |aws_byte_buf_from_array_#in~bytes.base|) .cse6 .cse7 .cse8 (<= 1 (+ (* 18446744073709551616 (div (+ (* |aws_byte_buf_from_array_#in~len| (- 1)) 18446744073709551615) 18446744073709551616)) |aws_byte_buf_from_array_#in~len|)) .cse9 .cse10) (and (= .cse5 0) (= .cse1 0) .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616) 0)) (= |aws_byte_buf_from_array_#in~bytes.base| 0))))) [2021-12-14 17:01:58,232 INFO L858 garLoopResultBuilder]: For program point L8214-2(line 8214) no Hoare annotation was computed. [2021-12-14 17:01:58,232 INFO L854 garLoopResultBuilder]: At program point L8214-1(line 8214) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse15 (select .cse20 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse14 (select .cse20 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16))) (.cse16 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse17 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8)) (.cse19 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse18 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24))) (let ((.cse2 (<= 1 |aws_byte_buf_from_array_#t~ret1053|)) (.cse3 (= (select .cse19 .cse18) 0)) (.cse1 (select .cse19 .cse17)) (.cse4 (= (select .cse16 .cse18) 0)) (.cse5 (<= |aws_byte_buf_from_array_#t~ret1053| 1)) (.cse6 (<= .cse15 .cse14)) (.cse7 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse0 (select .cse16 .cse17)) (.cse8 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse9 (not (= aws_byte_buf_from_array_~bytes.base 0))) (.cse10 (= |aws_byte_buf_from_array_#in~len| .cse15)) (.cse11 (<= .cse14 .cse15)) (.cse12 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse13 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (and (= .cse0 0) (= .cse1 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616) 0)) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse2 .cse3 (= .cse1 |aws_byte_buf_from_array_#in~bytes.offset|) .cse4 .cse5 .cse6 .cse7 (= .cse0 |aws_byte_buf_from_array_#in~bytes.base|) .cse8 .cse9 .cse10 .cse11 (<= 1 (+ (* 18446744073709551616 (div (+ (* |aws_byte_buf_from_array_#in~len| (- 1)) 18446744073709551615) 18446744073709551616)) |aws_byte_buf_from_array_#in~len|)) .cse12 .cse13))))) [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayFINAL(lines 8203 8216) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point L8204-1(line 8204) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L854 garLoopResultBuilder]: At program point L8204(line 8204) the Hoare annotation is: (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L854 garLoopResultBuilder]: At program point aws_byte_buf_from_arrayENTRY(lines 8203 8216) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (= |aws_byte_buf_from_array_#in~bytes.base| 0)) [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayEXIT(lines 8203 8216) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-14 17:01:58,233 INFO L854 garLoopResultBuilder]: At program point L8971(lines 8971 8973) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse9 .cse12) 0)) (.cse2 (= (select .cse11 .cse12) 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1.base| 0)) (.cse6 (= (select .cse11 .cse10) 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse9 .cse10))) (or (and .cse0 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= .cse5 0))))) [2021-12-14 17:01:58,233 INFO L858 garLoopResultBuilder]: For program point L8971-1(lines 8971 8973) no Hoare annotation was computed. [2021-12-14 17:01:58,233 INFO L854 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L8965-1(line 8965) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L854 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse16 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse11 (select .cse16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse13 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse5 (select .cse16 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse12 .cse15) 0)) (.cse2 (= (select .cse14 .cse15) 0)) (.cse3 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse14 .cse13) 0)) (.cse8 (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1211#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse6 (select .cse12 .cse13))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse6) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse11 (* 18446744073709551616 (div .cse11 18446744073709551616))) .cse7 .cse8 .cse9 .cse10 (= .cse6 0)))))) [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L861 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L854 garLoopResultBuilder]: At program point L8970(line 8970) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse13 .cse14) 0)) (.cse2 (= (select .cse11 .cse14) 0)) (.cse3 (= (select .cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse8 (select .cse13 .cse12)) (.cse6 (= (select .cse11 .cse12) 0)) (.cse5 (select .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1212#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) .cse2 .cse3 .cse4 (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616))) .cse6 .cse7 (= .cse8 0) .cse9) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) 18446744073709551616)))) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse8) .cse6 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse7 .cse9)))) [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-14 17:01:58,234 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-12-14 17:01:58,234 INFO L858 garLoopResultBuilder]: For program point L8970-1(line 8970) no Hoare annotation was computed. [2021-12-14 17:01:58,234 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse3)) (= (select .cse2 .cse3) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-14 17:01:58,235 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse9 (select .cse18 .cse16)) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse18 .cse17) 0)) (.cse1 (= (select .cse15 .cse17) 0)) (.cse8 (= .cse9 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= (select .cse15 .cse16) 0)) (.cse5 (= (select .cse2 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) .cse0 .cse1 (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 .cse4 .cse5 .cse6 (exists ((|v_aws_byte_buf_from_array_~#buf~1.offset_9| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_9| Int)) (let ((.cse7 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_9|) |v_aws_byte_buf_from_array_~#buf~1.offset_9|))) (and (<= (mod .cse7 18446744073709551616) 0) (= .cse7 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))) .cse8) (and .cse0 .cse1 (not .cse8) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse9) (exists ((|v_aws_byte_buf_from_array_~#buf~1.offset_13| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_13| Int)) (let ((.cse10 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_13|) |v_aws_byte_buf_from_array_~#buf~1.offset_13|))) (and (< 0 (mod .cse10 18446744073709551616)) (= .cse10 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))) .cse4 .cse5 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_15| Int)) (let ((.cse14 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_15|))) (let ((.cse11 (select .cse14 0)) (.cse12 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (select .cse14 16))) (and (= .cse11 (select .cse12 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (= .cse11 .cse13) (= (select .cse12 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) .cse13))))) .cse6))))) [2021-12-14 17:01:58,235 INFO L854 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse13 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse5 (select .cse14 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse12 .cse16) 0)) (.cse2 (= (select .cse15 .cse16) 0)) (.cse3 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse15 .cse13) 0)) (.cse8 (= (select .cse14 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1210#1| 1)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse6 (select .cse12 .cse13)) (.cse11 (<= 1 |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1210#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse6) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 (= .cse6 0) .cse11))))) [2021-12-14 17:01:58,235 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-12-14 17:01:58,235 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-14 17:01:58,235 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-14 17:01:58,235 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-14 17:01:58,235 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-14 17:01:58,235 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-14 17:01:58,235 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-14 17:01:58,235 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-14 17:01:58,237 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:01:58,238 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 17:01:58,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:01:58 BoogieIcfgContainer [2021-12-14 17:01:58,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 17:01:58,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 17:01:58,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 17:01:58,251 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 17:01:58,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:01:15" (3/4) ... [2021-12-14 17:01:58,253 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 17:01:58,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-14 17:01:58,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_from_array [2021-12-14 17:01:58,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-14 17:01:58,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-14 17:01:58,278 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-14 17:01:58,278 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-14 17:01:58,311 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 122 nodes and edges [2021-12-14 17:01:58,312 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-12-14 17:01:58,313 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-14 17:01:58,314 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-12-14 17:01:58,314 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-14 17:01:58,315 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-14 17:01:58,327 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 17:01:58,328 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 17:01:59,159 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 17:01:59,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 17:01:59,170 INFO L158 Benchmark]: Toolchain (without parser) took 47466.18ms. Allocated memory was 75.5MB in the beginning and 734.0MB in the end (delta: 658.5MB). Free memory was 42.7MB in the beginning and 563.9MB in the end (delta: -521.2MB). Peak memory consumption was 485.4MB. Max. memory is 16.1GB. [2021-12-14 17:01:59,170 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:01:59,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2077.26ms. Allocated memory was 75.5MB in the beginning and 130.0MB in the end (delta: 54.5MB). Free memory was 42.5MB in the beginning and 57.9MB in the end (delta: -15.4MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2021-12-14 17:01:59,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 231.79ms. Allocated memory is still 130.0MB. Free memory was 57.9MB in the beginning and 76.5MB in the end (delta: -18.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 17:01:59,170 INFO L158 Benchmark]: Boogie Preprocessor took 93.25ms. Allocated memory is still 130.0MB. Free memory was 76.5MB in the beginning and 70.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 17:01:59,171 INFO L158 Benchmark]: RCFGBuilder took 1028.34ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 70.2MB in the beginning and 84.0MB in the end (delta: -13.7MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2021-12-14 17:01:59,171 INFO L158 Benchmark]: TraceAbstraction took 43111.56ms. Allocated memory was 188.7MB in the beginning and 734.0MB in the end (delta: 545.3MB). Free memory was 82.9MB in the beginning and 513.4MB in the end (delta: -430.5MB). Peak memory consumption was 394.7MB. Max. memory is 16.1GB. [2021-12-14 17:01:59,171 INFO L158 Benchmark]: Witness Printer took 918.64ms. Allocated memory is still 734.0MB. Free memory was 513.4MB in the beginning and 563.9MB in the end (delta: -50.5MB). Peak memory consumption was 296.6MB. Max. memory is 16.1GB. [2021-12-14 17:01:59,173 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2077.26ms. Allocated memory was 75.5MB in the beginning and 130.0MB in the end (delta: 54.5MB). Free memory was 42.5MB in the beginning and 57.9MB in the end (delta: -15.4MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 231.79ms. Allocated memory is still 130.0MB. Free memory was 57.9MB in the beginning and 76.5MB in the end (delta: -18.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.25ms. Allocated memory is still 130.0MB. Free memory was 76.5MB in the beginning and 70.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1028.34ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 70.2MB in the beginning and 84.0MB in the end (delta: -13.7MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43111.56ms. Allocated memory was 188.7MB in the beginning and 734.0MB in the end (delta: 545.3MB). Free memory was 82.9MB in the beginning and 513.4MB in the end (delta: -430.5MB). Peak memory consumption was 394.7MB. Max. memory is 16.1GB. * Witness Printer took 918.64ms. Allocated memory is still 734.0MB. Free memory was 513.4MB in the beginning and 563.9MB in the end (delta: -50.5MB). Peak memory consumption was 296.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 39, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2964 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2759 mSDsluCounter, 14719 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 770 IncrementalHoareTripleChecker+Unchecked, 11775 mSDsCounter, 1026 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14402 IncrementalHoareTripleChecker+Invalid, 16198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1026 mSolverCounterUnsat, 2944 mSDtfsCounter, 14402 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1656 GetRequests, 977 SyntacticMatches, 17 SemanticMatches, 662 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=26, InterpolantAutomatonStates: 445, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 376 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 288 PreInvPairs, 310 NumberOfFragments, 1677 HoareAnnotationTreeSize, 288 FomulaSimplifications, 5346 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 208206 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 2895 NumberOfCodeBlocks, 2895 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2848 ConstructedInterpolants, 216 QuantifiedInterpolants, 18126 SizeOfPredicates, 80 NumberOfNonLiveVariables, 20017 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 47 InterpolantComputations, 39 PerfectInterpolantSequences, 868/918 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-14 17:01:59,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE