./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_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 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:15:32,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:15:32,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:15:32,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:15:32,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:15:32,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:15:32,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:15:32,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:15:32,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:15:32,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:15:32,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:15:32,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:15:32,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:15:32,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:15:32,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:15:32,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:15:32,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:15:32,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:15:32,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:15:32,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:15:32,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:15:32,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:15:32,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:15:32,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:15:32,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:15:32,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:15:32,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:15:32,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:15:32,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:15:32,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:15:32,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:15:32,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:15:32,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:15:32,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:15:32,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:15:32,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:15:32,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:15:32,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:15:32,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:15:32,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:15:32,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:15:32,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 20:15:32,647 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:15:32,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:15:32,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:15:32,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:15:32,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:15:32,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:15:32,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:15:32,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:15:32,663 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:15:32,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:15:32,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:15:32,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:15:32,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:15:32,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:15:32,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:15:32,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:15:32,665 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:15:32,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:15:32,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:15:32,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:15:32,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:15:32,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:15:32,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:15:32,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:15:32,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:15:32,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:15:32,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:15:32,667 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:15:32,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:15:32,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:15:32,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:15:32,668 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 -> 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 [2021-11-16 20:15:32,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:15:32,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:15:32,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:15:32,935 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:15:32,936 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:15:32,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2021-11-16 20:15:33,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4a75069/54f628f846994526ad0b4043dc4cb943/FLAGaec21ac2a [2021-11-16 20:15:33,753 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:15:33,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2021-11-16 20:15:33,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4a75069/54f628f846994526ad0b4043dc4cb943/FLAGaec21ac2a [2021-11-16 20:15:34,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4a75069/54f628f846994526ad0b4043dc4cb943 [2021-11-16 20:15:34,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:15:34,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:15:34,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:15:34,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:15:34,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:15:34,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:15:34" (1/1) ... [2021-11-16 20:15:34,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32401ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:34, skipping insertion in model container [2021-11-16 20:15:34,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:15:34" (1/1) ... [2021-11-16 20:15:34,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:15:34,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:15:34,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4494,4507] [2021-11-16 20:15:34,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4554,4567] [2021-11-16 20:15:34,380 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:15:34,393 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:15:35,203 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,204 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,208 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,210 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,212 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,222 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,226 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,230 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,231 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,475 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:15:35,476 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:15:35,477 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:15:35,478 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:15:35,479 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:15:35,480 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:15:35,480 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:15:35,481 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:15:35,481 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:15:35,482 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:15:35,593 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:15:35,675 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,676 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,759 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:15:35,822 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:15:35,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4494,4507] [2021-11-16 20:15:35,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4554,4567] [2021-11-16 20:15:35,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:15:35,846 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:15:35,891 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,898 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,900 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,900 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,901 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,913 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,916 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,917 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,918 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:35,966 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:15:35,966 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:15:35,967 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:15:35,967 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:15:35,968 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:15:35,968 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:15:35,969 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:15:35,969 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:15:35,970 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:15:35,970 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:15:36,002 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:15:36,065 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:36,066 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:15:36,137 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:15:36,306 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:15:36,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36 WrapperNode [2021-11-16 20:15:36,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:15:36,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:15:36,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:15:36,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:15:36,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,457 INFO L137 Inliner]: procedures = 693, calls = 2679, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 968 [2021-11-16 20:15:36,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:15:36,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:15:36,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:15:36,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:15:36,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:15:36,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:15:36,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:15:36,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:15:36,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (1/1) ... [2021-11-16 20:15:36,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:15:36,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:36,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 20:15:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 20:15:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-11-16 20:15:36,650 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-11-16 20:15:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:15:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:15:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:15:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:15:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:15:36,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:15:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:15:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:15:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:15:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_buf_has_allocated_buffer_member [2021-11-16 20:15:36,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_buf_has_allocated_buffer_member [2021-11-16 20:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:15:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:15:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 20:15:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 20:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:15:36,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:15:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:15:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:15:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:15:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 20:15:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 20:15:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_bounded [2021-11-16 20:15:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_bounded [2021-11-16 20:15:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:15:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2021-11-16 20:15:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2021-11-16 20:15:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2021-11-16 20:15:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2021-11-16 20:15:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:15:36,961 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:15:36,962 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:15:38,232 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:15:38,238 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:15:38,239 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-16 20:15:38,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:15:38 BoogieIcfgContainer [2021-11-16 20:15:38,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:15:38,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:15:38,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:15:38,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:15:38,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:15:34" (1/3) ... [2021-11-16 20:15:38,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f59ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:15:38, skipping insertion in model container [2021-11-16 20:15:38,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:15:36" (2/3) ... [2021-11-16 20:15:38,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f59ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:15:38, skipping insertion in model container [2021-11-16 20:15:38,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:15:38" (3/3) ... [2021-11-16 20:15:38,249 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_advance_harness.i [2021-11-16 20:15:38,253 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:15:38,254 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:15:38,296 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:15:38,302 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 20:15:38,302 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:15:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2021-11-16 20:15:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-16 20:15:38,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:38,333 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:38,333 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1247030305, now seen corresponding path program 1 times [2021-11-16 20:15:38,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:38,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065786989] [2021-11-16 20:15:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:38,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:38,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:38,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 20:15:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:15:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:15:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 20:15:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-16 20:15:39,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:39,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065786989] [2021-11-16 20:15:39,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065786989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:39,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:15:39,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 20:15:39,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272978730] [2021-11-16 20:15:39,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:39,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:15:39,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:15:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-16 20:15:39,163 INFO L87 Difference]: Start difference. First operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 20:15:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:39,624 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2021-11-16 20:15:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 20:15:39,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2021-11-16 20:15:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:39,636 INFO L225 Difference]: With dead ends: 349 [2021-11-16 20:15:39,636 INFO L226 Difference]: Without dead ends: 175 [2021-11-16 20:15:39,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-16 20:15:39,644 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 119 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:39,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 278 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 20:15:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-16 20:15:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2021-11-16 20:15:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 101 states have (on average 1.198019801980198) internal successors, (121), 102 states have internal predecessors, (121), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-16 20:15:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2021-11-16 20:15:39,693 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 89 [2021-11-16 20:15:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:39,694 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2021-11-16 20:15:39,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 20:15:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2021-11-16 20:15:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-16 20:15:39,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:39,699 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 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] [2021-11-16 20:15:39,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 20:15:39,699 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1477386906, now seen corresponding path program 1 times [2021-11-16 20:15:39,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:39,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943211115] [2021-11-16 20:15:39,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:39,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 20:15:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:15:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:15:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 20:15:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 20:15:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 20:15:40,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:40,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943211115] [2021-11-16 20:15:40,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943211115] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:40,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124010596] [2021-11-16 20:15:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:40,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:40,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:40,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:15:40,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 20:15:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:40,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:15:40,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 20:15:40,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:40,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124010596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:40,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:40,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-11-16 20:15:40,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355790901] [2021-11-16 20:15:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:40,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:15:40,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:15:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:15:40,923 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:15:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:41,347 INFO L93 Difference]: Finished difference Result 332 states and 462 transitions. [2021-11-16 20:15:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:15:41,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 96 [2021-11-16 20:15:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:41,351 INFO L225 Difference]: With dead ends: 332 [2021-11-16 20:15:41,351 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:15:41,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:15:41,353 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 259 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:41,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 590 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:15:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:15:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:15:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (63), 54 states have call predecessors, (63), 54 states have call successors, (63) [2021-11-16 20:15:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2021-11-16 20:15:41,372 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 96 [2021-11-16 20:15:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:41,373 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2021-11-16 20:15:41,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:15:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2021-11-16 20:15:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-16 20:15:41,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:41,376 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:41,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 20:15:41,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:41,604 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:41,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1893468965, now seen corresponding path program 1 times [2021-11-16 20:15:41,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:41,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756544373] [2021-11-16 20:15:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:41,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:15:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:15:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:42,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 20:15:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 20:15:42,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:42,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756544373] [2021-11-16 20:15:42,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756544373] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:42,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856493406] [2021-11-16 20:15:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:42,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:42,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:15:42,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 20:15:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:42,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:15:42,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-16 20:15:42,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:42,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856493406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:42,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:42,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-11-16 20:15:42,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13315788] [2021-11-16 20:15:42,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:42,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:15:42,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:15:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:15:42,825 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:15:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:43,227 INFO L93 Difference]: Finished difference Result 293 states and 416 transitions. [2021-11-16 20:15:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:15:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 102 [2021-11-16 20:15:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:43,230 INFO L225 Difference]: With dead ends: 293 [2021-11-16 20:15:43,230 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:15:43,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:15:43,232 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 299 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:43,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 713 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:15:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:15:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:15:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2021-11-16 20:15:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 238 transitions. [2021-11-16 20:15:43,254 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 238 transitions. Word has length 102 [2021-11-16 20:15:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:43,255 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 238 transitions. [2021-11-16 20:15:43,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:15:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 238 transitions. [2021-11-16 20:15:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-16 20:15:43,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:43,262 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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] [2021-11-16 20:15:43,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-16 20:15:43,487 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,SelfDestructingSolverStorable2 [2021-11-16 20:15:43,488 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1871994096, now seen corresponding path program 2 times [2021-11-16 20:15:43,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:43,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037222109] [2021-11-16 20:15:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:43,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:15:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:15:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:15:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-11-16 20:15:43,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:43,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037222109] [2021-11-16 20:15:43,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037222109] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:43,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472865877] [2021-11-16 20:15:43,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:15:43,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:43,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:43,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:15:43,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 20:15:44,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-16 20:15:44,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:15:44,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 2326 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:15:44,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:15:44,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:15:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-11-16 20:15:45,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472865877] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:45,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:15:45,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2021-11-16 20:15:45,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10044064] [2021-11-16 20:15:45,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:45,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:15:45,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:15:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:15:45,005 INFO L87 Difference]: Start difference. First operand 171 states and 238 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:15:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:45,139 INFO L93 Difference]: Finished difference Result 256 states and 358 transitions. [2021-11-16 20:15:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:15:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 108 [2021-11-16 20:15:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:45,141 INFO L225 Difference]: With dead ends: 256 [2021-11-16 20:15:45,142 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:15:45,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:15:45,143 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 229 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:45,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 814 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:15:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:15:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:15:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2021-11-16 20:15:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 237 transitions. [2021-11-16 20:15:45,170 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 237 transitions. Word has length 108 [2021-11-16 20:15:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:45,170 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 237 transitions. [2021-11-16 20:15:45,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:15:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 237 transitions. [2021-11-16 20:15:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-16 20:15:45,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:45,172 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:45,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-16 20:15:45,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:45,388 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -225220613, now seen corresponding path program 3 times [2021-11-16 20:15:45,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:45,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890267782] [2021-11-16 20:15:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:45,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:15:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:15:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:15:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:15:45,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:45,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890267782] [2021-11-16 20:15:45,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890267782] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:45,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972256505] [2021-11-16 20:15:45,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-16 20:15:45,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:45,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:45,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-11-16 20:15:45,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 20:15:46,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-16 20:15:46,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:15:46,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 2343 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-16 20:15:46,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:46,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:15:46,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:15:46,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:15:46,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2021-11-16 20:15:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:15:46,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:46,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972256505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:46,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:46,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2021-11-16 20:15:46,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108795648] [2021-11-16 20:15:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:46,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:15:46,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:46,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:15:46,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:15:46,973 INFO L87 Difference]: Start difference. First operand 171 states and 237 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:15:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:47,038 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2021-11-16 20:15:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:15:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2021-11-16 20:15:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:47,043 INFO L225 Difference]: With dead ends: 282 [2021-11-16 20:15:47,045 INFO L226 Difference]: Without dead ends: 190 [2021-11-16 20:15:47,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:15:47,048 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 37 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:47,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 722 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 59 Unchecked, 0.0s Time] [2021-11-16 20:15:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-16 20:15:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2021-11-16 20:15:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 121 states have internal predecessors, (142), 56 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (61), 54 states have call predecessors, (61), 55 states have call successors, (61) [2021-11-16 20:15:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 259 transitions. [2021-11-16 20:15:47,071 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 259 transitions. Word has length 114 [2021-11-16 20:15:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:47,072 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 259 transitions. [2021-11-16 20:15:47,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:15:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 259 transitions. [2021-11-16 20:15:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-16 20:15:47,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:47,074 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:47,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 20:15:47,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:47,295 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:47,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -812026627, now seen corresponding path program 1 times [2021-11-16 20:15:47,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:47,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40483568] [2021-11-16 20:15:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:47,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:15:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:15:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:15:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:15:47,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:47,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40483568] [2021-11-16 20:15:47,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40483568] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:47,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034241306] [2021-11-16 20:15:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:47,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:47,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:47,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:15:47,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 20:15:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 2656 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:15:48,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-11-16 20:15:48,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:48,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034241306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:48,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:48,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-16 20:15:48,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112177737] [2021-11-16 20:15:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:48,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:15:48,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:15:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:15:48,243 INFO L87 Difference]: Start difference. First operand 188 states and 259 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:48,281 INFO L93 Difference]: Finished difference Result 393 states and 553 transitions. [2021-11-16 20:15:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:15:48,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2021-11-16 20:15:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:48,285 INFO L225 Difference]: With dead ends: 393 [2021-11-16 20:15:48,286 INFO L226 Difference]: Without dead ends: 212 [2021-11-16 20:15:48,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:15:48,289 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 28 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:48,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 718 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:15:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-16 20:15:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2021-11-16 20:15:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 123 states have internal predecessors, (143), 56 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (61), 54 states have call predecessors, (61), 55 states have call successors, (61) [2021-11-16 20:15:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2021-11-16 20:15:48,314 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 114 [2021-11-16 20:15:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:48,316 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2021-11-16 20:15:48,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2021-11-16 20:15:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-16 20:15:48,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:48,318 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:48,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 20:15:48,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:48,540 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -110962049, now seen corresponding path program 1 times [2021-11-16 20:15:48,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:48,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936266728] [2021-11-16 20:15:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:48,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:15:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:15:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:15:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:15:48,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:48,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936266728] [2021-11-16 20:15:48,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936266728] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:48,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641059849] [2021-11-16 20:15:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:48,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:48,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:48,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:15:48,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 20:15:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:15:49,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-16 20:15:49,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:49,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641059849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:49,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:49,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-16 20:15:49,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190173796] [2021-11-16 20:15:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:49,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:15:49,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:15:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:15:49,452 INFO L87 Difference]: Start difference. First operand 190 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:49,485 INFO L93 Difference]: Finished difference Result 381 states and 533 transitions. [2021-11-16 20:15:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:15:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2021-11-16 20:15:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:49,487 INFO L225 Difference]: With dead ends: 381 [2021-11-16 20:15:49,487 INFO L226 Difference]: Without dead ends: 198 [2021-11-16 20:15:49,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:15:49,489 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 20 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 682 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-11-16 20:15:49,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 682 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:15:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-16 20:15:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2021-11-16 20:15:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 115 states have internal predecessors, (135), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (60), 54 states have call predecessors, (60), 55 states have call successors, (60) [2021-11-16 20:15:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2021-11-16 20:15:49,500 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 251 transitions. Word has length 114 [2021-11-16 20:15:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:49,501 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-11-16 20:15:49,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2021-11-16 20:15:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-16 20:15:49,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:49,503 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:49,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 20:15:49,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:49,720 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2075601977, now seen corresponding path program 1 times [2021-11-16 20:15:49,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:49,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115653214] [2021-11-16 20:15:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:49,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:15:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:15:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:15:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:15:49,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:49,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115653214] [2021-11-16 20:15:49,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115653214] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:49,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203932619] [2021-11-16 20:15:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:49,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:49,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:49,985 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:15:50,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 20:15:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:50,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:15:50,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-16 20:15:50,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:50,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203932619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:50,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:50,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-11-16 20:15:50,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847768164] [2021-11-16 20:15:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:50,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:15:50,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:15:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:15:50,708 INFO L87 Difference]: Start difference. First operand 182 states and 251 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:15:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:51,028 INFO L93 Difference]: Finished difference Result 324 states and 450 transitions. [2021-11-16 20:15:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:15:51,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 114 [2021-11-16 20:15:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:51,030 INFO L225 Difference]: With dead ends: 324 [2021-11-16 20:15:51,031 INFO L226 Difference]: Without dead ends: 179 [2021-11-16 20:15:51,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:15:51,032 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 298 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:51,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 575 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:15:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-16 20:15:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-11-16 20:15:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 112 states have internal predecessors, (132), 56 states have call successors, (56), 12 states have call predecessors, (56), 11 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2021-11-16 20:15:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2021-11-16 20:15:51,046 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 114 [2021-11-16 20:15:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:51,047 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2021-11-16 20:15:51,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:15:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2021-11-16 20:15:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-16 20:15:51,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:51,049 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-16 20:15:51,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 20:15:51,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:51,267 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:51,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1603675154, now seen corresponding path program 1 times [2021-11-16 20:15:51,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:51,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256879876] [2021-11-16 20:15:51,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:51,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:15:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 20:15:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:15:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-11-16 20:15:51,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:51,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256879876] [2021-11-16 20:15:51,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256879876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:51,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:15:51,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:15:51,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843596947] [2021-11-16 20:15:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:51,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:15:51,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:15:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:15:51,674 INFO L87 Difference]: Start difference. First operand 179 states and 243 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:52,380 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2021-11-16 20:15:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:15:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2021-11-16 20:15:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:52,382 INFO L225 Difference]: With dead ends: 198 [2021-11-16 20:15:52,382 INFO L226 Difference]: Without dead ends: 196 [2021-11-16 20:15:52,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:15:52,383 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 141 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:52,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 1270 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 20:15:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-16 20:15:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2021-11-16 20:15:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 119 states have internal predecessors, (138), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (67), 55 states have call predecessors, (67), 56 states have call successors, (67) [2021-11-16 20:15:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2021-11-16 20:15:52,395 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 120 [2021-11-16 20:15:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:52,395 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2021-11-16 20:15:52,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2021-11-16 20:15:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:15:52,397 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:52,397 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:52,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 20:15:52,398 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:52,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1437147720, now seen corresponding path program 1 times [2021-11-16 20:15:52,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:52,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6666055] [2021-11-16 20:15:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:52,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:15:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 20:15:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:15:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-16 20:15:52,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:52,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6666055] [2021-11-16 20:15:52,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6666055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:52,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:15:52,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 20:15:52,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420233768] [2021-11-16 20:15:52,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:52,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:15:52,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:52,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:15:52,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:15:52,870 INFO L87 Difference]: Start difference. First operand 188 states and 262 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:54,290 INFO L93 Difference]: Finished difference Result 395 states and 567 transitions. [2021-11-16 20:15:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:15:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2021-11-16 20:15:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:54,293 INFO L225 Difference]: With dead ends: 395 [2021-11-16 20:15:54,293 INFO L226 Difference]: Without dead ends: 214 [2021-11-16 20:15:54,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:15:54,295 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 194 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:54,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 628 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-16 20:15:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-11-16 20:15:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 191. [2021-11-16 20:15:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.175) internal successors, (141), 122 states have internal predecessors, (141), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (67), 55 states have call predecessors, (67), 56 states have call successors, (67) [2021-11-16 20:15:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 265 transitions. [2021-11-16 20:15:54,310 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 265 transitions. Word has length 124 [2021-11-16 20:15:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:54,311 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 265 transitions. [2021-11-16 20:15:54,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:15:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 265 transitions. [2021-11-16 20:15:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:15:54,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:54,313 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:54,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-16 20:15:54,313 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1178982282, now seen corresponding path program 1 times [2021-11-16 20:15:54,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:54,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576233902] [2021-11-16 20:15:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:54,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:15:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 20:15:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:15:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:15:54,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:54,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576233902] [2021-11-16 20:15:54,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576233902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:54,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:15:54,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:15:54,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697766189] [2021-11-16 20:15:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:54,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:15:54,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:15:54,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:15:54,757 INFO L87 Difference]: Start difference. First operand 191 states and 265 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:15:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:55,996 INFO L93 Difference]: Finished difference Result 356 states and 516 transitions. [2021-11-16 20:15:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:15:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2021-11-16 20:15:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:55,999 INFO L225 Difference]: With dead ends: 356 [2021-11-16 20:15:55,999 INFO L226 Difference]: Without dead ends: 261 [2021-11-16 20:15:56,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:15:56,001 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 248 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:56,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 994 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 20:15:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-16 20:15:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 201. [2021-11-16 20:15:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 132 states have internal predecessors, (151), 57 states have call successors, (57), 13 states have call predecessors, (57), 14 states have return successors, (78), 55 states have call predecessors, (78), 56 states have call successors, (78) [2021-11-16 20:15:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2021-11-16 20:15:56,016 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 124 [2021-11-16 20:15:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:56,017 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2021-11-16 20:15:56,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:15:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2021-11-16 20:15:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:15:56,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:56,019 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:56,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 20:15:56,019 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1836121336, now seen corresponding path program 1 times [2021-11-16 20:15:56,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:56,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156429361] [2021-11-16 20:15:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:56,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:15:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 20:15:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:15:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:15:56,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:56,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156429361] [2021-11-16 20:15:56,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156429361] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:56,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758861587] [2021-11-16 20:15:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:56,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:56,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:15:56,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 20:15:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:57,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 2678 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-16 20:15:57,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:57,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:15:57,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:15:57,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:15:57,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2021-11-16 20:15:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-16 20:15:57,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:57,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758861587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:57,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:57,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2021-11-16 20:15:57,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564790172] [2021-11-16 20:15:57,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:57,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:15:57,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:15:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-11-16 20:15:57,946 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:15:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:15:58,020 INFO L93 Difference]: Finished difference Result 316 states and 444 transitions. [2021-11-16 20:15:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:15:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2021-11-16 20:15:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:15:58,022 INFO L225 Difference]: With dead ends: 316 [2021-11-16 20:15:58,022 INFO L226 Difference]: Without dead ends: 208 [2021-11-16 20:15:58,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-11-16 20:15:58,024 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 13 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:15:58,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 856 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2021-11-16 20:15:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-16 20:15:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2021-11-16 20:15:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.164179104477612) internal successors, (156), 137 states have internal predecessors, (156), 57 states have call successors, (57), 13 states have call predecessors, (57), 14 states have return successors, (78), 55 states have call predecessors, (78), 56 states have call successors, (78) [2021-11-16 20:15:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2021-11-16 20:15:58,038 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 124 [2021-11-16 20:15:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:15:58,038 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2021-11-16 20:15:58,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:15:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2021-11-16 20:15:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:15:58,040 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:15:58,040 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:15:58,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-16 20:15:58,247 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,SelfDestructingSolverStorable11 [2021-11-16 20:15:58,248 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:15:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:15:58,248 INFO L85 PathProgramCache]: Analyzing trace with hash -10392004, now seen corresponding path program 1 times [2021-11-16 20:15:58,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:15:58,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616582369] [2021-11-16 20:15:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:58,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:15:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:15:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:15:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:15:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:15:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:15:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:15:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:15:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:15:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:15:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:15:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:15:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:15:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 20:15:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:15:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:15:58,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:15:58,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616582369] [2021-11-16 20:15:58,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616582369] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:15:58,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905610016] [2021-11-16 20:15:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:15:58,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:15:58,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:15:58,959 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-11-16 20:15:58,960 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-11-16 20:15:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:15:59,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 2680 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-16 20:15:59,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:15:59,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:15:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-16 20:15:59,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:15:59,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905610016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:15:59,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:15:59,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 25 [2021-11-16 20:15:59,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714668529] [2021-11-16 20:15:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:15:59,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:15:59,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:15:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:15:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:15:59,999 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2021-11-16 20:16:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:00,419 INFO L93 Difference]: Finished difference Result 422 states and 588 transitions. [2021-11-16 20:16:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:16:00,419 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 124 [2021-11-16 20:16:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:00,421 INFO L225 Difference]: With dead ends: 422 [2021-11-16 20:16:00,421 INFO L226 Difference]: Without dead ends: 219 [2021-11-16 20:16:00,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-11-16 20:16:00,423 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 75 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:00,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 1338 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2021-11-16 20:16:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-16 20:16:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2021-11-16 20:16:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 143 states have internal predecessors, (165), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (77), 55 states have call predecessors, (77), 56 states have call successors, (77) [2021-11-16 20:16:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2021-11-16 20:16:00,438 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 124 [2021-11-16 20:16:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:00,439 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2021-11-16 20:16:00,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2021-11-16 20:16:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2021-11-16 20:16:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-16 20:16:00,441 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:00,441 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:00,475 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-11-16 20:16:00,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-16 20:16:00,656 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1190017078, now seen corresponding path program 1 times [2021-11-16 20:16:00,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:00,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949451496] [2021-11-16 20:16:00,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:00,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 20:16:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 20:16:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 20:16:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-16 20:16:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-16 20:16:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 20:16:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 20:16:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-16 20:16:00,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:00,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949451496] [2021-11-16 20:16:00,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949451496] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:00,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299307255] [2021-11-16 20:16:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:00,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:00,969 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-11-16 20:16:00,971 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-11-16 20:16:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:01,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 2687 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:16:01,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-16 20:16:01,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:01,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299307255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:01,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:01,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2021-11-16 20:16:01,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166867543] [2021-11-16 20:16:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:01,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:16:01,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:16:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:16:01,615 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:16:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:01,765 INFO L93 Difference]: Finished difference Result 422 states and 608 transitions. [2021-11-16 20:16:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:16:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2021-11-16 20:16:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:01,768 INFO L225 Difference]: With dead ends: 422 [2021-11-16 20:16:01,768 INFO L226 Difference]: Without dead ends: 223 [2021-11-16 20:16:01,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:16:01,769 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 12 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:01,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1758 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:16:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-16 20:16:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-11-16 20:16:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 149 states have (on average 1.1610738255033557) internal successors, (173), 153 states have internal predecessors, (173), 57 states have call successors, (57), 14 states have call predecessors, (57), 16 states have return successors, (98), 55 states have call predecessors, (98), 56 states have call successors, (98) [2021-11-16 20:16:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 328 transitions. [2021-11-16 20:16:01,785 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 328 transitions. Word has length 128 [2021-11-16 20:16:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:01,785 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 328 transitions. [2021-11-16 20:16:01,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:16:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2021-11-16 20:16:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 20:16:01,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:01,788 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:01,821 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-11-16 20:16:02,003 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-11-16 20:16:02,003 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:02,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1380691087, now seen corresponding path program 1 times [2021-11-16 20:16:02,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:02,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178770970] [2021-11-16 20:16:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:02,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 20:16:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 20:16:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-16 20:16:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-11-16 20:16:02,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:02,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178770970] [2021-11-16 20:16:02,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178770970] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:02,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283150582] [2021-11-16 20:16:02,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:02,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:02,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:02,206 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-11-16 20:16:02,207 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-11-16 20:16:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:02,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 2692 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:16:02,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-16 20:16:02,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:02,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283150582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:02,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:02,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-11-16 20:16:02,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274754125] [2021-11-16 20:16:02,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:02,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:16:02,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:16:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:16:02,838 INFO L87 Difference]: Start difference. First operand 223 states and 328 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:02,871 INFO L93 Difference]: Finished difference Result 430 states and 646 transitions. [2021-11-16 20:16:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:16:02,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2021-11-16 20:16:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:02,874 INFO L225 Difference]: With dead ends: 430 [2021-11-16 20:16:02,874 INFO L226 Difference]: Without dead ends: 210 [2021-11-16 20:16:02,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:16:02,876 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:02,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 672 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:16:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-16 20:16:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204. [2021-11-16 20:16:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 135 states have internal predecessors, (150), 57 states have call successors, (57), 13 states have call predecessors, (57), 15 states have return successors, (87), 55 states have call predecessors, (87), 56 states have call successors, (87) [2021-11-16 20:16:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2021-11-16 20:16:02,890 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 130 [2021-11-16 20:16:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:02,890 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2021-11-16 20:16:02,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2021-11-16 20:16:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 20:16:02,892 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:02,892 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-16 20:16:02,923 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-11-16 20:16:03,107 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,SelfDestructingSolverStorable14 [2021-11-16 20:16:03,107 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2037534571, now seen corresponding path program 1 times [2021-11-16 20:16:03,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:03,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673781617] [2021-11-16 20:16:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:03,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 20:16:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 20:16:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-16 20:16:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-11-16 20:16:03,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:03,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673781617] [2021-11-16 20:16:03,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673781617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:03,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905428765] [2021-11-16 20:16:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:03,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:03,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:03,820 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-11-16 20:16:03,821 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-11-16 20:16:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:04,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-16 20:16:04,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:04,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:16:04,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:04,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2021-11-16 20:16:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:04,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2021-11-16 20:16:04,743 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:16:04,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-11-16 20:16:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-16 20:16:05,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:05,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905428765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:05,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:05,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 28 [2021-11-16 20:16:05,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680193027] [2021-11-16 20:16:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:05,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 20:16:05,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:05,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 20:16:05,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2021-11-16 20:16:05,292 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-11-16 20:16:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:06,650 INFO L93 Difference]: Finished difference Result 513 states and 769 transitions. [2021-11-16 20:16:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 20:16:06,650 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 130 [2021-11-16 20:16:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:06,653 INFO L225 Difference]: With dead ends: 513 [2021-11-16 20:16:06,653 INFO L226 Difference]: Without dead ends: 361 [2021-11-16 20:16:06,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 137 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-11-16 20:16:06,655 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 89 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:06,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 1922 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 264 Invalid, 0 Unknown, 116 Unchecked, 1.3s Time] [2021-11-16 20:16:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-11-16 20:16:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 267. [2021-11-16 20:16:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 179 states have (on average 1.1508379888268156) internal successors, (206), 184 states have internal predecessors, (206), 67 states have call successors, (67), 17 states have call predecessors, (67), 20 states have return successors, (106), 65 states have call predecessors, (106), 66 states have call successors, (106) [2021-11-16 20:16:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 379 transitions. [2021-11-16 20:16:06,676 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 379 transitions. Word has length 130 [2021-11-16 20:16:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:06,677 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 379 transitions. [2021-11-16 20:16:06,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-11-16 20:16:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 379 transitions. [2021-11-16 20:16:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 20:16:06,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:06,679 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-16 20:16:06,710 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-11-16 20:16:06,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-16 20:16:06,908 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash 78959785, now seen corresponding path program 1 times [2021-11-16 20:16:06,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:06,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067291139] [2021-11-16 20:16:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:06,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 20:16:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 20:16:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-16 20:16:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-16 20:16:07,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:07,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067291139] [2021-11-16 20:16:07,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067291139] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:07,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903804408] [2021-11-16 20:16:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:07,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:07,859 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-11-16 20:16:07,861 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-11-16 20:16:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:08,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 2694 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-16 20:16:08,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:08,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:16:08,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:08,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2021-11-16 20:16:08,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:08,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2021-11-16 20:16:08,857 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:16:08,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-11-16 20:16:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-16 20:16:09,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:09,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903804408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:09,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:09,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [20] total 33 [2021-11-16 20:16:09,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003751464] [2021-11-16 20:16:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:09,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 20:16:09,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 20:16:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2021-11-16 20:16:09,532 INFO L87 Difference]: Start difference. First operand 267 states and 379 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-11-16 20:16:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:10,459 INFO L93 Difference]: Finished difference Result 596 states and 855 transitions. [2021-11-16 20:16:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 20:16:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 130 [2021-11-16 20:16:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:10,463 INFO L225 Difference]: With dead ends: 596 [2021-11-16 20:16:10,463 INFO L226 Difference]: Without dead ends: 444 [2021-11-16 20:16:10,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 136 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2021-11-16 20:16:10,465 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 89 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:10,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1639 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 88 Unchecked, 0.8s Time] [2021-11-16 20:16:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-16 20:16:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 357. [2021-11-16 20:16:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 255 states have (on average 1.1607843137254903) internal successors, (296), 265 states have internal predecessors, (296), 73 states have call successors, (73), 22 states have call predecessors, (73), 28 states have return successors, (118), 69 states have call predecessors, (118), 72 states have call successors, (118) [2021-11-16 20:16:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 487 transitions. [2021-11-16 20:16:10,503 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 487 transitions. Word has length 130 [2021-11-16 20:16:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:10,503 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 487 transitions. [2021-11-16 20:16:10,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2021-11-16 20:16:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 487 transitions. [2021-11-16 20:16:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-16 20:16:10,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:10,506 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:10,541 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-11-16 20:16:10,719 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,SelfDestructingSolverStorable16 [2021-11-16 20:16:10,719 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash -34334491, now seen corresponding path program 2 times [2021-11-16 20:16:10,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:10,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632671397] [2021-11-16 20:16:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:10,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:10,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:16:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:16:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 20:16:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-16 20:16:11,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:11,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632671397] [2021-11-16 20:16:11,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632671397] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:11,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192401265] [2021-11-16 20:16:11,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:16:11,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:11,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:11,081 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-11-16 20:16:11,082 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-11-16 20:16:11,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-16 20:16:11,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:16:11,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 2347 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-16 20:16:11,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:11,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:11,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:11,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:11,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2021-11-16 20:16:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-16 20:16:12,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:12,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192401265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:12,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:12,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-11-16 20:16:12,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721413407] [2021-11-16 20:16:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:12,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:16:12,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:16:12,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:16:12,083 INFO L87 Difference]: Start difference. First operand 357 states and 487 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:12,116 INFO L93 Difference]: Finished difference Result 487 states and 663 transitions. [2021-11-16 20:16:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:16:12,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2021-11-16 20:16:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:12,119 INFO L225 Difference]: With dead ends: 487 [2021-11-16 20:16:12,119 INFO L226 Difference]: Without dead ends: 374 [2021-11-16 20:16:12,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:16:12,121 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 17 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:12,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1257 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2021-11-16 20:16:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-11-16 20:16:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2021-11-16 20:16:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 264 states have (on average 1.1628787878787878) internal successors, (307), 273 states have internal predecessors, (307), 73 states have call successors, (73), 23 states have call predecessors, (73), 28 states have return successors, (108), 69 states have call predecessors, (108), 72 states have call successors, (108) [2021-11-16 20:16:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 488 transitions. [2021-11-16 20:16:12,140 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 488 transitions. Word has length 134 [2021-11-16 20:16:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:12,141 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 488 transitions. [2021-11-16 20:16:12,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 488 transitions. [2021-11-16 20:16:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-16 20:16:12,144 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:12,144 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:12,172 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-11-16 20:16:12,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:12,371 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash 223830947, now seen corresponding path program 3 times [2021-11-16 20:16:12,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:12,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902918541] [2021-11-16 20:16:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:12,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:16:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:16:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 20:16:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-16 20:16:12,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:12,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902918541] [2021-11-16 20:16:12,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902918541] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:12,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756609611] [2021-11-16 20:16:12,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-16 20:16:12,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:12,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:12,715 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-11-16 20:16:12,744 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-11-16 20:16:13,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-16 20:16:13,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:16:13,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 2342 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:16:13,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-11-16 20:16:13,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:13,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756609611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:13,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:13,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2021-11-16 20:16:13,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626991922] [2021-11-16 20:16:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:13,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:16:13,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:16:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:16:13,332 INFO L87 Difference]: Start difference. First operand 366 states and 488 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:16:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:14,225 INFO L93 Difference]: Finished difference Result 679 states and 922 transitions. [2021-11-16 20:16:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:16:14,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2021-11-16 20:16:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:14,228 INFO L225 Difference]: With dead ends: 679 [2021-11-16 20:16:14,228 INFO L226 Difference]: Without dead ends: 379 [2021-11-16 20:16:14,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:16:14,230 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 24 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:14,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 804 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 49 Unchecked, 0.8s Time] [2021-11-16 20:16:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-11-16 20:16:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 364. [2021-11-16 20:16:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 262 states have (on average 1.1450381679389312) internal successors, (300), 271 states have internal predecessors, (300), 73 states have call successors, (73), 23 states have call predecessors, (73), 28 states have return successors, (116), 69 states have call predecessors, (116), 72 states have call successors, (116) [2021-11-16 20:16:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 489 transitions. [2021-11-16 20:16:14,250 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 489 transitions. Word has length 134 [2021-11-16 20:16:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:14,250 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 489 transitions. [2021-11-16 20:16:14,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:16:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 489 transitions. [2021-11-16 20:16:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-16 20:16:14,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:14,252 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:14,278 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-11-16 20:16:14,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:14,479 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:14,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash -984070051, now seen corresponding path program 1 times [2021-11-16 20:16:14,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:14,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4732084] [2021-11-16 20:16:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:14,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:16:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:16:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 20:16:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-16 20:16:14,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:14,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4732084] [2021-11-16 20:16:14,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4732084] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:14,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245047682] [2021-11-16 20:16:14,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:14,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:14,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:14,821 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:16:14,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-16 20:16:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:15,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:16:15,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-11-16 20:16:15,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:15,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245047682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:15,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:15,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2021-11-16 20:16:15,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983594537] [2021-11-16 20:16:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:15,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:16:15,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:16:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:16:15,473 INFO L87 Difference]: Start difference. First operand 364 states and 489 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:16:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:15,618 INFO L93 Difference]: Finished difference Result 528 states and 716 transitions. [2021-11-16 20:16:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:16:15,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2021-11-16 20:16:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:15,621 INFO L225 Difference]: With dead ends: 528 [2021-11-16 20:16:15,621 INFO L226 Difference]: Without dead ends: 369 [2021-11-16 20:16:15,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:16:15,624 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 12 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:15,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1763 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:16:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-16 20:16:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 357. [2021-11-16 20:16:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 257 states have (on average 1.1478599221789882) internal successors, (295), 264 states have internal predecessors, (295), 73 states have call successors, (73), 23 states have call predecessors, (73), 26 states have return successors, (110), 69 states have call predecessors, (110), 72 states have call successors, (110) [2021-11-16 20:16:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 478 transitions. [2021-11-16 20:16:15,649 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 478 transitions. Word has length 134 [2021-11-16 20:16:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:15,650 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 478 transitions. [2021-11-16 20:16:15,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:16:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 478 transitions. [2021-11-16 20:16:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-16 20:16:15,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:15,652 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:15,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-16 20:16:15,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:15,869 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2087607718, now seen corresponding path program 1 times [2021-11-16 20:16:15,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:15,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27144151] [2021-11-16 20:16:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:15,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 20:16:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:16:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:16:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 20:16:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 20:16:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 20:16:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-16 20:16:16,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:16,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27144151] [2021-11-16 20:16:16,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27144151] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:16,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040641524] [2021-11-16 20:16:16,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:16,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:16,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:16,647 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:16:16,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-16 20:16:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:17,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-16 20:16:17,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:17,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-16 20:16:17,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:17,557 INFO L354 Elim1Store]: treesize reduction 172, result has 12.2 percent of original size [2021-11-16 20:16:17,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 59 [2021-11-16 20:16:17,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:17,610 INFO L354 Elim1Store]: treesize reduction 262, result has 11.2 percent of original size [2021-11-16 20:16:17,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 47 [2021-11-16 20:16:17,693 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-11-16 20:16:17,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2021-11-16 20:16:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-16 20:16:17,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:17,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040641524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:17,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:17,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 25 [2021-11-16 20:16:17,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860897282] [2021-11-16 20:16:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:17,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:16:17,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:17,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:16:17,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:16:17,832 INFO L87 Difference]: Start difference. First operand 357 states and 478 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-16 20:16:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:19,046 INFO L93 Difference]: Finished difference Result 616 states and 889 transitions. [2021-11-16 20:16:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:16:19,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 137 [2021-11-16 20:16:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:19,049 INFO L225 Difference]: With dead ends: 616 [2021-11-16 20:16:19,049 INFO L226 Difference]: Without dead ends: 449 [2021-11-16 20:16:19,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2021-11-16 20:16:19,051 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 72 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:19,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 2112 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 527 Invalid, 0 Unknown, 96 Unchecked, 1.1s Time] [2021-11-16 20:16:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-16 20:16:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 373. [2021-11-16 20:16:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 270 states have (on average 1.137037037037037) internal successors, (307), 279 states have internal predecessors, (307), 73 states have call successors, (73), 24 states have call predecessors, (73), 29 states have return successors, (124), 69 states have call predecessors, (124), 72 states have call successors, (124) [2021-11-16 20:16:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2021-11-16 20:16:19,074 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 137 [2021-11-16 20:16:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:19,074 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2021-11-16 20:16:19,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-16 20:16:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2021-11-16 20:16:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-16 20:16:19,076 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:19,077 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:19,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-16 20:16:19,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:19,304 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1691174062, now seen corresponding path program 2 times [2021-11-16 20:16:19,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:19,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518243818] [2021-11-16 20:16:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:19,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 20:16:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-16 20:16:19,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:19,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518243818] [2021-11-16 20:16:19,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518243818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:19,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:16:19,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:16:19,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082659376] [2021-11-16 20:16:19,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:19,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:16:19,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:16:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:16:19,904 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:21,943 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:16:23,507 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:16:25,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:16:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:26,344 INFO L93 Difference]: Finished difference Result 531 states and 717 transitions. [2021-11-16 20:16:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:16:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2021-11-16 20:16:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:26,347 INFO L225 Difference]: With dead ends: 531 [2021-11-16 20:16:26,348 INFO L226 Difference]: Without dead ends: 420 [2021-11-16 20:16:26,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:16:26,349 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 158 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 118 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:26,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 986 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 866 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2021-11-16 20:16:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-11-16 20:16:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 376. [2021-11-16 20:16:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 273 states have (on average 1.1355311355311355) internal successors, (310), 282 states have internal predecessors, (310), 73 states have call successors, (73), 24 states have call predecessors, (73), 29 states have return successors, (124), 69 states have call predecessors, (124), 72 states have call successors, (124) [2021-11-16 20:16:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 507 transitions. [2021-11-16 20:16:26,370 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 507 transitions. Word has length 136 [2021-11-16 20:16:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:26,371 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 507 transitions. [2021-11-16 20:16:26,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 507 transitions. [2021-11-16 20:16:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-16 20:16:26,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:26,373 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:26,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-16 20:16:26,374 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1323929556, now seen corresponding path program 3 times [2021-11-16 20:16:26,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:26,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016620071] [2021-11-16 20:16:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:26,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 20:16:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-16 20:16:26,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:26,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016620071] [2021-11-16 20:16:26,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016620071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:26,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:16:26,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:16:26,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365968938] [2021-11-16 20:16:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:26,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:16:26,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:26,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:16:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:16:26,795 INFO L87 Difference]: Start difference. First operand 376 states and 507 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:28,800 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:16:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:30,282 INFO L93 Difference]: Finished difference Result 586 states and 806 transitions. [2021-11-16 20:16:30,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:16:30,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2021-11-16 20:16:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:30,285 INFO L225 Difference]: With dead ends: 586 [2021-11-16 20:16:30,285 INFO L226 Difference]: Without dead ends: 472 [2021-11-16 20:16:30,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:16:30,287 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 197 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:30,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 1274 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-11-16 20:16:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-16 20:16:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 368. [2021-11-16 20:16:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 266 states have (on average 1.1390977443609023) internal successors, (303), 274 states have internal predecessors, (303), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (114), 69 states have call predecessors, (114), 72 states have call successors, (114) [2021-11-16 20:16:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2021-11-16 20:16:30,311 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 136 [2021-11-16 20:16:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:30,311 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2021-11-16 20:16:30,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2021-11-16 20:16:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-16 20:16:30,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:30,314 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:30,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-16 20:16:30,314 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:30,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1902565441, now seen corresponding path program 1 times [2021-11-16 20:16:30,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:30,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510063033] [2021-11-16 20:16:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:30,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 20:16:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2021-11-16 20:16:30,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:30,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510063033] [2021-11-16 20:16:30,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510063033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:30,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:16:30,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-16 20:16:30,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113707510] [2021-11-16 20:16:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:30,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 20:16:30,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 20:16:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:16:30,607 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:16:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:32,089 INFO L93 Difference]: Finished difference Result 395 states and 518 transitions. [2021-11-16 20:16:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:16:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2021-11-16 20:16:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:32,092 INFO L225 Difference]: With dead ends: 395 [2021-11-16 20:16:32,092 INFO L226 Difference]: Without dead ends: 393 [2021-11-16 20:16:32,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:16:32,093 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 91 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:32,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1619 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-16 20:16:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-11-16 20:16:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 368. [2021-11-16 20:16:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 266 states have (on average 1.1390977443609023) internal successors, (303), 274 states have internal predecessors, (303), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (114), 69 states have call predecessors, (114), 72 states have call successors, (114) [2021-11-16 20:16:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2021-11-16 20:16:32,115 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 138 [2021-11-16 20:16:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:32,116 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2021-11-16 20:16:32,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 20:16:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2021-11-16 20:16:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-16 20:16:32,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:32,118 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:32,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-16 20:16:32,118 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1201500863, now seen corresponding path program 1 times [2021-11-16 20:16:32,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:32,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641544044] [2021-11-16 20:16:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:32,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:32,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 20:16:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-16 20:16:33,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:33,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641544044] [2021-11-16 20:16:33,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641544044] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:33,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143403072] [2021-11-16 20:16:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:33,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:33,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:33,020 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:16:33,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-16 20:16:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:33,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-16 20:16:33,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:33,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 103 [2021-11-16 20:16:33,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 89 [2021-11-16 20:16:33,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 75 [2021-11-16 20:16:33,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:33,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2021-11-16 20:16:35,406 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-11-16 20:16:35,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 73 [2021-11-16 20:16:35,420 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-11-16 20:16:35,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 55 [2021-11-16 20:16:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-16 20:16:35,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:16:36,514 INFO L354 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2021-11-16 20:16:36,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 102 [2021-11-16 20:16:36,530 INFO L354 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2021-11-16 20:16:36,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 91 [2021-11-16 20:16:36,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2021-11-16 20:16:36,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2021-11-16 20:16:36,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2021-11-16 20:16:36,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 130 [2021-11-16 20:16:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-11-16 20:16:37,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143403072] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:37,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:16:37,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [24, 25] total 58 [2021-11-16 20:16:37,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206379173] [2021-11-16 20:16:37,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:37,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 20:16:37,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 20:16:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3142, Unknown=0, NotChecked=0, Total=3306 [2021-11-16 20:16:37,003 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:39,042 INFO L93 Difference]: Finished difference Result 437 states and 588 transitions. [2021-11-16 20:16:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 20:16:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2021-11-16 20:16:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:39,045 INFO L225 Difference]: With dead ends: 437 [2021-11-16 20:16:39,045 INFO L226 Difference]: Without dead ends: 435 [2021-11-16 20:16:39,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=227, Invalid=4329, Unknown=0, NotChecked=0, Total=4556 [2021-11-16 20:16:39,047 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 74 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:39,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 3212 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-16 20:16:39,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-11-16 20:16:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 368. [2021-11-16 20:16:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 266 states have (on average 1.1390977443609023) internal successors, (303), 274 states have internal predecessors, (303), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (114), 69 states have call predecessors, (114), 72 states have call successors, (114) [2021-11-16 20:16:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2021-11-16 20:16:39,079 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 138 [2021-11-16 20:16:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:39,080 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2021-11-16 20:16:39,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2021-11-16 20:16:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-16 20:16:39,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:39,083 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:39,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-16 20:16:39,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:39,295 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1335514369, now seen corresponding path program 1 times [2021-11-16 20:16:39,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:39,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688262845] [2021-11-16 20:16:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:39,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 20:16:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-16 20:16:39,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:39,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688262845] [2021-11-16 20:16:39,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688262845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:39,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:16:39,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:16:39,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962119243] [2021-11-16 20:16:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:39,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:16:39,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:16:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:16:39,751 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:41,790 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:16:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:43,353 INFO L93 Difference]: Finished difference Result 533 states and 736 transitions. [2021-11-16 20:16:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:16:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2021-11-16 20:16:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:43,356 INFO L225 Difference]: With dead ends: 533 [2021-11-16 20:16:43,356 INFO L226 Difference]: Without dead ends: 427 [2021-11-16 20:16:43,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:16:43,358 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 163 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:43,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 1142 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-11-16 20:16:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-16 20:16:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 367. [2021-11-16 20:16:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 266 states have (on average 1.1390977443609023) internal successors, (303), 274 states have internal predecessors, (303), 72 states have call successors, (72), 24 states have call predecessors, (72), 28 states have return successors, (112), 68 states have call predecessors, (112), 71 states have call successors, (112) [2021-11-16 20:16:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 487 transitions. [2021-11-16 20:16:43,378 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 487 transitions. Word has length 138 [2021-11-16 20:16:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:43,379 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 487 transitions. [2021-11-16 20:16:43,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:16:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 487 transitions. [2021-11-16 20:16:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-16 20:16:43,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:43,381 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:43,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-16 20:16:43,381 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash 148730141, now seen corresponding path program 1 times [2021-11-16 20:16:43,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:43,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5864414] [2021-11-16 20:16:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:43,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 20:16:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-16 20:16:43,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:43,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5864414] [2021-11-16 20:16:43,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5864414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:43,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:16:43,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:16:43,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432595603] [2021-11-16 20:16:43,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:43,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:16:43,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:43,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:16:43,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:16:43,624 INFO L87 Difference]: Start difference. First operand 367 states and 487 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-16 20:16:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:44,459 INFO L93 Difference]: Finished difference Result 485 states and 646 transitions. [2021-11-16 20:16:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:16:44,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 142 [2021-11-16 20:16:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:44,461 INFO L225 Difference]: With dead ends: 485 [2021-11-16 20:16:44,461 INFO L226 Difference]: Without dead ends: 374 [2021-11-16 20:16:44,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:16:44,463 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 144 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:44,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 957 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 20:16:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-11-16 20:16:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 367. [2021-11-16 20:16:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 266 states have (on average 1.1353383458646618) internal successors, (302), 274 states have internal predecessors, (302), 72 states have call successors, (72), 24 states have call predecessors, (72), 28 states have return successors, (112), 68 states have call predecessors, (112), 71 states have call successors, (112) [2021-11-16 20:16:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 486 transitions. [2021-11-16 20:16:44,482 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 486 transitions. Word has length 142 [2021-11-16 20:16:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:44,483 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 486 transitions. [2021-11-16 20:16:44,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-16 20:16:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 486 transitions. [2021-11-16 20:16:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-16 20:16:44,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:44,485 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:44,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-16 20:16:44,485 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1573992648, now seen corresponding path program 1 times [2021-11-16 20:16:44,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:44,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114194743] [2021-11-16 20:16:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:44,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 20:16:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-11-16 20:16:44,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:44,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114194743] [2021-11-16 20:16:44,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114194743] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:44,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:16:44,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:16:44,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059567241] [2021-11-16 20:16:44,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:44,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:16:44,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:16:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:16:44,766 INFO L87 Difference]: Start difference. First operand 367 states and 486 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-16 20:16:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:45,972 INFO L93 Difference]: Finished difference Result 394 states and 514 transitions. [2021-11-16 20:16:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:16:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2021-11-16 20:16:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:45,975 INFO L225 Difference]: With dead ends: 394 [2021-11-16 20:16:45,975 INFO L226 Difference]: Without dead ends: 392 [2021-11-16 20:16:45,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:16:45,976 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 192 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:45,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 1294 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 20:16:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-11-16 20:16:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 372. [2021-11-16 20:16:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 269 states have (on average 1.1338289962825279) internal successors, (305), 277 states have internal predecessors, (305), 73 states have call successors, (73), 25 states have call predecessors, (73), 29 states have return successors, (113), 69 states have call predecessors, (113), 72 states have call successors, (113) [2021-11-16 20:16:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 491 transitions. [2021-11-16 20:16:45,995 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 491 transitions. Word has length 143 [2021-11-16 20:16:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:45,996 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 491 transitions. [2021-11-16 20:16:45,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-16 20:16:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 491 transitions. [2021-11-16 20:16:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-16 20:16:45,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:45,998 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:45,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-16 20:16:45,998 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash -874766962, now seen corresponding path program 1 times [2021-11-16 20:16:45,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:45,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624480281] [2021-11-16 20:16:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:45,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 20:16:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-11-16 20:16:46,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:46,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624480281] [2021-11-16 20:16:46,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624480281] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:46,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:16:46,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:16:46,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125347657] [2021-11-16 20:16:46,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:46,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:16:46,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:16:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:16:46,283 INFO L87 Difference]: Start difference. First operand 372 states and 491 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-16 20:16:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:47,156 INFO L93 Difference]: Finished difference Result 490 states and 650 transitions. [2021-11-16 20:16:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:16:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 147 [2021-11-16 20:16:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:47,159 INFO L225 Difference]: With dead ends: 490 [2021-11-16 20:16:47,159 INFO L226 Difference]: Without dead ends: 374 [2021-11-16 20:16:47,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:16:47,160 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 132 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:47,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 956 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 20:16:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-11-16 20:16:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2021-11-16 20:16:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 270 states have (on average 1.1333333333333333) internal successors, (306), 278 states have internal predecessors, (306), 73 states have call successors, (73), 25 states have call predecessors, (73), 29 states have return successors, (113), 69 states have call predecessors, (113), 72 states have call successors, (113) [2021-11-16 20:16:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 492 transitions. [2021-11-16 20:16:47,180 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 492 transitions. Word has length 147 [2021-11-16 20:16:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:47,181 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 492 transitions. [2021-11-16 20:16:47,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-11-16 20:16:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 492 transitions. [2021-11-16 20:16:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-16 20:16:47,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:47,183 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:47,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-16 20:16:47,183 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1614049972, now seen corresponding path program 1 times [2021-11-16 20:16:47,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:47,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670297801] [2021-11-16 20:16:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:47,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:16:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:16:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:16:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 20:16:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 20:16:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-11-16 20:16:47,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:47,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670297801] [2021-11-16 20:16:47,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670297801] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:47,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147222500] [2021-11-16 20:16:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:47,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:47,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:47,540 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:16:47,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-16 20:16:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:47,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-16 20:16:47,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:48,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:16:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,322 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:16:48,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 60 [2021-11-16 20:16:48,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:16:48,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,337 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-16 20:16:48,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 45 [2021-11-16 20:16:48,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:16:48,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:48,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:16:48,352 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-16 20:16:48,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 44 [2021-11-16 20:16:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-16 20:16:48,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:16:48,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147222500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:16:48,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:16:48,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [12] total 27 [2021-11-16 20:16:48,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415428258] [2021-11-16 20:16:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:16:48,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-16 20:16:48,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:16:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-16 20:16:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-11-16 20:16:48,943 INFO L87 Difference]: Start difference. First operand 373 states and 492 transitions. Second operand has 17 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2021-11-16 20:16:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:16:49,529 INFO L93 Difference]: Finished difference Result 698 states and 953 transitions. [2021-11-16 20:16:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-16 20:16:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 149 [2021-11-16 20:16:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:16:49,532 INFO L225 Difference]: With dead ends: 698 [2021-11-16 20:16:49,532 INFO L226 Difference]: Without dead ends: 471 [2021-11-16 20:16:49,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2021-11-16 20:16:49,534 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 77 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:16:49,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 2517 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 156 Unchecked, 0.5s Time] [2021-11-16 20:16:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-11-16 20:16:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 388. [2021-11-16 20:16:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 284 states have (on average 1.1267605633802817) internal successors, (320), 292 states have internal predecessors, (320), 73 states have call successors, (73), 26 states have call predecessors, (73), 30 states have return successors, (113), 69 states have call predecessors, (113), 72 states have call successors, (113) [2021-11-16 20:16:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 506 transitions. [2021-11-16 20:16:49,558 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 506 transitions. Word has length 149 [2021-11-16 20:16:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:16:49,559 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 506 transitions. [2021-11-16 20:16:49,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2021-11-16 20:16:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 506 transitions. [2021-11-16 20:16:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-16 20:16:49,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:16:49,561 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:16:49,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-16 20:16:49,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:49,783 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:16:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:16:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash -891040382, now seen corresponding path program 1 times [2021-11-16 20:16:49,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:16:49,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712211252] [2021-11-16 20:16:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:49,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:16:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:16:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:16:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:16:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 20:16:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:16:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:16:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:16:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 20:16:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 20:16:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:16:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:16:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 20:16:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 20:16:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:16:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-16 20:16:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2021-11-16 20:16:50,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:16:50,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712211252] [2021-11-16 20:16:50,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712211252] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:16:50,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930528307] [2021-11-16 20:16:50,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:16:50,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:16:50,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:16:50,200 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:16:50,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-16 20:16:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:16:50,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 2758 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-16 20:16:50,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:16:50,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-16 20:16:50,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:16:51,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:51,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2021-11-16 20:16:51,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:51,044 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-16 20:16:51,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 45 [2021-11-16 20:16:51,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:51,056 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-16 20:16:51,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2021-11-16 20:16:51,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:51,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:51,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:16:51,221 INFO L354 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2021-11-16 20:16:51,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 67 [2021-11-16 20:17:09,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:17:09,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:17:09,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:17:09,447 INFO L354 Elim1Store]: treesize reduction 80, result has 38.5 percent of original size [2021-11-16 20:17:09,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 104 [2021-11-16 20:17:09,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 86 [2021-11-16 20:17:12,000 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3| Int)) (and (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_11|)) (.cse0 (select .cse8 24)) (.cse2 (not (= (select .cse8 8) 0)))) (or (and (= .cse0 (select .cse1 24)) .cse2) (exists ((|ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_11|))) (let ((.cse7 (select .cse3 (+ 8 |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset|)))) (and (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3|))) (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| 24)) (.cse6 (= (select .cse5 8) .cse7))) (or (= (select .cse3 .cse4) (select .cse5 24)) (and .cse6 (= .cse4 0)) (and (= (+ 16 |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset|) 0) .cse6)))) (not (= .cse7 0)))))) (and (= (select .cse1 16) .cse0) .cse2)))) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_11|)))) is different from true [2021-11-16 20:17:24,394 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((aux_mod_memset_impl_~i~6_43 Int) (memset_impl_~sp~0.offset Int)) (let ((.cse0 (+ memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_memset_impl_~i~6_43 18446744073709551616)))) (and (< 9223372036854775807 aux_mod_memset_impl_~i~6_43) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_memset_impl_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_memset_impl_#in~s.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_memset_impl_#in~s.base|) .cse0)))) (< aux_mod_memset_impl_~i~6_43 18446744073709551616) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_memset_impl_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_memset_impl_#in~s.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_memset_impl_#in~s.base|) .cse0))))))) (exists ((aux_mod_memset_impl_~i~6_43 Int) (memset_impl_~sp~0.offset Int)) (let ((.cse1 (+ memset_impl_~sp~0.offset (mod aux_mod_memset_impl_~i~6_43 18446744073709551616)))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_memset_impl_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_memset_impl_#in~s.base|) .cse1 (select (select |c_#memory_$Pointer$.base| |c_memset_impl_#in~s.base|) .cse1))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_memset_impl_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_memset_impl_#in~s.base|) .cse1 (select (select |c_#memory_$Pointer$.offset| |c_memset_impl_#in~s.base|) .cse1)))) (<= aux_mod_memset_impl_~i~6_43 9223372036854775807) (<= 0 aux_mod_memset_impl_~i~6_43))))) is different from true [2021-11-16 20:17:26,577 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((aux_mod_memset_impl_~i~6_43 Int) (memset_impl_~sp~0.offset Int)) (let ((.cse0 (+ memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_memset_impl_~i~6_43 18446744073709551616)))) (and (< 9223372036854775807 aux_mod_memset_impl_~i~6_43) (< aux_mod_memset_impl_~i~6_43 18446744073709551616) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_my_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_my_memset_#in~s.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_my_memset_#in~s.base|) .cse0)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_my_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_my_memset_#in~s.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_my_memset_#in~s.base|) .cse0))))))) (exists ((aux_mod_memset_impl_~i~6_43 Int) (memset_impl_~sp~0.offset Int)) (let ((.cse1 (+ memset_impl_~sp~0.offset (mod aux_mod_memset_impl_~i~6_43 18446744073709551616)))) (and (<= aux_mod_memset_impl_~i~6_43 9223372036854775807) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_my_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_my_memset_#in~s.base|) .cse1 (select (select |c_#memory_$Pointer$.offset| |c_my_memset_#in~s.base|) .cse1)))) (<= 0 aux_mod_memset_impl_~i~6_43) (= (store |c_old(#memory_$Pointer$.base)| |c_my_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_my_memset_#in~s.base|) .cse1 (select (select |c_#memory_$Pointer$.base| |c_my_memset_#in~s.base|) .cse1))) |c_#memory_$Pointer$.base|))))) is different from true [2021-11-16 20:17:26,718 INFO L354 Elim1Store]: treesize reduction 95, result has 16.7 percent of original size [2021-11-16 20:17:26,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 167 [2021-11-16 20:17:26,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:17:26,834 INFO L354 Elim1Store]: treesize reduction 368, result has 22.9 percent of original size [2021-11-16 20:17:26,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 167 treesize of output 251 [2021-11-16 20:17:27,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2021-11-16 20:17:27,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2021-11-16 20:17:30,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:17:30,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:17:30,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 111 [2021-11-16 20:17:30,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:17:30,976 INFO L354 Elim1Store]: treesize reduction 14, result has 67.4 percent of original size [2021-11-16 20:17:30,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 112 [2021-11-16 20:17:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 39 proven. 94 refuted. 5 times theorem prover too weak. 16 trivial. 4 not checked. [2021-11-16 20:17:41,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:17:41,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-16 20:17:41,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:17:41,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-11-16 20:17:41,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468809899] [2021-11-16 20:17:41,979 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-16 20:17:41,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:17:41,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:17:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:17:41,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1831, Unknown=11, NotChecked=264, Total=2256 [2021-11-16 20:17:41,981 INFO L87 Difference]: Start difference. First operand 388 states and 506 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-11-16 20:17:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 20:17:41,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 156 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=150, Invalid=1831, Unknown=11, NotChecked=264, Total=2256 [2021-11-16 20:17:41,983 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:17:41,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:17:42,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-16 20:17:42,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-16 20:17:42,188 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@8db7325 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-16 20:17:42,191 INFO L158 Benchmark]: Toolchain (without parser) took 128173.00ms. Allocated memory was 117.4MB in the beginning and 539.0MB in the end (delta: 421.5MB). Free memory was 76.6MB in the beginning and 345.6MB in the end (delta: -269.0MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB. [2021-11-16 20:17:42,191 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 20:17:42,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2285.37ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 76.6MB in the beginning and 75.6MB in the end (delta: 976.7kB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2021-11-16 20:17:42,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.54ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 63.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-16 20:17:42,192 INFO L158 Benchmark]: Boogie Preprocessor took 117.79ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 55.9MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 20:17:42,192 INFO L158 Benchmark]: RCFGBuilder took 1664.01ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 55.9MB in the beginning and 103.6MB in the end (delta: -47.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2021-11-16 20:17:42,192 INFO L158 Benchmark]: TraceAbstraction took 123948.58ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 103.6MB in the beginning and 345.6MB in the end (delta: -242.0MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2021-11-16 20:17:42,193 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.18ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2285.37ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 76.6MB in the beginning and 75.6MB in the end (delta: 976.7kB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.54ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 63.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.79ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 55.9MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1664.01ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 55.9MB in the beginning and 103.6MB in the end (delta: -47.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 123948.58ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 103.6MB in the beginning and 345.6MB in the end (delta: -242.0MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@8db7325 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@8db7325: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-16 20:17:42,274 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:17:44,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:17:44,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:17:44,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:17:44,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:17:44,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:17:44,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:17:44,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:17:44,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:17:44,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:17:44,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:17:44,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:17:44,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:17:44,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:17:44,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:17:44,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:17:44,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:17:44,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:17:44,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:17:44,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:17:44,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:17:44,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:17:44,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:17:44,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:17:44,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:17:44,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:17:44,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:17:44,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:17:44,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:17:44,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:17:44,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:17:44,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:17:44,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:17:44,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:17:44,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:17:44,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:17:44,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:17:44,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:17:44,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:17:44,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:17:44,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:17:44,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-16 20:17:44,333 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:17:44,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:17:44,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:17:44,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:17:44,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:17:44,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:17:44,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:17:44,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:17:44,337 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:17:44,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:17:44,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:17:44,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:17:44,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:17:44,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:17:44,338 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-16 20:17:44,338 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-16 20:17:44,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:17:44,339 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:17:44,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:17:44,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:17:44,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:17:44,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:17:44,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:17:44,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:17:44,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:17:44,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:17:44,340 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-16 20:17:44,340 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-16 20:17:44,340 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:17:44,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:17:44,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:17:44,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:17:44,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-16 20:17:44,341 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 [2021-11-16 20:17:44,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:17:44,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:17:44,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:17:44,681 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:17:44,681 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:17:44,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2021-11-16 20:17:44,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2af60277/9838296f4a09403ea63d22f2356c1923/FLAG1db6a49de [2021-11-16 20:17:45,432 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:17:45,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2021-11-16 20:17:45,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2af60277/9838296f4a09403ea63d22f2356c1923/FLAG1db6a49de [2021-11-16 20:17:45,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2af60277/9838296f4a09403ea63d22f2356c1923 [2021-11-16 20:17:45,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:17:45,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:17:45,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:17:45,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:17:45,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:17:45,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:17:45" (1/1) ... [2021-11-16 20:17:45,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a58f56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:45, skipping insertion in model container [2021-11-16 20:17:45,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:17:45" (1/1) ... [2021-11-16 20:17:45,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:17:45,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:17:45,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4494,4507] [2021-11-16 20:17:45,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4554,4567] [2021-11-16 20:17:45,992 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:17:46,000 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:17:46,992 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:46,993 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:46,993 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:46,994 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:46,995 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,005 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,010 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,013 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,013 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,380 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:17:47,381 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:17:47,381 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:17:47,382 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:17:47,386 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:17:47,386 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:17:47,397 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:17:47,399 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:17:47,399 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:17:47,402 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:17:47,525 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:17:47,639 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,640 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,709 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:17:47,779 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:17:47,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4494,4507] [2021-11-16 20:17:47,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i[4554,4567] [2021-11-16 20:17:47,805 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:17:47,805 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:17:47,837 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,837 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,838 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,838 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,838 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,850 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,851 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,852 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,852 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:47,910 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:17:47,911 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:17:47,912 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:17:47,912 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:17:47,913 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:17:47,913 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:17:47,914 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:17:47,915 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:17:47,915 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:17:47,915 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:17:47,943 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:17:48,003 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:48,004 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:17:48,057 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:17:48,376 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:17:48,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48 WrapperNode [2021-11-16 20:17:48,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:17:48,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:17:48,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:17:48,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:17:48,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,580 INFO L137 Inliner]: procedures = 713, calls = 2679, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 969 [2021-11-16 20:17:48,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:17:48,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:17:48,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:17:48,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:17:48,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:17:48,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:17:48,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:17:48,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:17:48,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (1/1) ... [2021-11-16 20:17:48,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:17:48,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:17:48,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 20:17:48,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 20:17:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-11-16 20:17:48,752 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-11-16 20:17:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:17:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:17:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:17:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-16 20:17:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-16 20:17:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-16 20:17:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:17:48,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:17:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:17:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:17:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:17:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_buf_has_allocated_buffer_member [2021-11-16 20:17:48,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_buf_has_allocated_buffer_member [2021-11-16 20:17:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:17:48,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:17:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:17:48,756 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:17:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-16 20:17:48,756 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 20:17:48,757 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 20:17:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-16 20:17:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:17:48,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:17:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:17:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:17:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-16 20:17:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-16 20:17:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:17:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 20:17:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 20:17:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_bounded [2021-11-16 20:17:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_bounded [2021-11-16 20:17:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2021-11-16 20:17:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2021-11-16 20:17:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2021-11-16 20:17:48,760 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2021-11-16 20:17:49,116 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:17:49,117 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:17:54,119 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:17:54,125 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:17:54,125 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-16 20:17:54,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:17:54 BoogieIcfgContainer [2021-11-16 20:17:54,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:17:54,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:17:54,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:17:54,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:17:54,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:17:45" (1/3) ... [2021-11-16 20:17:54,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516c21c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:17:54, skipping insertion in model container [2021-11-16 20:17:54,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:17:48" (2/3) ... [2021-11-16 20:17:54,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516c21c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:17:54, skipping insertion in model container [2021-11-16 20:17:54,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:17:54" (3/3) ... [2021-11-16 20:17:54,134 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_advance_harness.i [2021-11-16 20:17:54,138 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:17:54,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:17:54,178 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:17:54,183 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 20:17:54,183 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:17:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2021-11-16 20:17:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-16 20:17:54,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:17:54,218 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:17:54,218 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:17:54,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:17:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash -851421027, now seen corresponding path program 1 times [2021-11-16 20:17:54,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:17:54,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141786050] [2021-11-16 20:17:54,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:17:54,244 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:17:54,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:17:54,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:17:54,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-16 20:17:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:17:54,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 20:17:54,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:17:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-16 20:17:55,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:17:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-16 20:17:55,398 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:17:55,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141786050] [2021-11-16 20:17:55,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141786050] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 20:17:55,399 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:17:55,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-16 20:17:55,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661645272] [2021-11-16 20:17:55,401 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 20:17:55,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 20:17:55,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:17:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 20:17:55,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:17:55,429 INFO L87 Difference]: Start difference. First operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:17:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:17:55,466 INFO L93 Difference]: Finished difference Result 342 states and 513 transitions. [2021-11-16 20:17:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 20:17:55,468 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 89 [2021-11-16 20:17:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:17:55,476 INFO L225 Difference]: With dead ends: 342 [2021-11-16 20:17:55,476 INFO L226 Difference]: Without dead ends: 168 [2021-11-16 20:17:55,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:17:55,486 INFO L933 BasicCegarLoop]: 235 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, 235 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:17:55,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:17:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-16 20:17:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-16 20:17:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 101 states have (on average 1.198019801980198) internal successors, (121), 102 states have internal predecessors, (121), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-16 20:17:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2021-11-16 20:17:55,558 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 89 [2021-11-16 20:17:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:17:55,559 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2021-11-16 20:17:55,559 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:17:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2021-11-16 20:17:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-16 20:17:55,569 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:17:55,569 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 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] [2021-11-16 20:17:55,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-16 20:17:55,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:17:55,792 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:17:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:17:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2005321356, now seen corresponding path program 1 times [2021-11-16 20:17:55,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:17:55,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943357981] [2021-11-16 20:17:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:17:55,795 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:17:55,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:17:55,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:17:55,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-16 20:17:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:17:56,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 20:17:56,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:17:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 20:17:56,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:17:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 20:17:57,228 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:17:57,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943357981] [2021-11-16 20:17:57,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943357981] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:17:57,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:17:57,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-16 20:17:57,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060902554] [2021-11-16 20:17:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:17:57,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:17:57,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:17:57,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:17:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:17:57,231 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:17:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:17:57,787 INFO L93 Difference]: Finished difference Result 332 states and 462 transitions. [2021-11-16 20:17:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:17:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 96 [2021-11-16 20:17:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:17:57,791 INFO L225 Difference]: With dead ends: 332 [2021-11-16 20:17:57,792 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:17:57,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 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-11-16 20:17:57,793 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 76 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:17:57,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 532 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-16 20:17:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:17:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:17:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (63), 54 states have call predecessors, (63), 54 states have call successors, (63) [2021-11-16 20:17:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2021-11-16 20:17:57,811 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 96 [2021-11-16 20:17:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:17:57,811 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2021-11-16 20:17:57,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:17:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2021-11-16 20:17:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-16 20:17:57,813 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:17:57,813 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:17:57,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-16 20:17:58,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:17:58,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:17:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:17:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash -304504407, now seen corresponding path program 1 times [2021-11-16 20:17:58,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:17:58,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099682214] [2021-11-16 20:17:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:17:58,029 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:17:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:17:58,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:17:58,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-16 20:17:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:17:58,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-16 20:17:58,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:17:58,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:17:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 20:17:59,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:00,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2021-11-16 20:18:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 20:18:01,005 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:01,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099682214] [2021-11-16 20:18:01,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099682214] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:01,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:01,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 18 [2021-11-16 20:18:01,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567896304] [2021-11-16 20:18:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:01,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:18:01,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:18:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:18:01,007 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2021-11-16 20:18:03,123 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:06,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:06,108 INFO L93 Difference]: Finished difference Result 355 states and 495 transitions. [2021-11-16 20:18:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:18:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 102 [2021-11-16 20:18:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:06,112 INFO L225 Difference]: With dead ends: 355 [2021-11-16 20:18:06,112 INFO L226 Difference]: Without dead ends: 184 [2021-11-16 20:18:06,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:18:06,114 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 18 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:06,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2007 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 1 Unknown, 170 Unchecked, 5.0s Time] [2021-11-16 20:18:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-16 20:18:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-11-16 20:18:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 115 states have (on average 1.2) internal successors, (138), 117 states have internal predecessors, (138), 55 states have call successors, (55), 12 states have call predecessors, (55), 13 states have return successors, (64), 54 states have call predecessors, (64), 54 states have call successors, (64) [2021-11-16 20:18:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 257 transitions. [2021-11-16 20:18:06,140 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 257 transitions. Word has length 102 [2021-11-16 20:18:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:06,140 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 257 transitions. [2021-11-16 20:18:06,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2021-11-16 20:18:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 257 transitions. [2021-11-16 20:18:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-16 20:18:06,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:06,147 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:06,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-16 20:18:06,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:06,364 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash -358897305, now seen corresponding path program 1 times [2021-11-16 20:18:06,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:06,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325690751] [2021-11-16 20:18:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:06,366 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:06,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:06,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:06,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-16 20:18:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:07,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1391 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:18:07,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-16 20:18:07,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:18:07,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:07,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325690751] [2021-11-16 20:18:07,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325690751] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:07,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:07,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-11-16 20:18:07,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164597540] [2021-11-16 20:18:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:07,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:18:07,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:07,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:18:07,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 20:18:07,533 INFO L87 Difference]: Start difference. First operand 184 states and 257 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:07,578 INFO L93 Difference]: Finished difference Result 358 states and 511 transitions. [2021-11-16 20:18:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:18:07,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2021-11-16 20:18:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:07,584 INFO L225 Difference]: With dead ends: 358 [2021-11-16 20:18:07,584 INFO L226 Difference]: Without dead ends: 190 [2021-11-16 20:18:07,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:18:07,587 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 20 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 682 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-11-16 20:18:07,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 682 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:18:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-16 20:18:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2021-11-16 20:18:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 110 states have (on average 1.2) internal successors, (132), 111 states have internal predecessors, (132), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (63), 54 states have call predecessors, (63), 54 states have call successors, (63) [2021-11-16 20:18:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 250 transitions. [2021-11-16 20:18:07,604 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 250 transitions. Word has length 102 [2021-11-16 20:18:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:07,605 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 250 transitions. [2021-11-16 20:18:07,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 250 transitions. [2021-11-16 20:18:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-16 20:18:07,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:07,606 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:07,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-16 20:18:07,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:07,807 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash 197444513, now seen corresponding path program 1 times [2021-11-16 20:18:07,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:07,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371423317] [2021-11-16 20:18:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:07,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:07,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:07,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:07,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-16 20:18:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:08,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:18:08,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-16 20:18:08,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:18:09,241 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:09,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371423317] [2021-11-16 20:18:09,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371423317] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:09,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:09,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-11-16 20:18:09,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831074132] [2021-11-16 20:18:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:09,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:18:09,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:18:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:18:09,243 INFO L87 Difference]: Start difference. First operand 178 states and 250 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:11,322 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:13,330 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:16,572 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:17,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:18,029 INFO L93 Difference]: Finished difference Result 364 states and 529 transitions. [2021-11-16 20:18:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:18:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2021-11-16 20:18:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:18,032 INFO L225 Difference]: With dead ends: 364 [2021-11-16 20:18:18,032 INFO L226 Difference]: Without dead ends: 198 [2021-11-16 20:18:18,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:18:18,034 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 42 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:18,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 817 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 51 Unchecked, 8.7s Time] [2021-11-16 20:18:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-16 20:18:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2021-11-16 20:18:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 119 states have (on average 1.2100840336134453) internal successors, (144), 120 states have internal predecessors, (144), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (63), 54 states have call predecessors, (63), 54 states have call successors, (63) [2021-11-16 20:18:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 262 transitions. [2021-11-16 20:18:18,047 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 262 transitions. Word has length 106 [2021-11-16 20:18:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:18,048 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 262 transitions. [2021-11-16 20:18:18,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 262 transitions. [2021-11-16 20:18:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-16 20:18:18,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:18,050 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:18,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-16 20:18:18,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:18,272 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1488735325, now seen corresponding path program 1 times [2021-11-16 20:18:18,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:18,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192338176] [2021-11-16 20:18:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:18,274 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:18,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:18,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:18,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-16 20:18:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:18,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-16 20:18:18,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-16 20:18:19,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-16 20:18:20,821 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:20,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192338176] [2021-11-16 20:18:20,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192338176] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:20,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:20,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 19 [2021-11-16 20:18:20,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23816326] [2021-11-16 20:18:20,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:20,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 20:18:20,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 20:18:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:18:20,823 INFO L87 Difference]: Start difference. First operand 187 states and 262 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:18:22,905 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:24,910 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:29,465 INFO L93 Difference]: Finished difference Result 372 states and 547 transitions. [2021-11-16 20:18:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:18:29,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 106 [2021-11-16 20:18:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:29,469 INFO L225 Difference]: With dead ends: 372 [2021-11-16 20:18:29,469 INFO L226 Difference]: Without dead ends: 196 [2021-11-16 20:18:29,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:18:29,471 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 38 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:29,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 2177 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 2 Unknown, 358 Unchecked, 8.1s Time] [2021-11-16 20:18:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-16 20:18:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2021-11-16 20:18:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 125 states have internal predecessors, (146), 55 states have call successors, (55), 12 states have call predecessors, (55), 13 states have return successors, (73), 54 states have call predecessors, (73), 54 states have call successors, (73) [2021-11-16 20:18:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 274 transitions. [2021-11-16 20:18:29,486 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 274 transitions. Word has length 106 [2021-11-16 20:18:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:29,486 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 274 transitions. [2021-11-16 20:18:29,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:18:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 274 transitions. [2021-11-16 20:18:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-16 20:18:29,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:29,488 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:29,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-16 20:18:29,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:29,711 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2105902303, now seen corresponding path program 1 times [2021-11-16 20:18:29,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:29,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108261774] [2021-11-16 20:18:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:29,713 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:29,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:29,714 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:29,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-16 20:18:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:30,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:18:30,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-16 20:18:30,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:18:30,742 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:30,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108261774] [2021-11-16 20:18:30,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108261774] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:30,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:30,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-11-16 20:18:30,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753792573] [2021-11-16 20:18:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:30,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:18:30,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:18:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 20:18:30,743 INFO L87 Difference]: Start difference. First operand 192 states and 274 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:30,789 INFO L93 Difference]: Finished difference Result 376 states and 545 transitions. [2021-11-16 20:18:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:18:30,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2021-11-16 20:18:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:30,801 INFO L225 Difference]: With dead ends: 376 [2021-11-16 20:18:30,801 INFO L226 Difference]: Without dead ends: 196 [2021-11-16 20:18:30,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:18:30,803 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 34 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:30,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 673 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:18:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-16 20:18:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2021-11-16 20:18:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 121 states have internal predecessors, (139), 55 states have call successors, (55), 12 states have call predecessors, (55), 13 states have return successors, (73), 54 states have call predecessors, (73), 54 states have call successors, (73) [2021-11-16 20:18:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 267 transitions. [2021-11-16 20:18:30,825 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 267 transitions. Word has length 106 [2021-11-16 20:18:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:30,828 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 267 transitions. [2021-11-16 20:18:30,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 267 transitions. [2021-11-16 20:18:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-16 20:18:30,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:30,830 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:30,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-16 20:18:31,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:31,052 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:31,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1235124835, now seen corresponding path program 1 times [2021-11-16 20:18:31,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:31,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78549033] [2021-11-16 20:18:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:31,054 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:31,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:31,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-16 20:18:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:31,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:18:31,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-16 20:18:31,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-16 20:18:32,328 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:32,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78549033] [2021-11-16 20:18:32,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78549033] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:32,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:32,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-11-16 20:18:32,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463497379] [2021-11-16 20:18:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:32,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:18:32,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:18:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:18:32,330 INFO L87 Difference]: Start difference. First operand 188 states and 267 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:18:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:32,608 INFO L93 Difference]: Finished difference Result 375 states and 548 transitions. [2021-11-16 20:18:32,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:18:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 106 [2021-11-16 20:18:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:32,610 INFO L225 Difference]: With dead ends: 375 [2021-11-16 20:18:32,610 INFO L226 Difference]: Without dead ends: 197 [2021-11-16 20:18:32,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:18:32,612 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 12 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:32,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1693 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:18:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-16 20:18:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2021-11-16 20:18:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 121 states have internal predecessors, (139), 55 states have call successors, (55), 12 states have call predecessors, (55), 13 states have return successors, (73), 54 states have call predecessors, (73), 54 states have call successors, (73) [2021-11-16 20:18:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 267 transitions. [2021-11-16 20:18:32,624 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 267 transitions. Word has length 106 [2021-11-16 20:18:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:32,625 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 267 transitions. [2021-11-16 20:18:32,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 20:18:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 267 transitions. [2021-11-16 20:18:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-16 20:18:32,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:32,626 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:32,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-16 20:18:32,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:32,847 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -502310762, now seen corresponding path program 1 times [2021-11-16 20:18:32,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:32,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054049312] [2021-11-16 20:18:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:32,850 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:32,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:32,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:32,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-16 20:18:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:33,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 20:18:33,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-16 20:18:33,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 20:18:34,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:34,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054049312] [2021-11-16 20:18:34,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054049312] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:34,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:34,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2021-11-16 20:18:34,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013178802] [2021-11-16 20:18:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:34,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:18:34,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:18:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:18:34,100 INFO L87 Difference]: Start difference. First operand 188 states and 267 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:18:36,597 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:38,618 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:38,804 INFO L93 Difference]: Finished difference Result 324 states and 463 transitions. [2021-11-16 20:18:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:18:38,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 108 [2021-11-16 20:18:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:38,806 INFO L225 Difference]: With dead ends: 324 [2021-11-16 20:18:38,806 INFO L226 Difference]: Without dead ends: 188 [2021-11-16 20:18:38,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:18:38,807 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 116 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 82 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:38,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 865 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2021-11-16 20:18:38,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-16 20:18:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-11-16 20:18:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 121 states have internal predecessors, (139), 55 states have call successors, (55), 12 states have call predecessors, (55), 13 states have return successors, (70), 54 states have call predecessors, (70), 54 states have call successors, (70) [2021-11-16 20:18:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2021-11-16 20:18:38,818 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 108 [2021-11-16 20:18:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:38,818 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2021-11-16 20:18:38,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:18:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2021-11-16 20:18:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-16 20:18:38,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:38,820 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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] [2021-11-16 20:18:38,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-16 20:18:39,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:39,044 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1772700981, now seen corresponding path program 1 times [2021-11-16 20:18:39,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:39,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495914868] [2021-11-16 20:18:39,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:39,046 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:39,047 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:39,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-16 20:18:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:39,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 20:18:39,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-16 20:18:39,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-11-16 20:18:40,328 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:40,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495914868] [2021-11-16 20:18:40,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495914868] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:18:40,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:18:40,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2021-11-16 20:18:40,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303193041] [2021-11-16 20:18:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:40,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:18:40,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:18:40,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:18:40,330 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:18:44,316 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:44,504 INFO L93 Difference]: Finished difference Result 333 states and 472 transitions. [2021-11-16 20:18:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:18:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 114 [2021-11-16 20:18:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:44,506 INFO L225 Difference]: With dead ends: 333 [2021-11-16 20:18:44,506 INFO L226 Difference]: Without dead ends: 188 [2021-11-16 20:18:44,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:18:44,507 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 115 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:44,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 885 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2021-11-16 20:18:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-16 20:18:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-11-16 20:18:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 121 states have internal predecessors, (139), 55 states have call successors, (55), 12 states have call predecessors, (55), 13 states have return successors, (65), 54 states have call predecessors, (65), 54 states have call successors, (65) [2021-11-16 20:18:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 259 transitions. [2021-11-16 20:18:44,518 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 259 transitions. Word has length 114 [2021-11-16 20:18:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:44,518 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 259 transitions. [2021-11-16 20:18:44,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 20:18:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 259 transitions. [2021-11-16 20:18:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-16 20:18:44,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:44,520 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:44,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-16 20:18:44,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:44,741 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1611498304, now seen corresponding path program 2 times [2021-11-16 20:18:44,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:44,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075069383] [2021-11-16 20:18:44,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:18:44,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:44,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:44,744 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:44,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-16 20:18:45,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-16 20:18:45,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:18:45,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 20:18:45,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:18:45,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-16 20:18:45,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:45,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075069383] [2021-11-16 20:18:45,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075069383] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 20:18:45,667 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:18:45,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-16 20:18:45,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301386894] [2021-11-16 20:18:45,667 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 20:18:45,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:18:45,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:18:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:18:45,668 INFO L87 Difference]: Start difference. First operand 188 states and 259 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:18:46,142 INFO L93 Difference]: Finished difference Result 287 states and 394 transitions. [2021-11-16 20:18:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:18:46,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2021-11-16 20:18:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:18:46,144 INFO L225 Difference]: With dead ends: 287 [2021-11-16 20:18:46,144 INFO L226 Difference]: Without dead ends: 185 [2021-11-16 20:18:46,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 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-11-16 20:18:46,145 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 22 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:18:46,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 859 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-16 20:18:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-16 20:18:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-11-16 20:18:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 118 states have internal predecessors, (136), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (64), 54 states have call predecessors, (64), 54 states have call successors, (64) [2021-11-16 20:18:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 255 transitions. [2021-11-16 20:18:46,155 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 255 transitions. Word has length 120 [2021-11-16 20:18:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:18:46,156 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 255 transitions. [2021-11-16 20:18:46,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 20:18:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 255 transitions. [2021-11-16 20:18:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-16 20:18:46,158 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:18:46,158 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:18:46,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-16 20:18:46,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:18:46,372 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:18:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:18:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1804072683, now seen corresponding path program 1 times [2021-11-16 20:18:46,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:18:46,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014878810] [2021-11-16 20:18:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:18:46,374 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:18:46,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:18:46,374 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:18:46,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-16 20:18:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:18:47,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-16 20:18:47,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:18:49,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-16 20:18:49,185 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:18:49,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2021-11-16 20:18:49,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-11-16 20:18:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-16 20:18:49,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:18:50,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2021-11-16 20:18:50,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2021-11-16 20:18:51,139 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:18:51,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 57 [2021-11-16 20:18:51,161 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:18:51,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2021-11-16 20:18:51,726 INFO L354 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2021-11-16 20:18:51,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 52 [2021-11-16 20:18:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:18:51,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:18:51,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014878810] [2021-11-16 20:18:51,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014878810] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:18:51,876 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:18:51,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2021-11-16 20:18:51,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879573875] [2021-11-16 20:18:51,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 20:18:51,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-16 20:18:51,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:18:51,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-16 20:18:51,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-11-16 20:18:51,878 INFO L87 Difference]: Start difference. First operand 185 states and 255 transitions. Second operand has 24 states, 21 states have (on average 5.095238095238095) internal successors, (107), 24 states have internal predecessors, (107), 8 states have call successors, (28), 3 states have call predecessors, (28), 6 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2021-11-16 20:18:53,958 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:55,964 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:57,974 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:18:59,977 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:19:01,986 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:19:03,995 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:19:21,566 WARN L227 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 53 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 20:19:36,501 WARN L227 SmtUtils]: Spent 14.54s on a formula simplification. DAG size of input: 54 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 20:19:44,759 WARN L227 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 62 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 20:19:51,729 WARN L227 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 67 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 20:20:15,229 WARN L227 SmtUtils]: Spent 23.06s on a formula simplification. DAG size of input: 68 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 20:20:22,575 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:25,521 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:27,227 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:29,249 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:32,089 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:34,115 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:36,131 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:42,619 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:45,083 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:46,859 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:48,698 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:50,476 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:53,346 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:54,853 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:56,681 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:20:58,705 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:21:00,304 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:21:02,274 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:21:03,874 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:21:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:21:17,385 INFO L93 Difference]: Finished difference Result 918 states and 1485 transitions. [2021-11-16 20:21:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-16 20:21:17,386 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.095238095238095) internal successors, (107), 24 states have internal predecessors, (107), 8 states have call successors, (28), 3 states have call predecessors, (28), 6 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) Word has length 126 [2021-11-16 20:21:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:21:17,392 INFO L225 Difference]: With dead ends: 918 [2021-11-16 20:21:17,392 INFO L226 Difference]: Without dead ends: 820 [2021-11-16 20:21:17,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 231 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 69.1s TimeCoverageRelationStatistics Valid=451, Invalid=2855, Unknown=0, NotChecked=0, Total=3306 [2021-11-16 20:21:17,394 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 585 mSDsluCounter, 5877 mSDsCounter, 0 mSdLazyCounter, 3953 mSolverCounterSat, 811 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 6412 SdHoareTripleChecker+Invalid, 5631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 811 IncrementalHoareTripleChecker+Valid, 3953 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 856 IncrementalHoareTripleChecker+Unchecked, 78.4s IncrementalHoareTripleChecker+Time [2021-11-16 20:21:17,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 6412 Invalid, 5631 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [811 Valid, 3953 Invalid, 11 Unknown, 856 Unchecked, 78.4s Time] [2021-11-16 20:21:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-11-16 20:21:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 228. [2021-11-16 20:21:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 151 states have (on average 1.1523178807947019) internal successors, (174), 153 states have internal predecessors, (174), 60 states have call successors, (60), 14 states have call predecessors, (60), 16 states have return successors, (91), 60 states have call predecessors, (91), 59 states have call successors, (91) [2021-11-16 20:21:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 325 transitions. [2021-11-16 20:21:17,427 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 325 transitions. Word has length 126 [2021-11-16 20:21:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:21:17,427 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 325 transitions. [2021-11-16 20:21:17,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.095238095238095) internal successors, (107), 24 states have internal predecessors, (107), 8 states have call successors, (28), 3 states have call predecessors, (28), 6 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2021-11-16 20:21:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 325 transitions. [2021-11-16 20:21:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-16 20:21:17,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:21:17,429 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:21:17,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-16 20:21:17,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:21:17,645 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:21:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:21:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash -190072023, now seen corresponding path program 1 times [2021-11-16 20:21:17,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:21:17,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599686251] [2021-11-16 20:21:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:21:17,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:21:17,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:21:17,648 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:21:17,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-16 20:21:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:21:18,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 20:21:18,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:21:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-11-16 20:21:18,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:21:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-11-16 20:21:19,040 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:21:19,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599686251] [2021-11-16 20:21:19,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599686251] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 20:21:19,040 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:21:19,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2021-11-16 20:21:19,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915176681] [2021-11-16 20:21:19,041 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 20:21:19,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 20:21:19,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:21:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 20:21:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:21:19,042 INFO L87 Difference]: Start difference. First operand 228 states and 325 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-16 20:21:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:21:19,290 INFO L93 Difference]: Finished difference Result 240 states and 337 transitions. [2021-11-16 20:21:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:21:19,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2021-11-16 20:21:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:21:19,292 INFO L225 Difference]: With dead ends: 240 [2021-11-16 20:21:19,293 INFO L226 Difference]: Without dead ends: 238 [2021-11-16 20:21:19,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:21:19,294 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 26 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:21:19,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1995 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:21:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-16 20:21:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2021-11-16 20:21:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 154 states have (on average 1.1493506493506493) internal successors, (177), 156 states have internal predecessors, (177), 61 states have call successors, (61), 15 states have call predecessors, (61), 17 states have return successors, (92), 61 states have call predecessors, (92), 60 states have call successors, (92) [2021-11-16 20:21:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 330 transitions. [2021-11-16 20:21:19,315 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 330 transitions. Word has length 126 [2021-11-16 20:21:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:21:19,315 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 330 transitions. [2021-11-16 20:21:19,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-16 20:21:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 330 transitions. [2021-11-16 20:21:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 20:21:19,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:21:19,318 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:21:19,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-16 20:21:19,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 20:21:19,539 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:21:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:21:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 583599087, now seen corresponding path program 1 times [2021-11-16 20:21:19,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:21:19,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309415441] [2021-11-16 20:21:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:21:19,542 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:21:19,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:21:19,549 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 20:21:19,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-16 20:21:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:21:27,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-16 20:21:27,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:21:27,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-11-16 20:21:28,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 20:21:29,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:30,348 INFO L354 Elim1Store]: treesize reduction 188, result has 9.2 percent of original size [2021-11-16 20:21:30,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 203 [2021-11-16 20:21:30,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:30,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:30,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:30,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:30,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:30,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:31,162 INFO L354 Elim1Store]: treesize reduction 625, result has 8.4 percent of original size [2021-11-16 20:21:31,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 203 treesize of output 172 [2021-11-16 20:21:31,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:31,458 INFO L354 Elim1Store]: treesize reduction 384, result has 6.8 percent of original size [2021-11-16 20:21:31,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 192 treesize of output 166 [2021-11-16 20:21:31,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:31,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:31,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:31,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:31,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:31,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:32,071 INFO L354 Elim1Store]: treesize reduction 975, result has 7.1 percent of original size [2021-11-16 20:21:32,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 166 treesize of output 141 [2021-11-16 20:21:32,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:21:32,234 INFO L354 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2021-11-16 20:21:32,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 154 [2021-11-16 20:21:32,685 INFO L354 Elim1Store]: treesize reduction 282, result has 0.4 percent of original size [2021-11-16 20:21:32,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 153 treesize of output 83 [2021-11-16 20:21:32,699 INFO L354 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2021-11-16 20:21:32,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 29 [2021-11-16 20:21:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 20:21:33,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:21:38,316 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64))) (not (= (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base| (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base|))) (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base|) |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| v_DerPreprocessor_3) (bvadd |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ bv4 64)) v_DerPreprocessor_4) (bvadd (_ bv8 64) |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset|) (select .cse0 .cse1)) (bvadd |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ bv16 64)) v_DerPreprocessor_1) (bvadd (_ bv20 64) |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset|) v_DerPreprocessor_2) (bvadd |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ bv24 64)) (select .cse0 (bvadd (_ bv24 64) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset|))))) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base|) .cse1)) (_ bv0 64)))) (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ BitVec 64))) (bvugt (let ((.cse3 (bvadd (_ bv4 64) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset|))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base|))) (let ((.cse6 (concat (select .cse5 (bvadd (_ bv20 64) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset|)) (select .cse5 (bvadd |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset| (_ bv16 64)))))) (store (store (store (let ((.cse4 (concat (select .cse5 .cse3) (select .cse5 |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset|)))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base|) |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| ((_ extract 31 0) .cse4)) (bvadd |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ bv4 64)) ((_ extract 63 32) .cse4))) (bvadd (_ bv8 64) |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset|) v_DerPreprocessor_6) (bvadd |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ bv16 64)) ((_ extract 31 0) .cse6)) (bvadd (_ bv20 64) |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset|) ((_ extract 63 32) .cse6)))) (bvadd |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| (_ bv24 64)) v_DerPreprocessor_5)) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base|))) (concat (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset|)))) (_ bv0 64)))) is different from false [2021-11-16 20:21:39,783 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-16 20:21:39,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5995769888818 treesize of output 4608495452200 Killed by 15