./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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_string_eq_byte_cursor_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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:38:02,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:38:02,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:38:02,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:38:02,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:38:02,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:38:02,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:38:02,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:38:02,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:38:02,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:38:02,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:38:02,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:38:02,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:38:02,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:38:02,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:38:02,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:38:02,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:38:02,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:38:02,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:38:02,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:38:02,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:38:02,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:38:02,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:38:02,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:38:02,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:38:02,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:38:02,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:38:02,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:38:02,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:38:02,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:38:02,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:38:02,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:38:02,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:38:02,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:38:02,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:38:02,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:38:02,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:38:02,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:38:02,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:38:02,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:38:02,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:38:02,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-21 15:38:02,219 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:38:02,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:38:02,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:38:02,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:38:02,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:38:02,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:38:02,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:38:02,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:38:02,222 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:38:02,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:38:02,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:38:02,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:38:02,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:38:02,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:38:02,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:38:02,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:38:02,224 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:38:02,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:38:02,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:38:02,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:38:02,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:38:02,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:38:02,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:38:02,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:38:02,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:38:02,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:38:02,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:38:02,227 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:38:02,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:38:02,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:38:02,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:38:02,227 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2021-12-21 15:38:02,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:38:02,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:38:02,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:38:02,403 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:38:02,404 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:38:02,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2021-12-21 15:38:02,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b71cf6b/9f967adad1024a33964b4a433b53af3a/FLAG5598367eb [2021-12-21 15:38:03,064 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:38:03,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2021-12-21 15:38:03,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b71cf6b/9f967adad1024a33964b4a433b53af3a/FLAG5598367eb [2021-12-21 15:38:03,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b71cf6b/9f967adad1024a33964b4a433b53af3a [2021-12-21 15:38:03,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:38:03,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:38:03,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:38:03,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:38:03,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:38:03,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:38:03" (1/1) ... [2021-12-21 15:38:03,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:03, skipping insertion in model container [2021-12-21 15:38:03,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:38:03" (1/1) ... [2021-12-21 15:38:03,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:38:03,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:38:03,762 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_string_eq_byte_cursor_harness.i[4499,4512] [2021-12-21 15:38:03,768 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_string_eq_byte_cursor_harness.i[4559,4572] [2021-12-21 15:38:04,346 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,347 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,348 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,350 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,351 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,359 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,362 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,364 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,365 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:04,781 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-21 15:38:04,781 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-21 15:38:04,782 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-21 15:38:04,783 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-21 15:38:04,786 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-21 15:38:04,789 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-21 15:38:04,789 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-21 15:38:04,791 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-21 15:38:04,792 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-21 15:38:04,792 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-21 15:38:05,041 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-21 15:38:05,192 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,193 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:38:05,371 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:38:05,411 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_string_eq_byte_cursor_harness.i[4499,4512] [2021-12-21 15:38:05,412 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_string_eq_byte_cursor_harness.i[4559,4572] [2021-12-21 15:38:05,435 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,435 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,436 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,436 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,436 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,440 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,441 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,442 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,442 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,465 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-21 15:38:05,466 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-21 15:38:05,466 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-21 15:38:05,467 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-21 15:38:05,467 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-21 15:38:05,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-21 15:38:05,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-21 15:38:05,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-21 15:38:05,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-21 15:38:05,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-21 15:38:05,481 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-21 15:38:05,527 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,530 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:38:05,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:38:05,733 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:38:05,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05 WrapperNode [2021-12-21 15:38:05,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:38:05,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:38:05,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:38:05,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:38:05,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,894 INFO L137 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 869 [2021-12-21 15:38:05,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:38:05,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:38:05,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:38:05,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:38:05,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:38:05,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:38:05,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:38:05,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:38:05,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (1/1) ... [2021-12-21 15:38:05,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:38:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:06,002 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-21 15:38:06,031 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-21 15:38:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-21 15:38:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-21 15:38:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-12-21 15:38:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-12-21 15:38:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-21 15:38:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-21 15:38:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-21 15:38:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:38:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-21 15:38:06,048 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-21 15:38:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 15:38:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-21 15:38:06,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-21 15:38:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 15:38:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:38:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 15:38:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:38:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:38:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-21 15:38:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-21 15:38:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-21 15:38:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-21 15:38:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-21 15:38:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:38:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 15:38:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2021-12-21 15:38:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2021-12-21 15:38:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 15:38:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-21 15:38:06,054 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-21 15:38:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-21 15:38:06,054 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-21 15:38:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:38:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:38:06,258 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:38:06,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:38:07,038 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:38:07,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:38:07,046 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:38:07,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:38:07 BoogieIcfgContainer [2021-12-21 15:38:07,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:38:07,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:38:07,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:38:07,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:38:07,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:38:03" (1/3) ... [2021-12-21 15:38:07,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57131976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:38:07, skipping insertion in model container [2021-12-21 15:38:07,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:38:05" (2/3) ... [2021-12-21 15:38:07,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57131976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:38:07, skipping insertion in model container [2021-12-21 15:38:07,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:38:07" (3/3) ... [2021-12-21 15:38:07,055 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2021-12-21 15:38:07,061 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:38:07,061 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 15:38:07,104 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:38:07,113 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-21 15:38:07,113 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 15:38:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2021-12-21 15:38:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 15:38:07,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:07,135 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:07,136 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -386411024, now seen corresponding path program 1 times [2021-12-21 15:38:07,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:07,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985952364] [2021-12-21 15:38:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:07,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 15:38:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 15:38:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 15:38:07,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:07,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985952364] [2021-12-21 15:38:07,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985952364] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:07,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324739054] [2021-12-21 15:38:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:07,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:07,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:07,616 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-21 15:38:07,658 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-21 15:38:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-21 15:38:08,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 15:38:08,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:08,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324739054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:08,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:08,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2021-12-21 15:38:08,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563172999] [2021-12-21 15:38:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:08,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 15:38:08,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 15:38:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:08,198 INFO L87 Difference]: Start difference. First operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-21 15:38:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:08,219 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2021-12-21 15:38:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 15:38:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2021-12-21 15:38:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:08,227 INFO L225 Difference]: With dead ends: 241 [2021-12-21 15:38:08,227 INFO L226 Difference]: Without dead ends: 120 [2021-12-21 15:38:08,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:08,232 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:08,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:38:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-21 15:38:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-21 15:38:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.275) internal successors, (102), 81 states have internal predecessors, (102), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-21 15:38:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2021-12-21 15:38:08,263 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 61 [2021-12-21 15:38:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:08,264 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2021-12-21 15:38:08,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-21 15:38:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2021-12-21 15:38:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 15:38:08,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:08,267 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:08,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 15:38:08,487 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,SelfDestructingSolverStorable0 [2021-12-21 15:38:08,487 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1156835566, now seen corresponding path program 1 times [2021-12-21 15:38:08,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:08,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149026435] [2021-12-21 15:38:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:08,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 15:38:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 15:38:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 15:38:08,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:08,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149026435] [2021-12-21 15:38:08,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149026435] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:08,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387606343] [2021-12-21 15:38:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:08,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:08,671 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-21 15:38:08,672 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-21 15:38:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 15:38:09,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 15:38:09,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-21 15:38:09,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387606343] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:09,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 15:38:09,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2021-12-21 15:38:09,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713784724] [2021-12-21 15:38:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:09,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:38:09,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:09,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:38:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-21 15:38:09,331 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-21 15:38:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:09,498 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2021-12-21 15:38:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:38:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2021-12-21 15:38:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:09,500 INFO L225 Difference]: With dead ends: 208 [2021-12-21 15:38:09,500 INFO L226 Difference]: Without dead ends: 155 [2021-12-21 15:38:09,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-21 15:38:09,502 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 241 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:09,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 548 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:38:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-21 15:38:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2021-12-21 15:38:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-21 15:38:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2021-12-21 15:38:09,513 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 61 [2021-12-21 15:38:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:09,513 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2021-12-21 15:38:09,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-21 15:38:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2021-12-21 15:38:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 15:38:09,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:09,516 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:09,554 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-21 15:38:09,755 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,SelfDestructingSolverStorable1 [2021-12-21 15:38:09,755 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928336, now seen corresponding path program 1 times [2021-12-21 15:38:09,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:09,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114262232] [2021-12-21 15:38:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:09,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 15:38:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 15:38:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 15:38:09,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114262232] [2021-12-21 15:38:09,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114262232] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833501837] [2021-12-21 15:38:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:09,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:09,923 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-21 15:38:09,924 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-21 15:38:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:10,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 15:38:10,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 15:38:10,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 15:38:10,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833501837] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:10,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:10,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2021-12-21 15:38:10,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346153585] [2021-12-21 15:38:10,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:10,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:38:10,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:10,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:38:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:38:10,623 INFO L87 Difference]: Start difference. First operand 132 states and 177 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-21 15:38:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:10,757 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2021-12-21 15:38:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 15:38:10,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 61 [2021-12-21 15:38:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:10,759 INFO L225 Difference]: With dead ends: 230 [2021-12-21 15:38:10,760 INFO L226 Difference]: Without dead ends: 135 [2021-12-21 15:38:10,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:38:10,761 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 336 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:10,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 588 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:38:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-21 15:38:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-12-21 15:38:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 92 states have internal predecessors, (114), 33 states have call successors, (33), 10 states have call predecessors, (33), 11 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2021-12-21 15:38:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2021-12-21 15:38:10,771 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 61 [2021-12-21 15:38:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:10,771 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2021-12-21 15:38:10,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-21 15:38:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2021-12-21 15:38:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-21 15:38:10,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:10,774 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:10,796 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-21 15:38:10,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:10,994 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1531369667, now seen corresponding path program 1 times [2021-12-21 15:38:10,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:10,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909532415] [2021-12-21 15:38:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:10,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 15:38:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 15:38:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:38:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-21 15:38:11,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:11,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909532415] [2021-12-21 15:38:11,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909532415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:11,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:11,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 15:38:11,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666848394] [2021-12-21 15:38:11,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:11,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:38:11,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:38:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 15:38:11,177 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-21 15:38:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:11,196 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2021-12-21 15:38:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 15:38:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2021-12-21 15:38:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:11,198 INFO L225 Difference]: With dead ends: 233 [2021-12-21 15:38:11,198 INFO L226 Difference]: Without dead ends: 179 [2021-12-21 15:38:11,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 15:38:11,199 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:11,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 482 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:38:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-21 15:38:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2021-12-21 15:38:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 118 states have (on average 1.271186440677966) internal successors, (150), 120 states have internal predecessors, (150), 47 states have call successors, (47), 10 states have call predecessors, (47), 11 states have return successors, (50), 46 states have call predecessors, (50), 46 states have call successors, (50) [2021-12-21 15:38:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2021-12-21 15:38:11,210 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 65 [2021-12-21 15:38:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:11,211 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2021-12-21 15:38:11,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-21 15:38:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2021-12-21 15:38:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-21 15:38:11,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:11,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:11,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:38:11,213 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:11,214 INFO L85 PathProgramCache]: Analyzing trace with hash -84293126, now seen corresponding path program 1 times [2021-12-21 15:38:11,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:11,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112425197] [2021-12-21 15:38:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:11,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 15:38:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 15:38:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:38:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 15:38:11,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:11,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112425197] [2021-12-21 15:38:11,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112425197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:11,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:11,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:38:11,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417785460] [2021-12-21 15:38:11,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:11,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:38:11,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:11,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:38:11,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:38:11,417 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-21 15:38:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:11,459 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2021-12-21 15:38:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:38:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2021-12-21 15:38:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:11,461 INFO L225 Difference]: With dead ends: 188 [2021-12-21 15:38:11,461 INFO L226 Difference]: Without dead ends: 181 [2021-12-21 15:38:11,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:38:11,461 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:11,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1078 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:38:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-21 15:38:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-21 15:38:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 124 states have internal predecessors, (153), 47 states have call successors, (47), 10 states have call predecessors, (47), 12 states have return successors, (56), 46 states have call predecessors, (56), 46 states have call successors, (56) [2021-12-21 15:38:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2021-12-21 15:38:11,483 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 65 [2021-12-21 15:38:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:11,483 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2021-12-21 15:38:11,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-21 15:38:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2021-12-21 15:38:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-21 15:38:11,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:11,485 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:11,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:38:11,485 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1359362750, now seen corresponding path program 1 times [2021-12-21 15:38:11,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:11,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792565971] [2021-12-21 15:38:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:11,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 15:38:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 15:38:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:38:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-21 15:38:11,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:11,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792565971] [2021-12-21 15:38:11,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792565971] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:11,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514823109] [2021-12-21 15:38:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:11,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:11,744 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-21 15:38:11,803 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-21 15:38:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:12,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 15:38:12,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 15:38:12,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:12,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-21 15:38:13,002 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-21 15:38:13,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-21 15:38:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 15:38:13,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514823109] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:13,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:13,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2021-12-21 15:38:13,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894938692] [2021-12-21 15:38:13,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:13,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 15:38:13,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:13,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 15:38:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-12-21 15:38:13,030 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-21 15:38:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:13,566 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-12-21 15:38:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 15:38:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 69 [2021-12-21 15:38:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:13,569 INFO L225 Difference]: With dead ends: 334 [2021-12-21 15:38:13,569 INFO L226 Difference]: Without dead ends: 306 [2021-12-21 15:38:13,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-12-21 15:38:13,569 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 96 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:13,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1862 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 140 Unchecked, 0.3s Time] [2021-12-21 15:38:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-21 15:38:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2021-12-21 15:38:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 188 states have internal predecessors, (238), 71 states have call successors, (71), 12 states have call predecessors, (71), 14 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2021-12-21 15:38:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 391 transitions. [2021-12-21 15:38:13,587 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 391 transitions. Word has length 69 [2021-12-21 15:38:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:13,588 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 391 transitions. [2021-12-21 15:38:13,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-21 15:38:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 391 transitions. [2021-12-21 15:38:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-21 15:38:13,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:13,591 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-21 15:38:13,629 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-21 15:38:13,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:13,807 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1404727030, now seen corresponding path program 1 times [2021-12-21 15:38:13,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:13,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016451016] [2021-12-21 15:38:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:13,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 15:38:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 15:38:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-21 15:38:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-21 15:38:13,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016451016] [2021-12-21 15:38:13,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016451016] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166461450] [2021-12-21 15:38:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:13,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:13,980 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-21 15:38:14,019 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-21 15:38:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 15:38:14,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 15:38:14,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:14,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166461450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:14,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:14,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-12-21 15:38:14,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194852654] [2021-12-21 15:38:14,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:14,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:38:14,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:14,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:38:14,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:38:14,458 INFO L87 Difference]: Start difference. First operand 270 states and 391 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-21 15:38:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:14,552 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2021-12-21 15:38:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:38:14,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2021-12-21 15:38:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:14,555 INFO L225 Difference]: With dead ends: 411 [2021-12-21 15:38:14,567 INFO L226 Difference]: Without dead ends: 275 [2021-12-21 15:38:14,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-21 15:38:14,569 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:14,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1155 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:38:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-21 15:38:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-12-21 15:38:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 193 states have internal predecessors, (242), 71 states have call successors, (71), 12 states have call predecessors, (71), 15 states have return successors, (87), 69 states have call predecessors, (87), 70 states have call successors, (87) [2021-12-21 15:38:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2021-12-21 15:38:14,584 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 73 [2021-12-21 15:38:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:14,585 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2021-12-21 15:38:14,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-21 15:38:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2021-12-21 15:38:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-21 15:38:14,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:14,587 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:14,618 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-21 15:38:14,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:14,816 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1686084061, now seen corresponding path program 1 times [2021-12-21 15:38:14,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:14,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040405212] [2021-12-21 15:38:14,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:14,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 15:38:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 15:38:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 15:38:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-21 15:38:14,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:14,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040405212] [2021-12-21 15:38:14,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040405212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:14,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:14,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 15:38:14,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114299737] [2021-12-21 15:38:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:14,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 15:38:14,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 15:38:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:14,970 INFO L87 Difference]: Start difference. First operand 275 states and 400 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-21 15:38:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:15,015 INFO L93 Difference]: Finished difference Result 397 states and 565 transitions. [2021-12-21 15:38:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:38:15,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2021-12-21 15:38:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:15,017 INFO L225 Difference]: With dead ends: 397 [2021-12-21 15:38:15,017 INFO L226 Difference]: Without dead ends: 296 [2021-12-21 15:38:15,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:38:15,018 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:15,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 692 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:38:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-12-21 15:38:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2021-12-21 15:38:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 188 states have internal predecessors, (229), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2021-12-21 15:38:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2021-12-21 15:38:15,032 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 76 [2021-12-21 15:38:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:15,033 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2021-12-21 15:38:15,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-21 15:38:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2021-12-21 15:38:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-21 15:38:15,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:15,034 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:15,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:38:15,034 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1559219441, now seen corresponding path program 1 times [2021-12-21 15:38:15,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:15,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069332036] [2021-12-21 15:38:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:15,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 15:38:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 15:38:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:38:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:38:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-21 15:38:15,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:15,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069332036] [2021-12-21 15:38:15,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069332036] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:15,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731717499] [2021-12-21 15:38:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:15,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:15,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:15,218 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-21 15:38:15,219 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-21 15:38:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:15,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 15:38:15,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-21 15:38:15,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:15,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731717499] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:15,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:15,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-12-21 15:38:15,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671573753] [2021-12-21 15:38:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:15,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 15:38:15,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:15,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 15:38:15,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:38:15,729 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-21 15:38:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:15,863 INFO L93 Difference]: Finished difference Result 405 states and 571 transitions. [2021-12-21 15:38:15,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 15:38:15,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2021-12-21 15:38:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:15,865 INFO L225 Difference]: With dead ends: 405 [2021-12-21 15:38:15,865 INFO L226 Difference]: Without dead ends: 266 [2021-12-21 15:38:15,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:38:15,866 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 15 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:15,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 564 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-12-21 15:38:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-21 15:38:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-12-21 15:38:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 188 states have internal predecessors, (228), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2021-12-21 15:38:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2021-12-21 15:38:15,880 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 75 [2021-12-21 15:38:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:15,880 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2021-12-21 15:38:15,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-21 15:38:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2021-12-21 15:38:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-21 15:38:15,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:15,881 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:15,917 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-21 15:38:16,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:16,101 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318767, now seen corresponding path program 1 times [2021-12-21 15:38:16,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:16,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951257449] [2021-12-21 15:38:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:16,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 15:38:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 15:38:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:38:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:38:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 15:38:16,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:16,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951257449] [2021-12-21 15:38:16,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951257449] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:16,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417795327] [2021-12-21 15:38:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:16,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:16,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:16,488 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-21 15:38:16,529 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-21 15:38:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-21 15:38:16,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:16,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 15:38:16,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 15:38:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 15:38:17,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:17,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417795327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:17,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:17,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2021-12-21 15:38:17,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787745797] [2021-12-21 15:38:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:17,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:38:17,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:38:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-12-21 15:38:17,455 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-21 15:38:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:17,522 INFO L93 Difference]: Finished difference Result 422 states and 584 transitions. [2021-12-21 15:38:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:38:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2021-12-21 15:38:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:17,524 INFO L225 Difference]: With dead ends: 422 [2021-12-21 15:38:17,524 INFO L226 Difference]: Without dead ends: 273 [2021-12-21 15:38:17,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-12-21 15:38:17,525 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:17,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 706 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2021-12-21 15:38:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-21 15:38:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2021-12-21 15:38:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 187 states have (on average 1.2459893048128343) internal successors, (233), 191 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2021-12-21 15:38:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 377 transitions. [2021-12-21 15:38:17,537 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 377 transitions. Word has length 75 [2021-12-21 15:38:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:17,538 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 377 transitions. [2021-12-21 15:38:17,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-21 15:38:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 377 transitions. [2021-12-21 15:38:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-21 15:38:17,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:17,539 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:17,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-21 15:38:17,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:17,760 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1074644017, now seen corresponding path program 1 times [2021-12-21 15:38:17,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:17,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121664990] [2021-12-21 15:38:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:17,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 15:38:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 15:38:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:38:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:38:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 15:38:17,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:17,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121664990] [2021-12-21 15:38:17,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121664990] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:17,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321887865] [2021-12-21 15:38:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:17,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:17,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:17,896 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-21 15:38:17,898 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-21 15:38:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 15:38:18,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-21 15:38:18,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:18,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321887865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:18,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:18,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-21 15:38:18,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908903909] [2021-12-21 15:38:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:18,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:38:18,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:38:18,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 15:38:18,335 INFO L87 Difference]: Start difference. First operand 270 states and 377 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-21 15:38:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:18,362 INFO L93 Difference]: Finished difference Result 414 states and 578 transitions. [2021-12-21 15:38:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:38:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2021-12-21 15:38:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:18,364 INFO L225 Difference]: With dead ends: 414 [2021-12-21 15:38:18,364 INFO L226 Difference]: Without dead ends: 274 [2021-12-21 15:38:18,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:18,365 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 9 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 462 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-21 15:38:18,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:38:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-12-21 15:38:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2021-12-21 15:38:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 188 states have (on average 1.2393617021276595) internal successors, (233), 192 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (75), 65 states have call predecessors, (75), 66 states have call successors, (75) [2021-12-21 15:38:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2021-12-21 15:38:18,376 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 75 [2021-12-21 15:38:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:18,376 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2021-12-21 15:38:18,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-21 15:38:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2021-12-21 15:38:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-21 15:38:18,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:18,377 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:18,399 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-21 15:38:18,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-21 15:38:18,600 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash -453034012, now seen corresponding path program 1 times [2021-12-21 15:38:18,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:18,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563772563] [2021-12-21 15:38:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:18,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 15:38:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 15:38:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-21 15:38:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 15:38:18,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:18,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563772563] [2021-12-21 15:38:18,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563772563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:18,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305334460] [2021-12-21 15:38:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:18,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:18,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:38:18,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 15:38:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:19,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 15:38:19,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 15:38:19,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-21 15:38:19,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305334460] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:19,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:19,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2021-12-21 15:38:19,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684807447] [2021-12-21 15:38:19,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:19,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 15:38:19,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 15:38:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-12-21 15:38:19,544 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2021-12-21 15:38:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:19,856 INFO L93 Difference]: Finished difference Result 385 states and 522 transitions. [2021-12-21 15:38:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:38:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) Word has length 77 [2021-12-21 15:38:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:19,858 INFO L225 Difference]: With dead ends: 385 [2021-12-21 15:38:19,858 INFO L226 Difference]: Without dead ends: 292 [2021-12-21 15:38:19,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2021-12-21 15:38:19,859 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 406 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:19,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 1261 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:38:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-21 15:38:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2021-12-21 15:38:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 186 states have (on average 1.2365591397849462) internal successors, (230), 189 states have internal predecessors, (230), 67 states have call successors, (67), 13 states have call predecessors, (67), 14 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2021-12-21 15:38:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2021-12-21 15:38:19,872 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 77 [2021-12-21 15:38:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:19,872 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2021-12-21 15:38:19,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2021-12-21 15:38:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2021-12-21 15:38:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-21 15:38:19,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:19,873 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:19,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:20,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:20,093 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1814152958, now seen corresponding path program 1 times [2021-12-21 15:38:20,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:20,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371208126] [2021-12-21 15:38:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:20,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 15:38:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 15:38:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:38:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 15:38:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 15:38:20,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:20,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371208126] [2021-12-21 15:38:20,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371208126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:20,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:20,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 15:38:20,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851678020] [2021-12-21 15:38:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:20,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 15:38:20,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 15:38:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:20,232 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-21 15:38:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:20,263 INFO L93 Difference]: Finished difference Result 344 states and 465 transitions. [2021-12-21 15:38:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 15:38:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2021-12-21 15:38:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:20,265 INFO L225 Difference]: With dead ends: 344 [2021-12-21 15:38:20,265 INFO L226 Difference]: Without dead ends: 268 [2021-12-21 15:38:20,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:38:20,266 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 18 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:20,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 634 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:38:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-21 15:38:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2021-12-21 15:38:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 182 states have (on average 1.2087912087912087) internal successors, (220), 185 states have internal predecessors, (220), 65 states have call successors, (65), 13 states have call predecessors, (65), 14 states have return successors, (71), 63 states have call predecessors, (71), 64 states have call successors, (71) [2021-12-21 15:38:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 356 transitions. [2021-12-21 15:38:20,278 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 356 transitions. Word has length 78 [2021-12-21 15:38:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:20,278 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 356 transitions. [2021-12-21 15:38:20,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-21 15:38:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 356 transitions. [2021-12-21 15:38:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-21 15:38:20,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:20,280 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-21 15:38:20,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 15:38:20,280 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:20,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1823272801, now seen corresponding path program 1 times [2021-12-21 15:38:20,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:20,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725420113] [2021-12-21 15:38:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:20,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 15:38:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 15:38:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 15:38:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 15:38:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 15:38:20,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:20,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725420113] [2021-12-21 15:38:20,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725420113] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:20,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688562111] [2021-12-21 15:38:20,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:20,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:20,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:20,551 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:38:20,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 15:38:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:20,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 15:38:20,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 15:38:21,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:21,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-21 15:38:21,834 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-21 15:38:21,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-21 15:38:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 15:38:21,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688562111] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:21,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:21,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2021-12-21 15:38:21,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322293280] [2021-12-21 15:38:21,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:21,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 15:38:21,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:21,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 15:38:21,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-12-21 15:38:21,857 INFO L87 Difference]: Start difference. First operand 262 states and 356 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-21 15:38:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:22,507 INFO L93 Difference]: Finished difference Result 383 states and 526 transitions. [2021-12-21 15:38:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 15:38:22,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 79 [2021-12-21 15:38:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:22,509 INFO L225 Difference]: With dead ends: 383 [2021-12-21 15:38:22,509 INFO L226 Difference]: Without dead ends: 319 [2021-12-21 15:38:22,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 153 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-21 15:38:22,510 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 197 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:22,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1582 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 453 Invalid, 0 Unknown, 179 Unchecked, 0.4s Time] [2021-12-21 15:38:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-21 15:38:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 254. [2021-12-21 15:38:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.1931818181818181) internal successors, (210), 179 states have internal predecessors, (210), 62 states have call successors, (62), 14 states have call predecessors, (62), 15 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2021-12-21 15:38:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 339 transitions. [2021-12-21 15:38:22,536 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 339 transitions. Word has length 79 [2021-12-21 15:38:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:22,536 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 339 transitions. [2021-12-21 15:38:22,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-21 15:38:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 339 transitions. [2021-12-21 15:38:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-21 15:38:22,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:22,540 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:22,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:22,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-21 15:38:22,758 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1762517655, now seen corresponding path program 1 times [2021-12-21 15:38:22,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:22,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707057881] [2021-12-21 15:38:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:22,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 15:38:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-21 15:38:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 15:38:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 15:38:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 15:38:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-21 15:38:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-21 15:38:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-21 15:38:23,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:23,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707057881] [2021-12-21 15:38:23,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707057881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:23,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:23,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 15:38:23,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072455229] [2021-12-21 15:38:23,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:23,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 15:38:23,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 15:38:23,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:38:23,182 INFO L87 Difference]: Start difference. First operand 254 states and 339 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-21 15:38:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:23,689 INFO L93 Difference]: Finished difference Result 320 states and 431 transitions. [2021-12-21 15:38:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 15:38:23,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2021-12-21 15:38:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:23,691 INFO L225 Difference]: With dead ends: 320 [2021-12-21 15:38:23,691 INFO L226 Difference]: Without dead ends: 313 [2021-12-21 15:38:23,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-21 15:38:23,692 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 160 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:23,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 859 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 15:38:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-21 15:38:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 259. [2021-12-21 15:38:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 180 states have (on average 1.1888888888888889) internal successors, (214), 184 states have internal predecessors, (214), 62 states have call successors, (62), 14 states have call predecessors, (62), 16 states have return successors, (69), 60 states have call predecessors, (69), 60 states have call successors, (69) [2021-12-21 15:38:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 345 transitions. [2021-12-21 15:38:23,727 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 345 transitions. Word has length 86 [2021-12-21 15:38:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:23,728 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 345 transitions. [2021-12-21 15:38:23,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-21 15:38:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 345 transitions. [2021-12-21 15:38:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-21 15:38:23,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:23,729 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:23,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 15:38:23,729 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1504352217, now seen corresponding path program 1 times [2021-12-21 15:38:23,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:23,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556191052] [2021-12-21 15:38:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:23,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 15:38:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-21 15:38:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 15:38:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 15:38:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 15:38:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-21 15:38:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-21 15:38:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-21 15:38:23,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:23,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556191052] [2021-12-21 15:38:23,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556191052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:23,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:23,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 15:38:23,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049167528] [2021-12-21 15:38:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:23,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 15:38:23,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 15:38:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:23,973 INFO L87 Difference]: Start difference. First operand 259 states and 345 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-21 15:38:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:24,151 INFO L93 Difference]: Finished difference Result 378 states and 492 transitions. [2021-12-21 15:38:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:38:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2021-12-21 15:38:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:24,153 INFO L225 Difference]: With dead ends: 378 [2021-12-21 15:38:24,153 INFO L226 Difference]: Without dead ends: 252 [2021-12-21 15:38:24,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:38:24,153 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:24,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 402 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:38:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-21 15:38:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2021-12-21 15:38:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 172 states have (on average 1.186046511627907) internal successors, (204), 175 states have internal predecessors, (204), 62 states have call successors, (62), 14 states have call predecessors, (62), 15 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2021-12-21 15:38:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 332 transitions. [2021-12-21 15:38:24,167 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 332 transitions. Word has length 86 [2021-12-21 15:38:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:24,168 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 332 transitions. [2021-12-21 15:38:24,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-21 15:38:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 332 transitions. [2021-12-21 15:38:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-21 15:38:24,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:24,169 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2021-12-21 15:38:24,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 15:38:24,169 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash 858492976, now seen corresponding path program 1 times [2021-12-21 15:38:24,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:24,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499277188] [2021-12-21 15:38:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:24,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-21 15:38:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 15:38:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-21 15:38:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 15:38:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 15:38:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 15:38:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-21 15:38:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-21 15:38:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-21 15:38:24,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:24,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499277188] [2021-12-21 15:38:24,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499277188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:24,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:24,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-21 15:38:24,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341220651] [2021-12-21 15:38:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:24,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 15:38:24,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:24,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 15:38:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:38:24,392 INFO L87 Difference]: Start difference. First operand 250 states and 332 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-21 15:38:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:24,868 INFO L93 Difference]: Finished difference Result 260 states and 341 transitions. [2021-12-21 15:38:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 15:38:24,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2021-12-21 15:38:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:24,869 INFO L225 Difference]: With dead ends: 260 [2021-12-21 15:38:24,869 INFO L226 Difference]: Without dead ends: 213 [2021-12-21 15:38:24,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-12-21 15:38:24,870 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:24,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1264 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 15:38:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-21 15:38:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 183. [2021-12-21 15:38:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 131 states have internal predecessors, (148), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2021-12-21 15:38:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 231 transitions. [2021-12-21 15:38:24,880 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 231 transitions. Word has length 88 [2021-12-21 15:38:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:24,880 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 231 transitions. [2021-12-21 15:38:24,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-21 15:38:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 231 transitions. [2021-12-21 15:38:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-21 15:38:24,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:24,881 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:38:24,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 15:38:24,882 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1641071482, now seen corresponding path program 1 times [2021-12-21 15:38:24,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:24,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39578496] [2021-12-21 15:38:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:24,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:38:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-21 15:38:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-21 15:38:25,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:25,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39578496] [2021-12-21 15:38:25,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39578496] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:25,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368146608] [2021-12-21 15:38:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:25,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:25,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:25,287 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:38:25,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 15:38:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:25,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-21 15:38:25,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-21 15:38:25,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:25,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368146608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:25,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:25,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2021-12-21 15:38:25,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807180441] [2021-12-21 15:38:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:25,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:38:25,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:38:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-12-21 15:38:25,868 INFO L87 Difference]: Start difference. First operand 183 states and 231 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-21 15:38:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:25,994 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2021-12-21 15:38:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:38:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 99 [2021-12-21 15:38:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:25,996 INFO L225 Difference]: With dead ends: 219 [2021-12-21 15:38:25,996 INFO L226 Difference]: Without dead ends: 183 [2021-12-21 15:38:25,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-12-21 15:38:25,997 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:25,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1228 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:38:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-21 15:38:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-12-21 15:38:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 131 states have internal predecessors, (147), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2021-12-21 15:38:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2021-12-21 15:38:26,007 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 99 [2021-12-21 15:38:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:26,007 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2021-12-21 15:38:26,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-21 15:38:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2021-12-21 15:38:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 15:38:26,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:26,009 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:38:26,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:26,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-21 15:38:26,227 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1774035915, now seen corresponding path program 1 times [2021-12-21 15:38:26,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:26,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212429874] [2021-12-21 15:38:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:26,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:38:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:38:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-21 15:38:26,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212429874] [2021-12-21 15:38:26,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212429874] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272719530] [2021-12-21 15:38:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:26,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:26,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:26,636 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:38:26,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 15:38:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 15:38:27,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-21 15:38:27,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:27,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272719530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:27,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:27,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2021-12-21 15:38:27,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070987557] [2021-12-21 15:38:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:27,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:38:27,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:38:27,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-12-21 15:38:27,297 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-21 15:38:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:27,364 INFO L93 Difference]: Finished difference Result 275 states and 355 transitions. [2021-12-21 15:38:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:38:27,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 100 [2021-12-21 15:38:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:27,366 INFO L225 Difference]: With dead ends: 275 [2021-12-21 15:38:27,366 INFO L226 Difference]: Without dead ends: 214 [2021-12-21 15:38:27,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-12-21 15:38:27,367 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 18 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:27,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 610 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 15:38:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-21 15:38:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2021-12-21 15:38:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 137 states have internal predecessors, (151), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2021-12-21 15:38:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2021-12-21 15:38:27,377 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 100 [2021-12-21 15:38:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:27,377 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2021-12-21 15:38:27,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-21 15:38:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2021-12-21 15:38:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-21 15:38:27,378 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:27,378 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:27,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:27,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:27,579 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1103291491, now seen corresponding path program 1 times [2021-12-21 15:38:27,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:27,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622436290] [2021-12-21 15:38:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:27,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-21 15:38:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-21 15:38:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-21 15:38:27,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:27,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622436290] [2021-12-21 15:38:27,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622436290] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:27,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401122626] [2021-12-21 15:38:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:27,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:27,943 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:38:27,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 15:38:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:28,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 15:38:28,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 15:38:28,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-21 15:38:28,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401122626] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:28,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 15:38:28,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 7] total 27 [2021-12-21 15:38:28,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189708985] [2021-12-21 15:38:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:28,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:38:28,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:38:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2021-12-21 15:38:28,751 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-21 15:38:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:28,928 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2021-12-21 15:38:28,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:38:28,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2021-12-21 15:38:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:28,930 INFO L225 Difference]: With dead ends: 268 [2021-12-21 15:38:28,930 INFO L226 Difference]: Without dead ends: 214 [2021-12-21 15:38:28,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2021-12-21 15:38:28,930 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 202 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:28,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 601 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:38:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-21 15:38:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2021-12-21 15:38:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 137 states have internal predecessors, (149), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2021-12-21 15:38:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2021-12-21 15:38:28,941 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 109 [2021-12-21 15:38:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:28,941 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2021-12-21 15:38:28,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-21 15:38:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2021-12-21 15:38:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-21 15:38:28,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:28,942 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:28,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:29,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-12-21 15:38:29,164 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155491, now seen corresponding path program 1 times [2021-12-21 15:38:29,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:29,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826945972] [2021-12-21 15:38:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:29,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:38:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-21 15:38:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-21 15:38:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-21 15:38:29,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:29,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826945972] [2021-12-21 15:38:29,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826945972] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:29,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531698416] [2021-12-21 15:38:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:29,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:29,756 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:38:29,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-21 15:38:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-21 15:38:30,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-21 15:38:30,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:30,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531698416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:30,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:30,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2021-12-21 15:38:30,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602906222] [2021-12-21 15:38:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:30,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:38:30,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:30,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:38:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-12-21 15:38:30,419 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-21 15:38:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:30,521 INFO L93 Difference]: Finished difference Result 271 states and 326 transitions. [2021-12-21 15:38:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:38:30,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 109 [2021-12-21 15:38:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:30,523 INFO L225 Difference]: With dead ends: 271 [2021-12-21 15:38:30,523 INFO L226 Difference]: Without dead ends: 183 [2021-12-21 15:38:30,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-12-21 15:38:30,524 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:30,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 1259 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:38:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-21 15:38:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-12-21 15:38:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.110236220472441) internal successors, (141), 131 states have internal predecessors, (141), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2021-12-21 15:38:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2021-12-21 15:38:30,534 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 109 [2021-12-21 15:38:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:30,536 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2021-12-21 15:38:30,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-21 15:38:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2021-12-21 15:38:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-21 15:38:30,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:30,538 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:30,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:30,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:30,760 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1526938213, now seen corresponding path program 1 times [2021-12-21 15:38:30,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:30,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036340957] [2021-12-21 15:38:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:30,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-21 15:38:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-21 15:38:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-21 15:38:30,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:30,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036340957] [2021-12-21 15:38:30,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036340957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:30,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:30,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:38:30,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635796660] [2021-12-21 15:38:30,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:30,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:38:30,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:30,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:38:30,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:38:30,940 INFO L87 Difference]: Start difference. First operand 183 states and 224 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-21 15:38:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:31,138 INFO L93 Difference]: Finished difference Result 219 states and 264 transitions. [2021-12-21 15:38:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:38:31,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2021-12-21 15:38:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:31,140 INFO L225 Difference]: With dead ends: 219 [2021-12-21 15:38:31,140 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 15:38:31,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:38:31,140 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:31,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 385 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:38:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 15:38:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-12-21 15:38:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 117 states have internal predecessors, (125), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2021-12-21 15:38:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-12-21 15:38:31,174 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 109 [2021-12-21 15:38:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:31,174 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-12-21 15:38:31,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-21 15:38:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-12-21 15:38:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-21 15:38:31,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:31,176 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:31,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 15:38:31,177 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:31,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2132558451, now seen corresponding path program 1 times [2021-12-21 15:38:31,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:31,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153894571] [2021-12-21 15:38:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:31,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-21 15:38:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:38:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-21 15:38:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-21 15:38:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-12-21 15:38:31,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153894571] [2021-12-21 15:38:31,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153894571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:31,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:31,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:38:31,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987114898] [2021-12-21 15:38:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:31,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:38:31,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:31,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:38:31,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:38:31,379 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-21 15:38:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:31,606 INFO L93 Difference]: Finished difference Result 203 states and 239 transitions. [2021-12-21 15:38:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:38:31,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2021-12-21 15:38:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:31,607 INFO L225 Difference]: With dead ends: 203 [2021-12-21 15:38:31,608 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 15:38:31,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:38:31,608 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 48 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:31,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 544 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:38:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 15:38:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-12-21 15:38:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.087719298245614) internal successors, (124), 117 states have internal predecessors, (124), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2021-12-21 15:38:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2021-12-21 15:38:31,620 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 134 [2021-12-21 15:38:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:31,620 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2021-12-21 15:38:31,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-21 15:38:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2021-12-21 15:38:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-21 15:38:31,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:31,622 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:38:31,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 15:38:31,623 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:31,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 284756267, now seen corresponding path program 1 times [2021-12-21 15:38:31,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:31,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818498886] [2021-12-21 15:38:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:31,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 15:38:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 15:38:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-21 15:38:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:38:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-21 15:38:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-21 15:38:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-12-21 15:38:31,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:31,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818498886] [2021-12-21 15:38:31,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818498886] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:31,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146532038] [2021-12-21 15:38:31,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:31,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:31,962 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:38:31,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 15:38:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:32,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-21 15:38:32,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-21 15:38:35,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:38,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146532038] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:38,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 15:38:38,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2021-12-21 15:38:38,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682912260] [2021-12-21 15:38:38,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:38,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-21 15:38:38,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:38,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-21 15:38:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2021-12-21 15:38:38,832 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2021-12-21 15:38:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:39,547 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2021-12-21 15:38:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 15:38:39,548 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) Word has length 135 [2021-12-21 15:38:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:39,548 INFO L225 Difference]: With dead ends: 179 [2021-12-21 15:38:39,548 INFO L226 Difference]: Without dead ends: 0 [2021-12-21 15:38:39,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2021-12-21 15:38:39,550 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:39,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 503 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 489 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2021-12-21 15:38:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-21 15:38:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-21 15:38:39,550 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-21 15:38:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-21 15:38:39,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2021-12-21 15:38:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:39,551 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-21 15:38:39,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2021-12-21 15:38:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-21 15:38:39,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-21 15:38:39,553 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 15:38:39,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:39,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:39,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-21 15:38:41,472 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0))) [2021-12-21 15:38:41,472 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-12-21 15:38:41,472 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2021-12-21 15:38:41,472 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-12-21 15:38:41,472 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) (not (< 0 |#StackHeapBarrier|))) [2021-12-21 15:38:41,472 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-12-21 15:38:41,472 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2021-12-21 15:38:41,472 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-12-21 15:38:41,472 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2021-12-21 15:38:41,472 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) 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|)) (not (< 0 |#StackHeapBarrier|))) [2021-12-21 15:38:41,472 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-21 15:38:41,473 INFO L861 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L861 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L861 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-21 15:38:41,473 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-21 15:38:41,474 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-21 15:38:41,474 INFO L858 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L854 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L854 garLoopResultBuilder]: At program point L9549-4(lines 9549 9559) the Hoare annotation is: (let ((.cse1 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse2 (< 0 |#StackHeapBarrier|))) (or (and (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2))) [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L854 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1| 1) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1|) (< 0 |#StackHeapBarrier|)) [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L854 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (let ((.cse15 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse16 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse17 (<= 0 (+ (* (div (* (- 1) .cse12) 18446744073709551616) 18446744073709551616) .cse12))) (.cse2 (not .cse14)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (<= .cse12 (* (div .cse12 18446744073709551616) 18446744073709551616)) .cse4 .cse5 .cse10 .cse13 .cse14 .cse11) (and |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse16 .cse13 .cse14 .cse11) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse6 .cse15 .cse9 .cse10 .cse16 .cse13 .cse14 .cse11) (and .cse0 .cse1 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11)))) [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L858 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2021-12-21 15:38:41,475 INFO L854 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse8 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1|)) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616) .cse2))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse9 .cse10 .cse11 .cse12))) [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1| 0) .cse3 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse3 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616) .cse0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse16 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse17 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (not .cse13)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse15 (<= .cse18 (* (div .cse18 18446744073709551616) 18446744073709551616))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse12 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse11) (and .cse14 .cse15 .cse6 .cse16 .cse9 .cse10 .cse17 .cse12 .cse13 .cse11) (and .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse17 .cse12 .cse13 .cse11) (and .cse0 .cse1 .cse14 (<= 0 (+ (* (div (* (- 1) .cse18) 18446744073709551616) 18446744073709551616) .cse18)) .cse2 .cse3 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse15 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse10 .cse12 .cse13 .cse11)))) [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L861 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L854 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2021-12-21 15:38:41,476 INFO L858 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-21 15:38:41,477 INFO L854 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L854 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L854 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2021-12-21 15:38:41,477 INFO L854 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse3 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L854 garLoopResultBuilder]: At program point L9349-2(lines 9327 9350) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse4 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (not .cse0) (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (<= 0 (+ (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616) .cse7)) .cse2 .cse4 .cse5 .cse6))) (and (<= .cse7 (* (div .cse7 18446744073709551616) 18446744073709551616)) .cse5 .cse8 .cse0 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse0 .cse6))) [2021-12-21 15:38:41,477 INFO L854 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-21 15:38:41,477 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-21 15:38:41,478 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-21 15:38:41,486 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] [2021-12-21 15:38:41,487 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:38:41,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:41,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:41,504 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:41,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:41,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:38:41 BoogieIcfgContainer [2021-12-21 15:38:41,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:38:41,518 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:38:41,518 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:38:41,518 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:38:41,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:38:07" (3/4) ... [2021-12-21 15:38:41,520 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-21 15:38:41,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-21 15:38:41,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-21 15:38:41,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-12-21 15:38:41,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2021-12-21 15:38:41,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-21 15:38:41,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-21 15:38:41,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-21 15:38:41,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-21 15:38:41,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-21 15:38:41,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-21 15:38:41,539 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2021-12-21 15:38:41,540 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-12-21 15:38:41,540 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-21 15:38:41,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-21 15:38:41,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-21 15:38:41,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-21 15:38:41,544 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-21 15:38:41,544 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-21 15:38:41,569 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2021-12-21 15:38:41,570 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) [2021-12-21 15:38:42,216 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:38:42,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:38:42,221 INFO L158 Benchmark]: Toolchain (without parser) took 38780.69ms. Allocated memory was 109.1MB in the beginning and 614.5MB in the end (delta: 505.4MB). Free memory was 71.6MB in the beginning and 248.1MB in the end (delta: -176.5MB). Peak memory consumption was 410.6MB. Max. memory is 16.1GB. [2021-12-21 15:38:42,221 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:38:42,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2291.83ms. Allocated memory was 109.1MB in the beginning and 157.3MB in the end (delta: 48.2MB). Free memory was 71.6MB in the beginning and 60.6MB in the end (delta: 10.9MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2021-12-21 15:38:42,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.19ms. Allocated memory is still 157.3MB. Free memory was 60.6MB in the beginning and 95.7MB in the end (delta: -35.1MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2021-12-21 15:38:42,225 INFO L158 Benchmark]: Boogie Preprocessor took 52.59ms. Allocated memory is still 157.3MB. Free memory was 95.7MB in the beginning and 88.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 15:38:42,227 INFO L158 Benchmark]: RCFGBuilder took 1099.65ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 88.5MB in the beginning and 181.2MB in the end (delta: -92.7MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2021-12-21 15:38:42,228 INFO L158 Benchmark]: TraceAbstraction took 34468.21ms. Allocated memory was 257.9MB in the beginning and 614.5MB in the end (delta: 356.5MB). Free memory was 181.2MB in the beginning and 358.5MB in the end (delta: -177.3MB). Peak memory consumption was 350.6MB. Max. memory is 16.1GB. [2021-12-21 15:38:42,228 INFO L158 Benchmark]: Witness Printer took 702.98ms. Allocated memory is still 614.5MB. Free memory was 358.5MB in the beginning and 248.1MB in the end (delta: 110.4MB). Peak memory consumption was 192.2MB. Max. memory is 16.1GB. [2021-12-21 15:38:42,249 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 109.1MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2291.83ms. Allocated memory was 109.1MB in the beginning and 157.3MB in the end (delta: 48.2MB). Free memory was 71.6MB in the beginning and 60.6MB in the end (delta: 10.9MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 160.19ms. Allocated memory is still 157.3MB. Free memory was 60.6MB in the beginning and 95.7MB in the end (delta: -35.1MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.59ms. Allocated memory is still 157.3MB. Free memory was 95.7MB in the beginning and 88.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1099.65ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 88.5MB in the beginning and 181.2MB in the end (delta: -92.7MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 34468.21ms. Allocated memory was 257.9MB in the beginning and 614.5MB in the end (delta: 356.5MB). Free memory was 181.2MB in the beginning and 358.5MB in the end (delta: -177.3MB). Peak memory consumption was 350.6MB. Max. memory is 16.1GB. * Witness Printer took 702.98ms. Allocated memory is still 614.5MB. Free memory was 358.5MB in the beginning and 248.1MB in the end (delta: 110.4MB). Peak memory consumption was 192.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.4s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2307 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2170 mSDsluCounter, 19433 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 428 IncrementalHoareTripleChecker+Unchecked, 15879 mSDsCounter, 659 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4389 IncrementalHoareTripleChecker+Invalid, 5476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 659 mSolverCounterUnsat, 3554 mSDtfsCounter, 4389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2523 GetRequests, 2103 SyntacticMatches, 34 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=7, InterpolantAutomatonStates: 218, 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, 24 MinimizatonAttempts, 320 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 483 PreInvPairs, 541 NumberOfFragments, 1539 HoareAnnotationTreeSize, 483 FomulaSimplifications, 749 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 42 FomulaSimplificationsInter, 11056 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 3303 NumberOfCodeBlocks, 3303 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3714 ConstructedInterpolants, 106 QuantifiedInterpolants, 16053 SizeOfPredicates, 117 NumberOfNonLiveVariables, 38463 ConjunctsInSsa, 313 ConjunctsInUnsatCore, 45 InterpolantComputations, 19 PerfectInterpolantSequences, 1734/2007 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: 9327]: Loop Invariant [2021-12-21 15:38:42,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:42,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:42,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:42,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2021-12-21 15:38:42,322 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