./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_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.2-?-6c24879 [2022-07-12 10:51:50,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:51:50,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:51:50,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:51:50,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:51:50,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:51:50,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:51:50,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:51:50,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:51:50,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:51:50,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:51:50,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:51:50,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:51:50,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:51:50,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:51:50,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:51:50,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:51:50,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:51:50,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:51:50,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:51:50,975 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:51:50,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:51:50,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:51:50,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:51:50,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:51:50,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:51:50,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:51:50,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:51:50,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:51:50,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:51:50,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:51:50,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:51:50,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:51:50,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:51:50,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:51:50,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:51:50,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:51:50,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:51:50,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:51:50,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:51:50,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:51:50,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:51:50,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 10:51:51,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:51:51,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:51:51,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:51:51,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:51:51,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:51:51,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:51:51,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:51:51,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:51:51,017 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:51:51,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:51:51,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:51:51,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:51:51,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:51:51,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:51:51,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:51:51,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:51:51,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:51:51,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:51:51,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:51:51,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:51:51,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:51:51,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:51:51,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:51:51,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:51:51,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:51:51,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:51:51,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:51:51,021 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:51:51,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:51:51,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:51:51,021 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 [2022-07-12 10:51:51,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:51:51,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:51:51,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:51:51,220 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:51:51,221 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:51:51,222 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 [2022-07-12 10:51:51,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86cb7202/55dcf5b23e36407299fd774d98bc5f03/FLAG1c836d6f0 [2022-07-12 10:51:51,810 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:51:51,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-12 10:51:51,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86cb7202/55dcf5b23e36407299fd774d98bc5f03/FLAG1c836d6f0 [2022-07-12 10:51:52,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86cb7202/55dcf5b23e36407299fd774d98bc5f03 [2022-07-12 10:51:52,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:51:52,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:51:52,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:51:52,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:51:52,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:51:52,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:51:52" (1/1) ... [2022-07-12 10:51:52,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707a9c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:52, skipping insertion in model container [2022-07-12 10:51:52,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:51:52" (1/1) ... [2022-07-12 10:51:52,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:51:52,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:51:52,353 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] [2022-07-12 10:51:52,358 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] [2022-07-12 10:51:52,811 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,812 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,812 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,819 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,819 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,826 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,827 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,828 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:52,828 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,020 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:51:53,026 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:51:53,028 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:51:53,028 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:51:53,030 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:51:53,032 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:51:53,032 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:51:53,033 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:51:53,034 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:51:53,035 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:51:53,137 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:51:53,218 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,219 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:51:53,373 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:51:53,380 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] [2022-07-12 10:51:53,381 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] [2022-07-12 10:51:53,409 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,409 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,409 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,410 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,410 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,413 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,413 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,414 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,414 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,444 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:51:53,444 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:51:53,444 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:51:53,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:51:53,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:51:53,446 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:51:53,446 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:51:53,446 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:51:53,446 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:51:53,447 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:51:53,464 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:51:53,501 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,503 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:51:53,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:51:53,684 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:51:53,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53 WrapperNode [2022-07-12 10:51:53,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:51:53,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:51:53,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:51:53,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:51:53,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,823 INFO L137 Inliner]: procedures = 691, calls = 2677, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 972 [2022-07-12 10:51:53,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:51:53,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:51:53,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:51:53,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:51:53,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:51:53,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:51:53,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:51:53,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:51:53,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (1/1) ... [2022-07-12 10:51:53,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:51:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:51:53,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:51:53,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:51:53,983 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-12 10:51:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-12 10:51:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:51:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:51:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:51:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:51:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:51:53,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:51:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:51:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:51:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:51:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-12 10:51:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-12 10:51:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:51:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:51:53,987 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:51:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:51:53,987 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 10:51:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 10:51:53,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:51:53,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:51:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:51:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:51:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:51:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 10:51:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 10:51:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_bounded [2022-07-12 10:51:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_bounded [2022-07-12 10:51:53,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:51:53,989 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2022-07-12 10:51:53,989 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2022-07-12 10:51:53,990 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-12 10:51:53,990 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-12 10:51:53,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:51:54,255 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:51:54,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:51:55,096 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:51:55,103 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:51:55,103 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 10:51:55,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:51:55 BoogieIcfgContainer [2022-07-12 10:51:55,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:51:55,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:51:55,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:51:55,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:51:55,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:51:52" (1/3) ... [2022-07-12 10:51:55,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9d4167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:51:55, skipping insertion in model container [2022-07-12 10:51:55,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:51:53" (2/3) ... [2022-07-12 10:51:55,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9d4167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:51:55, skipping insertion in model container [2022-07-12 10:51:55,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:51:55" (3/3) ... [2022-07-12 10:51:55,111 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_advance_harness.i [2022-07-12 10:51:55,124 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:51:55,124 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:51:55,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:51:55,182 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3410ddb3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@552b24d2 [2022-07-12 10:51:55,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:51:55,185 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) [2022-07-12 10:51:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:51:55,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:51:55,200 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:51:55,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:51:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:51:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1247030305, now seen corresponding path program 1 times [2022-07-12 10:51:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:51:55,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399473631] [2022-07-12 10:51:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:51:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:51:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:51:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:51:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:51:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:51:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:51:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:51:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:51:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:51:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:51:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:51:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:51:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:51:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-12 10:51:55,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:51:55,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399473631] [2022-07-12 10:51:55,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399473631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:51:55,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:51:55,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:51:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891132021] [2022-07-12 10:51:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:51:55,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:51:55,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:51:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:51:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:51:55,846 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) [2022-07-12 10:51:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:51:56,188 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-07-12 10:51:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:51:56,190 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 [2022-07-12 10:51:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:51:56,196 INFO L225 Difference]: With dead ends: 349 [2022-07-12 10:51:56,197 INFO L226 Difference]: Without dead ends: 175 [2022-07-12 10:51:56,200 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:51:56,202 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 119 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:51:56,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 278 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:51:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-12 10:51:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2022-07-12 10:51:56,235 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) [2022-07-12 10:51:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2022-07-12 10:51:56,238 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 89 [2022-07-12 10:51:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:51:56,239 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2022-07-12 10:51:56,239 INFO L496 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) [2022-07-12 10:51:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2022-07-12 10:51:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 10:51:56,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:51:56,242 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:51:56,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:51:56,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:51:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:51:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1477386906, now seen corresponding path program 1 times [2022-07-12 10:51:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:51:56,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820817729] [2022-07-12 10:51:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:51:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:51:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:51:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:51:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:51:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:51:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:51:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:51:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:51:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:51:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:51:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:51:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:51:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:51:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 10:51:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 10:51:56,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:51:56,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820817729] [2022-07-12 10:51:56,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820817729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:51:56,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685955699] [2022-07-12 10:51:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:51:56,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:51:56,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:51:56,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:51:56,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:51:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:57,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:51:57,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:51:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:51:57,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:51:57,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685955699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:51:57,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:51:57,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-12 10:51:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297653112] [2022-07-12 10:51:57,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:51:57,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:51:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:51:57,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:51:57,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:51:57,118 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) [2022-07-12 10:51:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:51:57,545 INFO L93 Difference]: Finished difference Result 332 states and 462 transitions. [2022-07-12 10:51:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:51:57,545 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 [2022-07-12 10:51:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:51:57,547 INFO L225 Difference]: With dead ends: 332 [2022-07-12 10:51:57,547 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 10:51:57,549 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:51:57,549 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 259 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:51:57,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 582 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:51:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 10:51:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-12 10:51:57,571 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) [2022-07-12 10:51:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2022-07-12 10:51:57,572 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 96 [2022-07-12 10:51:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:51:57,572 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2022-07-12 10:51:57,573 INFO L496 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) [2022-07-12 10:51:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2022-07-12 10:51:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 10:51:57,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:51:57,575 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:51:57,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:51:57,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:51:57,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:51:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:51:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1893468965, now seen corresponding path program 1 times [2022-07-12 10:51:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:51:57,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395705767] [2022-07-12 10:51:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:51:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:51:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:51:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:51:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:51:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:57,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:51:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:57,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:51:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:51:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:51:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:51:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:51:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:51:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:51:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 10:51:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 10:51:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 10:51:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:51:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395705767] [2022-07-12 10:51:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395705767] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:51:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817950990] [2022-07-12 10:51:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:51:58,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:51:58,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:51:58,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:51:58,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:51:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:58,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:51:58,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:51:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 10:51:58,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:51:58,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817950990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:51:58,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:51:58,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 10:51:58,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406265077] [2022-07-12 10:51:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:51:58,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:51:58,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:51:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:51:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:51:58,639 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) [2022-07-12 10:51:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:51:59,059 INFO L93 Difference]: Finished difference Result 293 states and 416 transitions. [2022-07-12 10:51:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:51:59,060 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 [2022-07-12 10:51:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:51:59,061 INFO L225 Difference]: With dead ends: 293 [2022-07-12 10:51:59,061 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 10:51:59,062 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:51:59,062 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 299 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:51:59,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 695 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:51:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 10:51:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-12 10:51:59,075 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) [2022-07-12 10:51:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 238 transitions. [2022-07-12 10:51:59,077 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 238 transitions. Word has length 102 [2022-07-12 10:51:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:51:59,077 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 238 transitions. [2022-07-12 10:51:59,077 INFO L496 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) [2022-07-12 10:51:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 238 transitions. [2022-07-12 10:51:59,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 10:51:59,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:51:59,079 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:51:59,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 10:51:59,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 10:51:59,303 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:51:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:51:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1871994096, now seen corresponding path program 2 times [2022-07-12 10:51:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:51:59,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911895046] [2022-07-12 10:51:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:51:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:51:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:51:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:51:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:51:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:51:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:51:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:51:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:51:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:51:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:51:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:51:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:51:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:51:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:51:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 10:51:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:51:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 10:51:59,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:51:59,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911895046] [2022-07-12 10:51:59,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911895046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:51:59,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475781356] [2022-07-12 10:51:59,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:51:59,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:51:59,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:51:59,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:51:59,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:51:59,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:51:59,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:51:59,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 2390 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:51:59,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 10:52:00,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:52:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 10:52:00,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475781356] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:00,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:52:00,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2022-07-12 10:52:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027255133] [2022-07-12 10:52:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:00,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:52:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:52:00,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:52:00,190 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) [2022-07-12 10:52:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:00,276 INFO L93 Difference]: Finished difference Result 256 states and 358 transitions. [2022-07-12 10:52:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:52:00,276 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 [2022-07-12 10:52:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:00,278 INFO L225 Difference]: With dead ends: 256 [2022-07-12 10:52:00,278 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 10:52:00,279 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:00,279 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 229 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:00,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 813 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:52:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 10:52:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-12 10:52:00,289 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) [2022-07-12 10:52:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 237 transitions. [2022-07-12 10:52:00,290 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 237 transitions. Word has length 108 [2022-07-12 10:52:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:00,291 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 237 transitions. [2022-07-12 10:52:00,291 INFO L496 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) [2022-07-12 10:52:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 237 transitions. [2022-07-12 10:52:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 10:52:00,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:00,293 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:00,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:00,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:00,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -225220613, now seen corresponding path program 3 times [2022-07-12 10:52:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:00,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968505564] [2022-07-12 10:52:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:52:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 10:52:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 10:52:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:00,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968505564] [2022-07-12 10:52:00,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968505564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:00,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473883183] [2022-07-12 10:52:00,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:52:00,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:00,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:00,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:00,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:52:01,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-12 10:52:01,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:52:01,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 2407 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 10:52:01,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:01,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:01,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:01,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:01,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-12 10:52:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 10:52:01,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:01,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473883183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:01,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:01,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-07-12 10:52:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080556994] [2022-07-12 10:52:01,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:01,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:52:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:52:01,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:52:01,449 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) [2022-07-12 10:52:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:01,491 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2022-07-12 10:52:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:52:01,491 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 [2022-07-12 10:52:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:01,493 INFO L225 Difference]: With dead ends: 282 [2022-07-12 10:52:01,493 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 10:52:01,493 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:01,494 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 37 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:01,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 720 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-07-12 10:52:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 10:52:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2022-07-12 10:52:01,503 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) [2022-07-12 10:52:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 259 transitions. [2022-07-12 10:52:01,504 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 259 transitions. Word has length 114 [2022-07-12 10:52:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:01,505 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 259 transitions. [2022-07-12 10:52:01,505 INFO L496 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) [2022-07-12 10:52:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 259 transitions. [2022-07-12 10:52:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 10:52:01,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:01,506 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:01,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:01,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:01,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -812026627, now seen corresponding path program 1 times [2022-07-12 10:52:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:01,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406371995] [2022-07-12 10:52:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:01,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:52:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 10:52:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 10:52:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:01,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406371995] [2022-07-12 10:52:01,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406371995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:01,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507826470] [2022-07-12 10:52:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:01,963 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:01,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:52:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:52:02,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 10:52:02,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:02,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507826470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:02,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-12 10:52:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425298845] [2022-07-12 10:52:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:02,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:52:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:52:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:52:02,401 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) [2022-07-12 10:52:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:02,425 INFO L93 Difference]: Finished difference Result 393 states and 553 transitions. [2022-07-12 10:52:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:52:02,426 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 [2022-07-12 10:52:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:02,427 INFO L225 Difference]: With dead ends: 393 [2022-07-12 10:52:02,427 INFO L226 Difference]: Without dead ends: 212 [2022-07-12 10:52:02,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:52:02,429 INFO L413 NwaCegarLoop]: 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 [2022-07-12 10:52:02,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 718 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:52:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-12 10:52:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2022-07-12 10:52:02,437 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) [2022-07-12 10:52:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2022-07-12 10:52:02,438 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 114 [2022-07-12 10:52:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:02,438 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2022-07-12 10:52:02,438 INFO L496 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) [2022-07-12 10:52:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2022-07-12 10:52:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 10:52:02,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:02,440 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:02,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:02,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:02,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:02,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash -110962049, now seen corresponding path program 1 times [2022-07-12 10:52:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:02,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016253369] [2022-07-12 10:52:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:52:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 10:52:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 10:52:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:02,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016253369] [2022-07-12 10:52:02,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016253369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:02,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85687573] [2022-07-12 10:52:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:02,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:02,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 10:52:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:52:03,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 10:52:03,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:03,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85687573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:03,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:03,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-12 10:52:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793470579] [2022-07-12 10:52:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:03,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:52:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:03,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:52:03,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:52:03,284 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) [2022-07-12 10:52:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:03,307 INFO L93 Difference]: Finished difference Result 381 states and 533 transitions. [2022-07-12 10:52:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:52:03,308 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 [2022-07-12 10:52:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:03,309 INFO L225 Difference]: With dead ends: 381 [2022-07-12 10:52:03,309 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 10:52:03,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:52:03,310 INFO L413 NwaCegarLoop]: 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 [2022-07-12 10:52:03,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 682 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:52:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 10:52:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2022-07-12 10:52:03,317 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) [2022-07-12 10:52:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2022-07-12 10:52:03,318 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 251 transitions. Word has length 114 [2022-07-12 10:52:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:03,318 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-07-12 10:52:03,318 INFO L496 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) [2022-07-12 10:52:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2022-07-12 10:52:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 10:52:03,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:03,319 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:03,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:03,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:03,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2075601977, now seen corresponding path program 1 times [2022-07-12 10:52:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:03,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554806232] [2022-07-12 10:52:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:52:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 10:52:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 10:52:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554806232] [2022-07-12 10:52:03,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554806232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:03,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821828263] [2022-07-12 10:52:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:03,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:03,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:03,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:03,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 10:52:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:52:04,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 10:52:04,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:04,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821828263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:04,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:04,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 10:52:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381090071] [2022-07-12 10:52:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:04,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:52:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:04,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:52:04,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:52:04,312 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) [2022-07-12 10:52:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:04,538 INFO L93 Difference]: Finished difference Result 324 states and 450 transitions. [2022-07-12 10:52:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:52:04,538 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 [2022-07-12 10:52:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:04,540 INFO L225 Difference]: With dead ends: 324 [2022-07-12 10:52:04,540 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 10:52:04,540 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:04,541 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 298 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:04,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 556 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:52:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 10:52:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-12 10:52:04,548 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) [2022-07-12 10:52:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2022-07-12 10:52:04,549 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 114 [2022-07-12 10:52:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:04,549 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2022-07-12 10:52:04,550 INFO L496 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) [2022-07-12 10:52:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2022-07-12 10:52:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 10:52:04,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:04,551 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:04,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:04,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:04,775 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1603675154, now seen corresponding path program 1 times [2022-07-12 10:52:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:04,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238897618] [2022-07-12 10:52:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:04,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:52:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:52:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-12 10:52:05,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:05,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238897618] [2022-07-12 10:52:05,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238897618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:05,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:05,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:52:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867652901] [2022-07-12 10:52:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:05,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:52:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:52:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:52:05,038 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) [2022-07-12 10:52:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:05,597 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2022-07-12 10:52:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:52:05,598 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 [2022-07-12 10:52:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:05,599 INFO L225 Difference]: With dead ends: 198 [2022-07-12 10:52:05,599 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 10:52:05,599 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:05,600 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 141 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:05,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 966 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:52:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 10:52:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2022-07-12 10:52:05,608 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) [2022-07-12 10:52:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2022-07-12 10:52:05,609 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 120 [2022-07-12 10:52:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:05,610 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2022-07-12 10:52:05,610 INFO L496 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) [2022-07-12 10:52:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2022-07-12 10:52:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 10:52:05,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:05,611 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:05,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:52:05,612 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1437147720, now seen corresponding path program 1 times [2022-07-12 10:52:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:05,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261220128] [2022-07-12 10:52:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:52:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:52:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 10:52:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:05,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261220128] [2022-07-12 10:52:05,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261220128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:05,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:05,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:52:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482072788] [2022-07-12 10:52:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:05,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:52:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:05,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:52:05,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:52:05,881 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) [2022-07-12 10:52:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:06,377 INFO L93 Difference]: Finished difference Result 395 states and 567 transitions. [2022-07-12 10:52:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:52:06,377 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 [2022-07-12 10:52:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:06,379 INFO L225 Difference]: With dead ends: 395 [2022-07-12 10:52:06,379 INFO L226 Difference]: Without dead ends: 214 [2022-07-12 10:52:06,379 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:06,380 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 194 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:06,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 579 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:52:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-12 10:52:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 191. [2022-07-12 10:52:06,389 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) [2022-07-12 10:52:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 265 transitions. [2022-07-12 10:52:06,390 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 265 transitions. Word has length 124 [2022-07-12 10:52:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:06,390 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 265 transitions. [2022-07-12 10:52:06,390 INFO L496 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) [2022-07-12 10:52:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 265 transitions. [2022-07-12 10:52:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 10:52:06,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:06,392 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:06,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:52:06,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1178982282, now seen corresponding path program 1 times [2022-07-12 10:52:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:06,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778574175] [2022-07-12 10:52:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:52:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:52:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 10:52:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:06,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778574175] [2022-07-12 10:52:06,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778574175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:06,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:06,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:52:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363208856] [2022-07-12 10:52:06,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:06,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:52:06,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:52:06,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:52:06,747 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) [2022-07-12 10:52:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:07,586 INFO L93 Difference]: Finished difference Result 356 states and 516 transitions. [2022-07-12 10:52:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:52:07,586 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 [2022-07-12 10:52:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:07,588 INFO L225 Difference]: With dead ends: 356 [2022-07-12 10:52:07,588 INFO L226 Difference]: Without dead ends: 261 [2022-07-12 10:52:07,589 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:07,589 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 248 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:07,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 897 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 10:52:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-12 10:52:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 201. [2022-07-12 10:52:07,605 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) [2022-07-12 10:52:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2022-07-12 10:52:07,606 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 124 [2022-07-12 10:52:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:07,606 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2022-07-12 10:52:07,606 INFO L496 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) [2022-07-12 10:52:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2022-07-12 10:52:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 10:52:07,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:07,608 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:07,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:52:07,608 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1836121336, now seen corresponding path program 1 times [2022-07-12 10:52:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:07,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225989410] [2022-07-12 10:52:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:52:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:52:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 10:52:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:08,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225989410] [2022-07-12 10:52:08,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225989410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:08,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294584957] [2022-07-12 10:52:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:08,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:08,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:08,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 10:52:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:08,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 2824 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 10:52:08,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:08,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:08,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:08,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:08,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-12 10:52:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 10:52:09,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:09,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294584957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:09,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:09,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-07-12 10:52:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229950575] [2022-07-12 10:52:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:09,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:52:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:52:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:52:09,025 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) [2022-07-12 10:52:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:09,083 INFO L93 Difference]: Finished difference Result 316 states and 444 transitions. [2022-07-12 10:52:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:52:09,083 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 [2022-07-12 10:52:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:09,084 INFO L225 Difference]: With dead ends: 316 [2022-07-12 10:52:09,084 INFO L226 Difference]: Without dead ends: 208 [2022-07-12 10:52:09,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:52:09,085 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 13 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:09,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 855 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-07-12 10:52:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-12 10:52:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-12 10:52:09,097 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) [2022-07-12 10:52:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2022-07-12 10:52:09,099 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 124 [2022-07-12 10:52:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:09,099 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2022-07-12 10:52:09,100 INFO L496 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) [2022-07-12 10:52:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2022-07-12 10:52:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 10:52:09,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:09,101 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:09,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:09,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 10:52:09,316 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -10392004, now seen corresponding path program 1 times [2022-07-12 10:52:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:09,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990145560] [2022-07-12 10:52:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:52:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:52:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:52:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:52:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:52:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 10:52:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990145560] [2022-07-12 10:52:09,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990145560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125625804] [2022-07-12 10:52:09,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:09,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:09,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:09,916 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:09,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 10:52:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:10,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 2826 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 10:52:10,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:10,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:52:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 10:52:10,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:10,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125625804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:10,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:10,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 25 [2022-07-12 10:52:10,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634761969] [2022-07-12 10:52:10,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:10,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:52:10,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:10,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:52:10,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-07-12 10:52:10,696 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) [2022-07-12 10:52:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:10,863 INFO L93 Difference]: Finished difference Result 422 states and 588 transitions. [2022-07-12 10:52:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:52:10,864 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 [2022-07-12 10:52:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:10,865 INFO L225 Difference]: With dead ends: 422 [2022-07-12 10:52:10,865 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 10:52:10,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2022-07-12 10:52:10,866 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 75 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:10,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1318 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-12 10:52:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 10:52:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-07-12 10:52:10,877 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) [2022-07-12 10:52:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2022-07-12 10:52:10,878 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 124 [2022-07-12 10:52:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:10,878 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-12 10:52:10,878 INFO L496 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) [2022-07-12 10:52:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2022-07-12 10:52:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 10:52:10,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:10,880 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:10,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:11,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 10:52:11,100 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1190017078, now seen corresponding path program 1 times [2022-07-12 10:52:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:11,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469907408] [2022-07-12 10:52:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:52:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:52:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:52:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 10:52:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:52:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:52:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:52:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 10:52:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469907408] [2022-07-12 10:52:11,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469907408] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095999687] [2022-07-12 10:52:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:11,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:11,357 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:11,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 10:52:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:11,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 2833 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 10:52:11,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:11,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:52:12,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:12,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:12,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:12,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2022-07-12 10:52:12,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 10:52:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 10:52:12,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:12,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095999687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:12,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:12,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-07-12 10:52:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463398513] [2022-07-12 10:52:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:12,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:52:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:12,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:52:12,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:52:12,474 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 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) [2022-07-12 10:52:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:12,727 INFO L93 Difference]: Finished difference Result 514 states and 750 transitions. [2022-07-12 10:52:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:52:12,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 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 128 [2022-07-12 10:52:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:12,729 INFO L225 Difference]: With dead ends: 514 [2022-07-12 10:52:12,729 INFO L226 Difference]: Without dead ends: 360 [2022-07-12 10:52:12,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 134 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-07-12 10:52:12,731 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 85 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:12,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2113 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2022-07-12 10:52:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-12 10:52:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 263. [2022-07-12 10:52:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 182 states have (on average 1.1868131868131868) internal successors, (216), 185 states have internal predecessors, (216), 62 states have call successors, (62), 17 states have call predecessors, (62), 18 states have return successors, (88), 60 states have call predecessors, (88), 61 states have call successors, (88) [2022-07-12 10:52:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 366 transitions. [2022-07-12 10:52:12,746 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 366 transitions. Word has length 128 [2022-07-12 10:52:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:12,747 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 366 transitions. [2022-07-12 10:52:12,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 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) [2022-07-12 10:52:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 366 transitions. [2022-07-12 10:52:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 10:52:12,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:12,748 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:12,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:12,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 10:52:12,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 955701423, now seen corresponding path program 1 times [2022-07-12 10:52:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:12,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806731759] [2022-07-12 10:52:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 10:52:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:52:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 10:52:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-12 10:52:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:13,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806731759] [2022-07-12 10:52:13,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806731759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:13,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686181162] [2022-07-12 10:52:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:13,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:13,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:13,160 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:13,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 10:52:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:13,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:52:13,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 10:52:13,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:13,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686181162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:13,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:13,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 10:52:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244704607] [2022-07-12 10:52:13,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:13,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:52:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:13,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:52:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:52:13,710 INFO L87 Difference]: Start difference. First operand 263 states and 366 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) [2022-07-12 10:52:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:13,741 INFO L93 Difference]: Finished difference Result 525 states and 750 transitions. [2022-07-12 10:52:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:52:13,742 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 [2022-07-12 10:52:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:13,743 INFO L225 Difference]: With dead ends: 525 [2022-07-12 10:52:13,743 INFO L226 Difference]: Without dead ends: 269 [2022-07-12 10:52:13,745 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:13,746 INFO L413 NwaCegarLoop]: 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 [2022-07-12 10:52:13,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 672 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:52:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-12 10:52:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2022-07-12 10:52:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 174 states have internal predecessors, (200), 62 states have call successors, (62), 17 states have call predecessors, (62), 18 states have return successors, (85), 60 states have call predecessors, (85), 61 states have call successors, (85) [2022-07-12 10:52:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 347 transitions. [2022-07-12 10:52:13,762 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 347 transitions. Word has length 130 [2022-07-12 10:52:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:13,762 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 347 transitions. [2022-07-12 10:52:13,763 INFO L496 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) [2022-07-12 10:52:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 347 transitions. [2022-07-12 10:52:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 10:52:13,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:13,764 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:13,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 10:52:13,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 78959785, now seen corresponding path program 1 times [2022-07-12 10:52:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:13,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878915787] [2022-07-12 10:52:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 10:52:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:52:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 10:52:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-12 10:52:14,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:14,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878915787] [2022-07-12 10:52:14,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878915787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:14,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950302084] [2022-07-12 10:52:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:14,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:14,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 10:52:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:14,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 10:52:14,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:15,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:52:15,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:15,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 10:52:15,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-07-12 10:52:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 102 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 10:52:15,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:52:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-12 10:52:16,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950302084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:52:16,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:52:16,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 36 [2022-07-12 10:52:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751316910] [2022-07-12 10:52:16,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:52:16,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 10:52:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:16,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 10:52:16,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 10:52:16,110 INFO L87 Difference]: Start difference. First operand 252 states and 347 transitions. Second operand has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-12 10:52:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:23,824 INFO L93 Difference]: Finished difference Result 820 states and 1259 transitions. [2022-07-12 10:52:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-12 10:52:23,824 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 130 [2022-07-12 10:52:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:23,828 INFO L225 Difference]: With dead ends: 820 [2022-07-12 10:52:23,828 INFO L226 Difference]: Without dead ends: 661 [2022-07-12 10:52:23,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 273 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=757, Invalid=6896, Unknown=3, NotChecked=0, Total=7656 [2022-07-12 10:52:23,830 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 465 mSDsluCounter, 3555 mSDsCounter, 0 mSdLazyCounter, 7776 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 3921 SdHoareTripleChecker+Invalid, 9054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 7776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 871 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:23,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 3921 Invalid, 9054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 7776 Invalid, 0 Unknown, 871 Unchecked, 5.8s Time] [2022-07-12 10:52:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-12 10:52:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 478. [2022-07-12 10:52:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 319 states have (on average 1.1755485893416928) internal successors, (375), 327 states have internal predecessors, (375), 129 states have call successors, (129), 23 states have call predecessors, (129), 29 states have return successors, (184), 127 states have call predecessors, (184), 128 states have call successors, (184) [2022-07-12 10:52:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 688 transitions. [2022-07-12 10:52:23,864 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 688 transitions. Word has length 130 [2022-07-12 10:52:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:23,864 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 688 transitions. [2022-07-12 10:52:23,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-12 10:52:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 688 transitions. [2022-07-12 10:52:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 10:52:23,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:23,866 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:52:23,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 10:52:24,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 10:52:24,087 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1718133808, now seen corresponding path program 2 times [2022-07-12 10:52:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:24,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973699225] [2022-07-12 10:52:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:52:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:52:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:52:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 10:52:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:52:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 10:52:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:52:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 10:52:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973699225] [2022-07-12 10:52:24,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973699225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:24,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201250223] [2022-07-12 10:52:24,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:52:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:24,329 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:24,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 10:52:24,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:52:24,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:52:24,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 2411 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 10:52:24,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:24,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:24,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:24,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:24,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 10:52:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 10:52:25,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:25,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201250223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:25,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:25,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-12 10:52:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152970561] [2022-07-12 10:52:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:25,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:52:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:25,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:52:25,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:52:25,048 INFO L87 Difference]: Start difference. First operand 478 states and 688 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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) [2022-07-12 10:52:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:25,078 INFO L93 Difference]: Finished difference Result 602 states and 856 transitions. [2022-07-12 10:52:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:52:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 132 [2022-07-12 10:52:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:25,081 INFO L225 Difference]: With dead ends: 602 [2022-07-12 10:52:25,081 INFO L226 Difference]: Without dead ends: 495 [2022-07-12 10:52:25,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:52:25,082 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 25 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:25,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1081 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 140 Unchecked, 0.0s Time] [2022-07-12 10:52:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-12 10:52:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2022-07-12 10:52:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 335 states have (on average 1.173134328358209) internal successors, (393), 343 states have internal predecessors, (393), 129 states have call successors, (129), 24 states have call predecessors, (129), 30 states have return successors, (186), 127 states have call predecessors, (186), 128 states have call successors, (186) [2022-07-12 10:52:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 708 transitions. [2022-07-12 10:52:25,107 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 708 transitions. Word has length 132 [2022-07-12 10:52:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:25,107 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 708 transitions. [2022-07-12 10:52:25,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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) [2022-07-12 10:52:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 708 transitions. [2022-07-12 10:52:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 10:52:25,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:25,109 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 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, 1, 1] [2022-07-12 10:52:25,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:25,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 10:52:25,337 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1976299246, now seen corresponding path program 1 times [2022-07-12 10:52:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:25,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439201257] [2022-07-12 10:52:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:52:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:52:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:52:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 10:52:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:52:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 10:52:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:52:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 10:52:25,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:25,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439201257] [2022-07-12 10:52:25,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439201257] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:25,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621111990] [2022-07-12 10:52:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:25,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:25,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:25,583 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:25,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 10:52:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:52:26,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 10:52:26,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:26,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621111990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:26,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:26,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-07-12 10:52:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917686755] [2022-07-12 10:52:26,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:26,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:52:26,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:52:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:52:26,170 INFO L87 Difference]: Start difference. First operand 495 states and 708 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2022-07-12 10:52:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:26,381 INFO L93 Difference]: Finished difference Result 942 states and 1377 transitions. [2022-07-12 10:52:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:52:26,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 132 [2022-07-12 10:52:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:26,387 INFO L225 Difference]: With dead ends: 942 [2022-07-12 10:52:26,387 INFO L226 Difference]: Without dead ends: 480 [2022-07-12 10:52:26,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:52:26,390 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 24 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:26,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 824 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-07-12 10:52:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-12 10:52:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-07-12 10:52:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 321 states have (on average 1.1651090342679127) internal successors, (374), 328 states have internal predecessors, (374), 129 states have call successors, (129), 24 states have call predecessors, (129), 29 states have return successors, (184), 127 states have call predecessors, (184), 128 states have call successors, (184) [2022-07-12 10:52:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 687 transitions. [2022-07-12 10:52:26,416 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 687 transitions. Word has length 132 [2022-07-12 10:52:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:26,417 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 687 transitions. [2022-07-12 10:52:26,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2022-07-12 10:52:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 687 transitions. [2022-07-12 10:52:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 10:52:26,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:26,418 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 10:52:26,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:26,631 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 768398248, now seen corresponding path program 1 times [2022-07-12 10:52:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:26,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056193773] [2022-07-12 10:52:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 10:52:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:52:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:52:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 10:52:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:52:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 10:52:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 10:52:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:52:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 10:52:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056193773] [2022-07-12 10:52:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056193773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118682722] [2022-07-12 10:52:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:26,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:26,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:26,892 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 10:52:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 10:52:27,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 10:52:27,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:27,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118682722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:27,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:27,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 10:52:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490246099] [2022-07-12 10:52:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:27,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:52:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:27,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:52:27,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:52:27,438 INFO L87 Difference]: Start difference. First operand 480 states and 687 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2022-07-12 10:52:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:27,566 INFO L93 Difference]: Finished difference Result 881 states and 1254 transitions. [2022-07-12 10:52:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:52:27,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 132 [2022-07-12 10:52:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:27,568 INFO L225 Difference]: With dead ends: 881 [2022-07-12 10:52:27,568 INFO L226 Difference]: Without dead ends: 409 [2022-07-12 10:52:27,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:52:27,570 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 12 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:27,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1734 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:52:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-12 10:52:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 399. [2022-07-12 10:52:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 272 states have (on average 1.1470588235294117) internal successors, (312), 280 states have internal predecessors, (312), 99 states have call successors, (99), 21 states have call predecessors, (99), 27 states have return successors, (159), 97 states have call predecessors, (159), 98 states have call successors, (159) [2022-07-12 10:52:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 570 transitions. [2022-07-12 10:52:27,589 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 570 transitions. Word has length 132 [2022-07-12 10:52:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:27,590 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 570 transitions. [2022-07-12 10:52:27,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2022-07-12 10:52:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 570 transitions. [2022-07-12 10:52:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 10:52:27,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:27,591 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:27,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:27,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:27,814 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash -984070051, now seen corresponding path program 1 times [2022-07-12 10:52:27,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755919057] [2022-07-12 10:52:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:27,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:27,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:52:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:28,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 10:52:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:52:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 10:52:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755919057] [2022-07-12 10:52:28,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755919057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367842242] [2022-07-12 10:52:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:28,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:28,055 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:28,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 10:52:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:28,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 10:52:28,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 10:52:28,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:28,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367842242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:28,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:28,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 10:52:28,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774654003] [2022-07-12 10:52:28,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:28,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:52:28,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:28,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:52:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:52:28,615 INFO L87 Difference]: Start difference. First operand 399 states and 570 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) [2022-07-12 10:52:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:28,773 INFO L93 Difference]: Finished difference Result 635 states and 923 transitions. [2022-07-12 10:52:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:52:28,773 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 [2022-07-12 10:52:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:28,775 INFO L225 Difference]: With dead ends: 635 [2022-07-12 10:52:28,775 INFO L226 Difference]: Without dead ends: 404 [2022-07-12 10:52:28,776 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:28,777 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 12 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:28,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1761 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:52:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-07-12 10:52:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2022-07-12 10:52:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 270 states have (on average 1.1481481481481481) internal successors, (310), 277 states have internal predecessors, (310), 99 states have call successors, (99), 21 states have call predecessors, (99), 26 states have return successors, (152), 97 states have call predecessors, (152), 98 states have call successors, (152) [2022-07-12 10:52:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 561 transitions. [2022-07-12 10:52:28,800 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 561 transitions. Word has length 134 [2022-07-12 10:52:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:28,801 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 561 transitions. [2022-07-12 10:52:28,801 INFO L496 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) [2022-07-12 10:52:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 561 transitions. [2022-07-12 10:52:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 10:52:28,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:28,802 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:28,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:29,016 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:29,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2087607718, now seen corresponding path program 1 times [2022-07-12 10:52:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:29,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051899611] [2022-07-12 10:52:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:52:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 10:52:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:52:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:52:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 10:52:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:52:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 10:52:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:29,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051899611] [2022-07-12 10:52:29,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051899611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998284921] [2022-07-12 10:52:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:29,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:29,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:29,645 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:29,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 10:52:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:30,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 2883 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 10:52:30,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:30,225 INFO L390 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 [2022-07-12 10:52:30,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-12 10:52:30,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 10:52:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 10:52:30,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:30,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998284921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:30,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:30,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 25 [2022-07-12 10:52:30,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817840085] [2022-07-12 10:52:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:30,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:52:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:52:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-07-12 10:52:30,594 INFO L87 Difference]: Start difference. First operand 396 states and 561 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) [2022-07-12 10:52:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:31,463 INFO L93 Difference]: Finished difference Result 683 states and 1039 transitions. [2022-07-12 10:52:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:52:31,466 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 [2022-07-12 10:52:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:31,468 INFO L225 Difference]: With dead ends: 683 [2022-07-12 10:52:31,468 INFO L226 Difference]: Without dead ends: 509 [2022-07-12 10:52:31,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2022-07-12 10:52:31,469 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 155 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:31,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1745 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 833 Invalid, 0 Unknown, 106 Unchecked, 0.7s Time] [2022-07-12 10:52:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-07-12 10:52:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 412. [2022-07-12 10:52:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 283 states have (on average 1.137809187279152) internal successors, (322), 292 states have internal predecessors, (322), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (173), 97 states have call predecessors, (173), 98 states have call successors, (173) [2022-07-12 10:52:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 594 transitions. [2022-07-12 10:52:31,494 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 594 transitions. Word has length 137 [2022-07-12 10:52:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:31,494 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 594 transitions. [2022-07-12 10:52:31,494 INFO L496 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) [2022-07-12 10:52:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 594 transitions. [2022-07-12 10:52:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 10:52:31,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:31,496 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:31,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:31,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:31,712 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1691174062, now seen corresponding path program 2 times [2022-07-12 10:52:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:31,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617124385] [2022-07-12 10:52:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 10:52:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-12 10:52:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:32,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617124385] [2022-07-12 10:52:32,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617124385] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:32,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525871224] [2022-07-12 10:52:32,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:52:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:32,340 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:32,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 10:52:32,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:52:32,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:52:32,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 2414 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 10:52:32,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:32,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 10:52:32,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:32,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 10:52:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 10:52:33,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:33,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525871224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:33,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:33,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2022-07-12 10:52:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743753121] [2022-07-12 10:52:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:33,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:52:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:52:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:52:33,209 INFO L87 Difference]: Start difference. First operand 412 states and 594 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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) [2022-07-12 10:52:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:33,257 INFO L93 Difference]: Finished difference Result 541 states and 770 transitions. [2022-07-12 10:52:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:52:33,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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 136 [2022-07-12 10:52:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:33,259 INFO L225 Difference]: With dead ends: 541 [2022-07-12 10:52:33,259 INFO L226 Difference]: Without dead ends: 422 [2022-07-12 10:52:33,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:52:33,260 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 13 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:33,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1267 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-12 10:52:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-12 10:52:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2022-07-12 10:52:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (173), 97 states have call predecessors, (173), 98 states have call successors, (173) [2022-07-12 10:52:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 599 transitions. [2022-07-12 10:52:33,282 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 599 transitions. Word has length 136 [2022-07-12 10:52:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:33,282 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 599 transitions. [2022-07-12 10:52:33,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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) [2022-07-12 10:52:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 599 transitions. [2022-07-12 10:52:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 10:52:33,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:33,284 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:33,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:33,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:33,504 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:33,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1323929556, now seen corresponding path program 3 times [2022-07-12 10:52:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:33,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34250030] [2022-07-12 10:52:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 10:52:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 10:52:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34250030] [2022-07-12 10:52:33,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34250030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:33,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:33,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:52:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104423808] [2022-07-12 10:52:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:33,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:52:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:33,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:52:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:52:33,816 INFO L87 Difference]: Start difference. First operand 416 states and 599 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) [2022-07-12 10:52:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:34,911 INFO L93 Difference]: Finished difference Result 601 states and 891 transitions. [2022-07-12 10:52:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:52:34,912 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 [2022-07-12 10:52:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:34,914 INFO L225 Difference]: With dead ends: 601 [2022-07-12 10:52:34,914 INFO L226 Difference]: Without dead ends: 490 [2022-07-12 10:52:34,915 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:34,915 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 200 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:34,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1144 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 10:52:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-12 10:52:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 416. [2022-07-12 10:52:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-12 10:52:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-12 10:52:34,949 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 136 [2022-07-12 10:52:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:34,949 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-12 10:52:34,949 INFO L496 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) [2022-07-12 10:52:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-12 10:52:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 10:52:34,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:34,951 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:34,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 10:52:34,951 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1902565441, now seen corresponding path program 1 times [2022-07-12 10:52:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:34,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36579805] [2022-07-12 10:52:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 10:52:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 10:52:35,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:35,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36579805] [2022-07-12 10:52:35,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36579805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:35,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:35,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:52:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478704356] [2022-07-12 10:52:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:35,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:52:35,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:35,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:52:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:52:35,240 INFO L87 Difference]: Start difference. First operand 416 states and 598 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) [2022-07-12 10:52:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:35,873 INFO L93 Difference]: Finished difference Result 432 states and 614 transitions. [2022-07-12 10:52:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:52:35,874 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 [2022-07-12 10:52:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:35,876 INFO L225 Difference]: With dead ends: 432 [2022-07-12 10:52:35,876 INFO L226 Difference]: Without dead ends: 430 [2022-07-12 10:52:35,876 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:35,876 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 154 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:35,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1186 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:52:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-07-12 10:52:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 416. [2022-07-12 10:52:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-12 10:52:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-12 10:52:35,900 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 138 [2022-07-12 10:52:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:35,900 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-12 10:52:35,900 INFO L496 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) [2022-07-12 10:52:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-12 10:52:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 10:52:35,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:35,902 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:35,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 10:52:35,902 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:35,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1201500863, now seen corresponding path program 1 times [2022-07-12 10:52:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:35,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833442676] [2022-07-12 10:52:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 10:52:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 10:52:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833442676] [2022-07-12 10:52:36,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833442676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340848751] [2022-07-12 10:52:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:36,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:36,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:36,866 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:36,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 10:52:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:37,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 2854 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 10:52:37,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:37,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 10:52:37,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:37,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 10:52:38,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:52:38,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2022-07-12 10:52:38,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2022-07-12 10:52:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 10:52:38,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:52:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 10:52:39,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340848751] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:39,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:52:39,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [26, 25] total 57 [2022-07-12 10:52:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869081573] [2022-07-12 10:52:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:39,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 10:52:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 10:52:39,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3022, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 10:52:39,184 INFO L87 Difference]: Start difference. First operand 416 states and 598 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) [2022-07-12 10:52:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:40,273 INFO L93 Difference]: Finished difference Result 481 states and 694 transitions. [2022-07-12 10:52:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:52:40,273 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 [2022-07-12 10:52:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:40,275 INFO L225 Difference]: With dead ends: 481 [2022-07-12 10:52:40,275 INFO L226 Difference]: Without dead ends: 479 [2022-07-12 10:52:40,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=239, Invalid=4183, Unknown=0, NotChecked=0, Total=4422 [2022-07-12 10:52:40,277 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 75 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:40,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 3213 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 10:52:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-07-12 10:52:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 416. [2022-07-12 10:52:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-12 10:52:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-12 10:52:40,301 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 138 [2022-07-12 10:52:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:40,302 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-12 10:52:40,302 INFO L496 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) [2022-07-12 10:52:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-12 10:52:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 10:52:40,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:40,303 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:40,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-12 10:52:40,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:40,524 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1335514369, now seen corresponding path program 1 times [2022-07-12 10:52:40,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:40,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359260329] [2022-07-12 10:52:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 10:52:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 10:52:40,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:40,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359260329] [2022-07-12 10:52:40,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359260329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:40,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:40,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:52:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827415623] [2022-07-12 10:52:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:40,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:52:40,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:40,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:52:40,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:52:40,803 INFO L87 Difference]: Start difference. First operand 416 states and 598 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) [2022-07-12 10:52:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:41,775 INFO L93 Difference]: Finished difference Result 579 states and 848 transitions. [2022-07-12 10:52:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:52:41,775 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 [2022-07-12 10:52:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:41,778 INFO L225 Difference]: With dead ends: 579 [2022-07-12 10:52:41,778 INFO L226 Difference]: Without dead ends: 468 [2022-07-12 10:52:41,779 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:41,779 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 117 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:41,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 937 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 10:52:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-07-12 10:52:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 415. [2022-07-12 10:52:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 98 states have call successors, (98), 22 states have call predecessors, (98), 29 states have return successors, (170), 96 states have call predecessors, (170), 97 states have call successors, (170) [2022-07-12 10:52:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 595 transitions. [2022-07-12 10:52:41,813 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 595 transitions. Word has length 138 [2022-07-12 10:52:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:41,814 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 595 transitions. [2022-07-12 10:52:41,814 INFO L496 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) [2022-07-12 10:52:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 595 transitions. [2022-07-12 10:52:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 10:52:41,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:41,815 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:41,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 10:52:41,816 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 148730141, now seen corresponding path program 1 times [2022-07-12 10:52:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:41,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445189260] [2022-07-12 10:52:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 10:52:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-12 10:52:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445189260] [2022-07-12 10:52:41,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445189260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:41,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:41,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:52:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700166101] [2022-07-12 10:52:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:41,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:52:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:41,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:52:41,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:52:41,996 INFO L87 Difference]: Start difference. First operand 415 states and 595 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) [2022-07-12 10:52:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:42,634 INFO L93 Difference]: Finished difference Result 588 states and 864 transitions. [2022-07-12 10:52:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:52:42,637 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 [2022-07-12 10:52:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:42,638 INFO L225 Difference]: With dead ends: 588 [2022-07-12 10:52:42,639 INFO L226 Difference]: Without dead ends: 415 [2022-07-12 10:52:42,639 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:42,640 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 85 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:42,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 795 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:52:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-12 10:52:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2022-07-12 10:52:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 287 states have (on average 1.1358885017421603) internal successors, (326), 296 states have internal predecessors, (326), 98 states have call successors, (98), 22 states have call predecessors, (98), 29 states have return successors, (170), 96 states have call predecessors, (170), 97 states have call successors, (170) [2022-07-12 10:52:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 594 transitions. [2022-07-12 10:52:42,663 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 594 transitions. Word has length 142 [2022-07-12 10:52:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:42,664 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 594 transitions. [2022-07-12 10:52:42,664 INFO L496 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) [2022-07-12 10:52:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 594 transitions. [2022-07-12 10:52:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-12 10:52:42,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:42,665 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:42,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 10:52:42,666 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1573992648, now seen corresponding path program 1 times [2022-07-12 10:52:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:42,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359725730] [2022-07-12 10:52:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:42,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 10:52:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-12 10:52:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:42,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359725730] [2022-07-12 10:52:42,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359725730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:42,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:42,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:52:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128319134] [2022-07-12 10:52:42,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:42,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:52:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:52:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:52:42,875 INFO L87 Difference]: Start difference. First operand 415 states and 594 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) [2022-07-12 10:52:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:43,483 INFO L93 Difference]: Finished difference Result 435 states and 616 transitions. [2022-07-12 10:52:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:52:43,483 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 [2022-07-12 10:52:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:43,485 INFO L225 Difference]: With dead ends: 435 [2022-07-12 10:52:43,485 INFO L226 Difference]: Without dead ends: 433 [2022-07-12 10:52:43,486 INFO L412 NwaCegarLoop]: 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 [2022-07-12 10:52:43,486 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 192 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:43,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 977 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:52:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-12 10:52:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 422. [2022-07-12 10:52:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 290 states have (on average 1.1344827586206896) internal successors, (329), 299 states have internal predecessors, (329), 101 states have call successors, (101), 23 states have call predecessors, (101), 30 states have return successors, (173), 99 states have call predecessors, (173), 100 states have call successors, (173) [2022-07-12 10:52:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2022-07-12 10:52:43,519 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 143 [2022-07-12 10:52:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:43,519 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2022-07-12 10:52:43,519 INFO L496 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) [2022-07-12 10:52:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2022-07-12 10:52:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 10:52:43,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:43,522 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:43,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 10:52:43,522 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash -874766962, now seen corresponding path program 1 times [2022-07-12 10:52:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9758047] [2022-07-12 10:52:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 10:52:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-12 10:52:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:43,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9758047] [2022-07-12 10:52:43,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9758047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:43,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:43,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:52:43,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366341366] [2022-07-12 10:52:43,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:52:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:52:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:52:43,754 INFO L87 Difference]: Start difference. First operand 422 states and 603 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) [2022-07-12 10:52:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:44,352 INFO L93 Difference]: Finished difference Result 538 states and 762 transitions. [2022-07-12 10:52:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:52:44,353 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 [2022-07-12 10:52:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:44,354 INFO L225 Difference]: With dead ends: 538 [2022-07-12 10:52:44,354 INFO L226 Difference]: Without dead ends: 358 [2022-07-12 10:52:44,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:52:44,355 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 78 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:44,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 794 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:52:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-12 10:52:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 349. [2022-07-12 10:52:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 251 states have (on average 1.1274900398406376) internal successors, (283), 259 states have internal predecessors, (283), 69 states have call successors, (69), 23 states have call predecessors, (69), 28 states have return successors, (116), 66 states have call predecessors, (116), 68 states have call successors, (116) [2022-07-12 10:52:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 468 transitions. [2022-07-12 10:52:44,374 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 468 transitions. Word has length 147 [2022-07-12 10:52:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:44,375 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 468 transitions. [2022-07-12 10:52:44,375 INFO L496 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) [2022-07-12 10:52:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 468 transitions. [2022-07-12 10:52:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 10:52:44,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:44,376 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:44,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 10:52:44,376 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1614049972, now seen corresponding path program 1 times [2022-07-12 10:52:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:44,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501679365] [2022-07-12 10:52:44,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:44,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:52:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:52:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:52:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:52:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 10:52:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-12 10:52:44,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501679365] [2022-07-12 10:52:44,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501679365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:44,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186751701] [2022-07-12 10:52:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:44,700 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:44,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 10:52:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:45,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 10:52:45,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:45,274 INFO L390 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 [2022-07-12 10:52:45,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:52:45,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 10:52:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 10:52:45,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:45,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186751701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:45,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:45,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 25 [2022-07-12 10:52:45,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516370509] [2022-07-12 10:52:45,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:45,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:52:45,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:45,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:52:45,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2022-07-12 10:52:45,728 INFO L87 Difference]: Start difference. First operand 349 states and 468 transitions. Second operand has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 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) [2022-07-12 10:52:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:46,027 INFO L93 Difference]: Finished difference Result 706 states and 1000 transitions. [2022-07-12 10:52:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:52:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 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 [2022-07-12 10:52:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:46,030 INFO L225 Difference]: With dead ends: 706 [2022-07-12 10:52:46,030 INFO L226 Difference]: Without dead ends: 470 [2022-07-12 10:52:46,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 160 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-07-12 10:52:46,031 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 86 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:46,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 3036 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 326 Unchecked, 0.2s Time] [2022-07-12 10:52:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-12 10:52:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2022-07-12 10:52:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 268 states have internal predecessors, (293), 69 states have call successors, (69), 24 states have call predecessors, (69), 28 states have return successors, (115), 66 states have call predecessors, (115), 68 states have call successors, (115) [2022-07-12 10:52:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 477 transitions. [2022-07-12 10:52:46,060 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 477 transitions. Word has length 149 [2022-07-12 10:52:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:46,060 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 477 transitions. [2022-07-12 10:52:46,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 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) [2022-07-12 10:52:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 477 transitions. [2022-07-12 10:52:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 10:52:46,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:46,062 INFO L195 NwaCegarLoop]: 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] [2022-07-12 10:52:46,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-12 10:52:46,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:46,275 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -891040382, now seen corresponding path program 1 times [2022-07-12 10:52:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:46,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544241020] [2022-07-12 10:52:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:52:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:52:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:52:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:52:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:52:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 10:52:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:52:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:52:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 10:52:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 10:52:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-12 10:52:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:46,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544241020] [2022-07-12 10:52:46,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544241020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:46,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342996562] [2022-07-12 10:52:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:46,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:46,598 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:52:46,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 10:52:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:47,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-12 10:52:47,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:47,200 INFO L390 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 [2022-07-12 10:52:47,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:52:47,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2022-07-12 10:52:47,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:47,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-07-12 10:52:47,786 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 10:52:47,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 53 [2022-07-12 10:52:47,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:47,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-07-12 10:52:47,817 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 10:52:47,823 INFO L390 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 13 treesize of output 9 [2022-07-12 10:52:48,038 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 10:52:48,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 91 [2022-07-12 10:52:48,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:52:48,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-07-12 10:52:48,863 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5059 (Array Int Int))) (= (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_5059) |c_#memory_int|)) is different from true [2022-07-12 10:52:48,871 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5059 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5059) |c_#memory_int|)) is different from true [2022-07-12 10:52:48,889 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 10:52:48,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-07-12 10:52:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 75 proven. 65 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2022-07-12 10:52:49,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:52:49,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5065 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5065) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|) 18446744073709551616) 0))) is different from false [2022-07-12 10:52:49,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342996562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:49,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:52:49,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 33] total 43 [2022-07-12 10:52:49,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026125019] [2022-07-12 10:52:49,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:52:49,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 10:52:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:49,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 10:52:49,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1913, Unknown=3, NotChecked=270, Total=2352 [2022-07-12 10:52:49,541 INFO L87 Difference]: Start difference. First operand 359 states and 477 transitions. Second operand has 43 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 14 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (35), 13 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-12 10:53:03,438 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5059 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5059) |c_#memory_int|)) (not (= |c_my_memset_#in~n| 32))) is different from true [2022-07-12 10:53:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:04,280 INFO L93 Difference]: Finished difference Result 590 states and 778 transitions. [2022-07-12 10:53:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 10:53:04,281 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 14 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (35), 13 states have call predecessors, (35), 14 states have call successors, (35) Word has length 150 [2022-07-12 10:53:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:04,283 INFO L225 Difference]: With dead ends: 590 [2022-07-12 10:53:04,283 INFO L226 Difference]: Without dead ends: 469 [2022-07-12 10:53:04,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 163 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=470, Invalid=4767, Unknown=35, NotChecked=580, Total=5852 [2022-07-12 10:53:04,285 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 264 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1609 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:04,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1737 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2443 Invalid, 0 Unknown, 1609 Unchecked, 1.5s Time] [2022-07-12 10:53:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-07-12 10:53:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 445. [2022-07-12 10:53:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 331 states have (on average 1.1238670694864048) internal successors, (372), 342 states have internal predecessors, (372), 77 states have call successors, (77), 30 states have call predecessors, (77), 36 states have return successors, (133), 72 states have call predecessors, (133), 76 states have call successors, (133) [2022-07-12 10:53:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 582 transitions. [2022-07-12 10:53:04,314 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 582 transitions. Word has length 150 [2022-07-12 10:53:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:04,314 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 582 transitions. [2022-07-12 10:53:04,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 14 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (35), 13 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-12 10:53:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 582 transitions. [2022-07-12 10:53:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 10:53:04,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:04,316 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-12 10:53:04,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-12 10:53:04,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:04,532 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash -985042663, now seen corresponding path program 1 times [2022-07-12 10:53:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:04,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731078874] [2022-07-12 10:53:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:53:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:53:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:53:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:53:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:53:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 10:53:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:53:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:53:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 10:53:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:53:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 10:53:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 10:53:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 10:53:04,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:04,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731078874] [2022-07-12 10:53:04,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731078874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:04,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:53:04,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:53:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425639623] [2022-07-12 10:53:04,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:04,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:53:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:53:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:53:04,870 INFO L87 Difference]: Start difference. First operand 445 states and 582 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 10:53:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:05,355 INFO L93 Difference]: Finished difference Result 461 states and 598 transitions. [2022-07-12 10:53:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:53:05,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2022-07-12 10:53:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:05,358 INFO L225 Difference]: With dead ends: 461 [2022-07-12 10:53:05,358 INFO L226 Difference]: Without dead ends: 459 [2022-07-12 10:53:05,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:53:05,360 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 127 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:05,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 957 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:53:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-12 10:53:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 450. [2022-07-12 10:53:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 334 states have (on average 1.122754491017964) internal successors, (375), 345 states have internal predecessors, (375), 78 states have call successors, (78), 31 states have call predecessors, (78), 37 states have return successors, (134), 73 states have call predecessors, (134), 77 states have call successors, (134) [2022-07-12 10:53:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 587 transitions. [2022-07-12 10:53:05,382 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 587 transitions. Word has length 152 [2022-07-12 10:53:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:05,382 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 587 transitions. [2022-07-12 10:53:05,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 10:53:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 587 transitions. [2022-07-12 10:53:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 10:53:05,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:05,384 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:05,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 10:53:05,385 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash -72937408, now seen corresponding path program 2 times [2022-07-12 10:53:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:05,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844901627] [2022-07-12 10:53:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:53:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:53:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:53:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:53:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:53:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 10:53:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:53:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:53:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 10:53:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 10:53:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-12 10:53:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:05,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844901627] [2022-07-12 10:53:05,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844901627] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:05,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626000072] [2022-07-12 10:53:05,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:53:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:05,720 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:53:05,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 10:53:07,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:53:07,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:53:07,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 2911 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-12 10:53:07,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:07,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:53:07,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:07,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 10:53:07,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-07-12 10:53:07,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:07,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-12 10:53:07,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:07,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-12 10:53:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 10:53:08,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:53:09,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626000072] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:09,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:53:09,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2022-07-12 10:53:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849076774] [2022-07-12 10:53:09,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:53:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 10:53:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 10:53:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=959, Unknown=1, NotChecked=0, Total=1056 [2022-07-12 10:53:09,358 INFO L87 Difference]: Start difference. First operand 450 states and 587 transitions. Second operand has 27 states, 25 states have (on average 6.04) internal successors, (151), 24 states have internal predecessors, (151), 10 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 10:53:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:11,885 INFO L93 Difference]: Finished difference Result 767 states and 1061 transitions. [2022-07-12 10:53:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 10:53:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.04) internal successors, (151), 24 states have internal predecessors, (151), 10 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 152 [2022-07-12 10:53:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:11,888 INFO L225 Difference]: With dead ends: 767 [2022-07-12 10:53:11,888 INFO L226 Difference]: Without dead ends: 575 [2022-07-12 10:53:11,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 242 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=335, Invalid=3324, Unknown=1, NotChecked=0, Total=3660 [2022-07-12 10:53:11,891 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 259 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 3498 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 4285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 3498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:11,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 3103 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 3498 Invalid, 0 Unknown, 602 Unchecked, 1.9s Time] [2022-07-12 10:53:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-07-12 10:53:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 466. [2022-07-12 10:53:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 347 states have (on average 1.1268011527377522) internal successors, (391), 358 states have internal predecessors, (391), 81 states have call successors, (81), 32 states have call predecessors, (81), 37 states have return successors, (140), 75 states have call predecessors, (140), 80 states have call successors, (140) [2022-07-12 10:53:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 612 transitions. [2022-07-12 10:53:11,920 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 612 transitions. Word has length 152 [2022-07-12 10:53:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:11,921 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 612 transitions. [2022-07-12 10:53:11,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.04) internal successors, (151), 24 states have internal predecessors, (151), 10 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 10:53:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 612 transitions. [2022-07-12 10:53:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 10:53:11,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:11,924 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:11,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-12 10:53:12,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:12,139 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1657527114, now seen corresponding path program 1 times [2022-07-12 10:53:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:12,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646299777] [2022-07-12 10:53:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:53:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:53:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:53:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:53:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:53:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:53:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:53:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:53:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 10:53:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-12 10:53:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:12,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646299777] [2022-07-12 10:53:12,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646299777] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:12,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866316912] [2022-07-12 10:53:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:12,484 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:53:12,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-12 10:53:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-12 10:53:13,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:13,104 INFO L390 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 [2022-07-12 10:53:13,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:53:13,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 10:53:13,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 10:53:13,713 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 10:53:13,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2022-07-12 10:53:13,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-12 10:53:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 10:53:13,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:13,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866316912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:13,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:13,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 29 [2022-07-12 10:53:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970844791] [2022-07-12 10:53:13,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:13,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 10:53:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 10:53:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-07-12 10:53:13,744 INFO L87 Difference]: Start difference. First operand 466 states and 612 transitions. Second operand has 17 states, 16 states have (on average 5.375) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-12 10:53:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:14,663 INFO L93 Difference]: Finished difference Result 822 states and 1117 transitions. [2022-07-12 10:53:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:53:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 153 [2022-07-12 10:53:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:14,666 INFO L225 Difference]: With dead ends: 822 [2022-07-12 10:53:14,666 INFO L226 Difference]: Without dead ends: 562 [2022-07-12 10:53:14,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2022-07-12 10:53:14,668 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 158 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:14,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1670 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1361 Invalid, 0 Unknown, 575 Unchecked, 0.8s Time] [2022-07-12 10:53:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-07-12 10:53:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 464. [2022-07-12 10:53:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 341 states have (on average 1.1173020527859236) internal successors, (381), 351 states have internal predecessors, (381), 82 states have call successors, (82), 35 states have call predecessors, (82), 40 states have return successors, (136), 77 states have call predecessors, (136), 81 states have call successors, (136) [2022-07-12 10:53:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 599 transitions. [2022-07-12 10:53:14,696 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 599 transitions. Word has length 153 [2022-07-12 10:53:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:14,696 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 599 transitions. [2022-07-12 10:53:14,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-12 10:53:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 599 transitions. [2022-07-12 10:53:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 10:53:14,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:14,698 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:14,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-12 10:53:14,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:14,911 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:14,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1748475022, now seen corresponding path program 1 times [2022-07-12 10:53:14,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:14,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752970139] [2022-07-12 10:53:14,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:14,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:53:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:53:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:53:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:53:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 10:53:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-12 10:53:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:15,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752970139] [2022-07-12 10:53:15,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752970139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:15,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858232433] [2022-07-12 10:53:15,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:15,241 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:53:15,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-12 10:53:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:15,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 2896 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-12 10:53:15,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:15,943 INFO L390 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 [2022-07-12 10:53:16,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:53:16,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-12 10:53:16,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:16,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-07-12 10:53:16,844 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_25| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_25|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_10|) 16)) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_10|)))) is different from true [2022-07-12 10:53:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 123 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 1 not checked. [2022-07-12 10:53:22,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:53:24,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5958 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5958) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-12 10:53:24,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858232433] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:24,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:53:24,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2022-07-12 10:53:24,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29702761] [2022-07-12 10:53:24,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:53:24,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 10:53:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 10:53:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=846, Unknown=3, NotChecked=118, Total=1056 [2022-07-12 10:53:24,459 INFO L87 Difference]: Start difference. First operand 464 states and 599 transitions. Second operand has 28 states, 25 states have (on average 5.6) internal successors, (140), 24 states have internal predecessors, (140), 9 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 7 states have call predecessors, (33), 9 states have call successors, (33) [2022-07-12 10:53:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:29,550 INFO L93 Difference]: Finished difference Result 707 states and 919 transitions. [2022-07-12 10:53:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 10:53:29,550 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 5.6) internal successors, (140), 24 states have internal predecessors, (140), 9 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 7 states have call predecessors, (33), 9 states have call successors, (33) Word has length 157 [2022-07-12 10:53:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:29,552 INFO L225 Difference]: With dead ends: 707 [2022-07-12 10:53:29,552 INFO L226 Difference]: Without dead ends: 476 [2022-07-12 10:53:29,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=261, Invalid=2601, Unknown=8, NotChecked=210, Total=3080 [2022-07-12 10:53:29,554 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 203 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1691 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:29,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1529 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1789 Invalid, 0 Unknown, 1691 Unchecked, 1.1s Time] [2022-07-12 10:53:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-12 10:53:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 459. [2022-07-12 10:53:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 336 states have (on average 1.1130952380952381) internal successors, (374), 346 states have internal predecessors, (374), 82 states have call successors, (82), 35 states have call predecessors, (82), 40 states have return successors, (136), 77 states have call predecessors, (136), 81 states have call successors, (136) [2022-07-12 10:53:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 592 transitions. [2022-07-12 10:53:29,581 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 592 transitions. Word has length 157 [2022-07-12 10:53:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:29,581 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 592 transitions. [2022-07-12 10:53:29,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 5.6) internal successors, (140), 24 states have internal predecessors, (140), 9 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 7 states have call predecessors, (33), 9 states have call successors, (33) [2022-07-12 10:53:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 592 transitions. [2022-07-12 10:53:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 10:53:29,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:29,583 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:29,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-12 10:53:29,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:29,805 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1137539253, now seen corresponding path program 1 times [2022-07-12 10:53:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:29,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669882343] [2022-07-12 10:53:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:53:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:53:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:53:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:53:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 10:53:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 10:53:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 10:53:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-12 10:53:30,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669882343] [2022-07-12 10:53:30,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669882343] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15758240] [2022-07-12 10:53:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:30,308 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:53:30,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-12 10:53:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:30,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 3003 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 10:53:30,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:31,259 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:53:31,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 10:53:31,266 INFO L390 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 7 treesize of output 5 [2022-07-12 10:53:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 154 proven. 24 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 10:53:32,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:53:33,010 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6254 (Array Int Int)) (|ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base| Int)) (let ((.cse1 (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base| v_ArrVal_6254) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base|))) (let ((.cse0 (mod (select .cse1 (+ |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset| 16)) 18446744073709551616))) (or (= .cse0 0) (not (= 0 (mod (select v_ArrVal_6254 |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset|) 18446744073709551616))) (not (< .cse0 (mod (select .cse1 |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset|) 18446744073709551616))))))) is different from false [2022-07-12 10:53:33,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15758240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:33,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:53:33,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 35 [2022-07-12 10:53:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254707395] [2022-07-12 10:53:33,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:53:33,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 10:53:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 10:53:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1912, Unknown=1, NotChecked=88, Total=2162 [2022-07-12 10:53:33,022 INFO L87 Difference]: Start difference. First operand 459 states and 592 transitions. Second operand has 35 states, 33 states have (on average 4.666666666666667) internal successors, (154), 32 states have internal predecessors, (154), 10 states have call successors, (34), 6 states have call predecessors, (34), 10 states have return successors, (33), 9 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-12 10:53:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:38,160 INFO L93 Difference]: Finished difference Result 817 states and 1105 transitions. [2022-07-12 10:53:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 10:53:38,161 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 4.666666666666667) internal successors, (154), 32 states have internal predecessors, (154), 10 states have call successors, (34), 6 states have call predecessors, (34), 10 states have return successors, (33), 9 states have call predecessors, (33), 10 states have call successors, (33) Word has length 159 [2022-07-12 10:53:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:38,163 INFO L225 Difference]: With dead ends: 817 [2022-07-12 10:53:38,163 INFO L226 Difference]: Without dead ends: 564 [2022-07-12 10:53:38,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 259 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=668, Invalid=5459, Unknown=39, NotChecked=154, Total=6320 [2022-07-12 10:53:38,166 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 395 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 6276 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 7406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 6276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:38,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2516 Invalid, 7406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 6276 Invalid, 0 Unknown, 730 Unchecked, 3.5s Time] [2022-07-12 10:53:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-07-12 10:53:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 459. [2022-07-12 10:53:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 336 states have (on average 1.1071428571428572) internal successors, (372), 346 states have internal predecessors, (372), 82 states have call successors, (82), 35 states have call predecessors, (82), 40 states have return successors, (135), 77 states have call predecessors, (135), 81 states have call successors, (135) [2022-07-12 10:53:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 589 transitions. [2022-07-12 10:53:38,208 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 589 transitions. Word has length 159 [2022-07-12 10:53:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:38,208 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 589 transitions. [2022-07-12 10:53:38,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 4.666666666666667) internal successors, (154), 32 states have internal predecessors, (154), 10 states have call successors, (34), 6 states have call predecessors, (34), 10 states have return successors, (33), 9 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-12 10:53:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 589 transitions. [2022-07-12 10:53:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 10:53:38,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:38,210 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:38,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-12 10:53:38,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-12 10:53:38,431 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1595947110, now seen corresponding path program 2 times [2022-07-12 10:53:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:38,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476817089] [2022-07-12 10:53:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:53:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:53:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 10:53:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:53:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:53:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 10:53:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 10:53:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:53:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 10:53:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 10:53:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 10:53:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 69 proven. 46 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 10:53:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476817089] [2022-07-12 10:53:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476817089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026487300] [2022-07-12 10:53:40,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:53:40,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:40,025 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:53:40,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-12 10:53:41,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:53:41,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:53:41,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 3008 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-12 10:53:41,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:41,178 INFO L390 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 [2022-07-12 10:53:41,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:53:41,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:53:41,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 10:53:41,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 10:53:42,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:53:42,539 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:53:42,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 10:53:42,553 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:53:42,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-12 10:53:43,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-12 10:53:43,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-12 10:53:43,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:43,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2022-07-12 10:53:43,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:43,101 INFO L356 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2022-07-12 10:53:43,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 122 [2022-07-12 10:53:43,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:43,126 INFO L356 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2022-07-12 10:53:43,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 147 [2022-07-12 10:53:43,130 INFO L390 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 147 treesize of output 139 [2022-07-12 10:53:43,132 INFO L390 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 139 treesize of output 131 [2022-07-12 10:53:43,136 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 10:53:43,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-12 10:53:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-12 10:53:43,337 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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) [2022-07-12 10:53:43,339 INFO L158 Benchmark]: Toolchain (without parser) took 111296.95ms. Allocated memory was 113.2MB in the beginning and 918.6MB in the end (delta: 805.3MB). Free memory was 75.3MB in the beginning and 686.2MB in the end (delta: -611.0MB). Peak memory consumption was 194.3MB. Max. memory is 16.1GB. [2022-07-12 10:53:43,339 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:53:43,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1641.86ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 75.0MB in the beginning and 76.6MB in the end (delta: -1.6MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2022-07-12 10:53:43,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.60ms. Allocated memory is still 167.8MB. Free memory was 76.6MB in the beginning and 110.8MB in the end (delta: -34.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 10:53:43,340 INFO L158 Benchmark]: Boogie Preprocessor took 45.19ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 103.3MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 10:53:43,340 INFO L158 Benchmark]: RCFGBuilder took 1235.04ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 103.3MB in the beginning and 222.4MB in the end (delta: -119.1MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2022-07-12 10:53:43,340 INFO L158 Benchmark]: TraceAbstraction took 108232.26ms. Allocated memory was 293.6MB in the beginning and 918.6MB in the end (delta: 625.0MB). Free memory was 222.4MB in the beginning and 686.2MB in the end (delta: -463.8MB). Peak memory consumption was 160.1MB. Max. memory is 16.1GB. [2022-07-12 10:53:43,341 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.14ms. Allocated memory is still 113.2MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1641.86ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 75.0MB in the beginning and 76.6MB in the end (delta: -1.6MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.60ms. Allocated memory is still 167.8MB. Free memory was 76.6MB in the beginning and 110.8MB in the end (delta: -34.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.19ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 103.3MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1235.04ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 103.3MB in the beginning and 222.4MB in the end (delta: -119.1MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. * TraceAbstraction took 108232.26ms. Allocated memory was 293.6MB in the beginning and 918.6MB in the end (delta: 625.0MB). Free memory was 222.4MB in the beginning and 686.2MB in the end (delta: -463.8MB). Peak memory consumption was 160.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 10:53:43,368 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.2-?-6c24879 [2022-07-12 10:53:45,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:53:45,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:53:45,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:53:45,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:53:45,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:53:45,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:53:45,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:53:45,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:53:45,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:53:45,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:53:45,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:53:45,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:53:45,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:53:45,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:53:45,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:53:45,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:53:45,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:53:45,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:53:45,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:53:45,074 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:53:45,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:53:45,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:53:45,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:53:45,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:53:45,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:53:45,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:53:45,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:53:45,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:53:45,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:53:45,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:53:45,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:53:45,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:53:45,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:53:45,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:53:45,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:53:45,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:53:45,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:53:45,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:53:45,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:53:45,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:53:45,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:53:45,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 10:53:45,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:53:45,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:53:45,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:53:45,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:53:45,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:53:45,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:53:45,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:53:45,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:53:45,123 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:53:45,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:53:45,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:53:45,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:53:45,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:53:45,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:53:45,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:53:45,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:53:45,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:53:45,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:53:45,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:53:45,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:53:45,126 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 10:53:45,126 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 10:53:45,126 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:53:45,126 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:53:45,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:53:45,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 10:53:45,127 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 [2022-07-12 10:53:45,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:53:45,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:53:45,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:53:45,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:53:45,401 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:53:45,402 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 [2022-07-12 10:53:45,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3808c0d8/76012606409944a39e95c962b56b0005/FLAG31c442fcd [2022-07-12 10:53:46,028 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:53:46,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-12 10:53:46,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3808c0d8/76012606409944a39e95c962b56b0005/FLAG31c442fcd [2022-07-12 10:53:46,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3808c0d8/76012606409944a39e95c962b56b0005 [2022-07-12 10:53:46,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:53:46,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:53:46,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:53:46,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:53:46,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:53:46,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:53:46" (1/1) ... [2022-07-12 10:53:46,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1578fbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:53:46, skipping insertion in model container [2022-07-12 10:53:46,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:53:46" (1/1) ... [2022-07-12 10:53:46,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:53:46,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:53:46,568 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] [2022-07-12 10:53:46,571 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] [2022-07-12 10:53:47,068 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,069 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,069 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,070 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,070 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,078 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,078 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,079 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,080 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:53:47,287 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:53:47,288 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:53:47,288 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:53:47,289 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:53:47,290 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:53:47,290 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:53:47,291 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:53:47,291 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:53:47,292 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:53:47,292 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:53:47,374 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:53:47,387 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1384) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:249) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.translateInitializer(CHandler.java:2978) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2836) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2138) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) 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) [2022-07-12 10:53:47,390 INFO L158 Benchmark]: Toolchain (without parser) took 1200.80ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 46.7MB in the beginning and 62.6MB in the end (delta: -15.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-07-12 10:53:47,391 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory was 54.1MB in the beginning and 54.0MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:53:47,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1199.57ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 46.7MB in the beginning and 62.6MB in the end (delta: -15.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-07-12 10:53:47,392 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.14ms. Allocated memory is still 73.4MB. Free memory was 54.1MB in the beginning and 54.0MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1199.57ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 46.7MB in the beginning and 62.6MB in the end (delta: -15.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range