./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_eq_c_str_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 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 23:49:52,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 23:49:52,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 23:49:52,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 23:49:52,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 23:49:52,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 23:49:52,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 23:49:52,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 23:49:52,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 23:49:52,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 23:49:52,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 23:49:52,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 23:49:52,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 23:49:52,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 23:49:52,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 23:49:52,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 23:49:52,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 23:49:52,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 23:49:52,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 23:49:52,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 23:49:53,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 23:49:53,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 23:49:53,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 23:49:53,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 23:49:53,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 23:49:53,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 23:49:53,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 23:49:53,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 23:49:53,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 23:49:53,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 23:49:53,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 23:49:53,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 23:49:53,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 23:49:53,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 23:49:53,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 23:49:53,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 23:49:53,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 23:49:53,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 23:49:53,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 23:49:53,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 23:49:53,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 23:49:53,022 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-17 23:49:53,057 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 23:49:53,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 23:49:53,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 23:49:53,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 23:49:53,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 23:49:53,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 23:49:53,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 23:49:53,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 23:49:53,063 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 23:49:53,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 23:49:53,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 23:49:53,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 23:49:53,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 23:49:53,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 23:49:53,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 23:49:53,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 23:49:53,065 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 23:49:53,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 23:49:53,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 23:49:53,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 23:49:53,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 23:49:53,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:49:53,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 23:49:53,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 23:49:53,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 23:49:53,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 23:49:53,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 23:49:53,067 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 23:49:53,067 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 23:49:53,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 23:49:53,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 23:49:53,068 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 -> 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 [2021-12-17 23:49:53,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 23:49:53,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 23:49:53,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 23:49:53,311 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 23:49:53,311 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 23:49:53,313 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_eq_c_str_harness.i [2021-12-17 23:49:53,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56697c34c/59ec0e1d12294608a2a8910279290d91/FLAGcf672533a [2021-12-17 23:49:54,037 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 23:49:54,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i [2021-12-17 23:49:54,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56697c34c/59ec0e1d12294608a2a8910279290d91/FLAGcf672533a [2021-12-17 23:49:54,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56697c34c/59ec0e1d12294608a2a8910279290d91 [2021-12-17 23:49:54,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 23:49:54,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 23:49:54,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 23:49:54,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 23:49:54,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 23:49:54,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:49:54" (1/1) ... [2021-12-17 23:49:54,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa9fd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:54, skipping insertion in model container [2021-12-17 23:49:54,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:49:54" (1/1) ... [2021-12-17 23:49:54,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 23:49:54,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 23:49:54,735 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_eq_c_str_harness.i[4495,4508] [2021-12-17 23:49:54,742 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_eq_c_str_harness.i[4555,4568] [2021-12-17 23:49:55,443 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,444 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,444 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,445 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,446 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,457 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,458 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,460 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,461 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:55,715 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-17 23:49:55,717 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-17 23:49:55,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-17 23:49:55,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-17 23:49:55,720 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-17 23:49:55,721 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-17 23:49:55,721 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-17 23:49:55,722 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-17 23:49:55,722 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-17 23:49:55,723 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-17 23:49:55,887 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-17 23:49:56,017 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,018 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:49:56,135 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 23:49:56,157 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_eq_c_str_harness.i[4495,4508] [2021-12-17 23:49:56,159 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_eq_c_str_harness.i[4555,4568] [2021-12-17 23:49:56,189 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,189 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,189 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,189 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,190 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,198 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,198 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,200 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,201 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,229 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-17 23:49:56,230 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-17 23:49:56,230 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-17 23:49:56,231 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-17 23:49:56,233 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-17 23:49:56,234 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-17 23:49:56,234 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-17 23:49:56,235 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-17 23:49:56,235 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-17 23:49:56,235 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-17 23:49:56,264 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-17 23:49:56,357 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,357 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-17 23:49:56,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:49:56,630 INFO L208 MainTranslator]: Completed translation [2021-12-17 23:49:56,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56 WrapperNode [2021-12-17 23:49:56,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 23:49:56,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 23:49:56,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 23:49:56,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 23:49:56,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,833 INFO L137 Inliner]: procedures = 691, calls = 2639, calls flagged for inlining = 64, calls inlined = 10, statements flattened = 904 [2021-12-17 23:49:56,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 23:49:56,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 23:49:56,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 23:49:56,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 23:49:56,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 23:49:56,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 23:49:56,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 23:49:56,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 23:49:56,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (1/1) ... [2021-12-17 23:49:56,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:49:56,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:49:56,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 23:49:57,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 23:49:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2021-12-17 23:49:57,022 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2021-12-17 23:49:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-17 23:49:57,022 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-17 23:49:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 23:49:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-17 23:49:57,023 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-17 23:49:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 23:49:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 23:49:57,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 23:49:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 23:49:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 23:49:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2021-12-17 23:49:57,026 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2021-12-17 23:49:57,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 23:49:57,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 23:49:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 23:49:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-17 23:49:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-17 23:49:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-12-17 23:49:57,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-12-17 23:49:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 23:49:57,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 23:49:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 23:49:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 23:49:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 23:49:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-17 23:49:57,029 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-17 23:49:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-17 23:49:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-17 23:49:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 23:49:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 23:49:57,296 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 23:49:57,298 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 23:49:58,088 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 23:49:58,097 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 23:49:58,098 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 23:49:58,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:49:58 BoogieIcfgContainer [2021-12-17 23:49:58,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 23:49:58,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 23:49:58,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 23:49:58,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 23:49:58,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:49:54" (1/3) ... [2021-12-17 23:49:58,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d203fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:49:58, skipping insertion in model container [2021-12-17 23:49:58,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:49:56" (2/3) ... [2021-12-17 23:49:58,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d203fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:49:58, skipping insertion in model container [2021-12-17 23:49:58,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:49:58" (3/3) ... [2021-12-17 23:49:58,110 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_c_str_harness.i [2021-12-17 23:49:58,117 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 23:49:58,117 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 23:49:58,169 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 23:49:58,187 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 23:49:58,188 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 23:49:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 96 states have internal predecessors, (118), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-17 23:49:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-17 23:49:58,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:49:58,222 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:49:58,223 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:49:58,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:49:58,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1244186500, now seen corresponding path program 1 times [2021-12-17 23:49:58,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:49:58,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941613090] [2021-12-17 23:49:58,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:49:58,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:49:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:49:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:49:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:49:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:49:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:49:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:49:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:49:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:49:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:49:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:49:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-17 23:49:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:49:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-17 23:49:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:49:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:49:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:49:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:58,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 23:49:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:49:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:49:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 23:49:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-12-17 23:49:59,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:49:59,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941613090] [2021-12-17 23:49:59,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941613090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:49:59,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:49:59,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:49:59,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228188829] [2021-12-17 23:49:59,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:49:59,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:49:59,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:49:59,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:49:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:49:59,097 INFO L87 Difference]: Start difference. First operand has 142 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 96 states have internal predecessors, (118), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:49:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:49:59,512 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2021-12-17 23:49:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:49:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2021-12-17 23:49:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:49:59,526 INFO L225 Difference]: With dead ends: 281 [2021-12-17 23:49:59,526 INFO L226 Difference]: Without dead ends: 139 [2021-12-17 23:49:59,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:49:59,542 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 119 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:49:59,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 257 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 23:49:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-17 23:49:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2021-12-17 23:49:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 91 states have internal predecessors, (110), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-17 23:49:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2021-12-17 23:49:59,611 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 127 [2021-12-17 23:49:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:49:59,611 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2021-12-17 23:49:59,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:49:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2021-12-17 23:49:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-17 23:49:59,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:49:59,624 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:49:59,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 23:49:59,625 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:49:59,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:49:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1259852002, now seen corresponding path program 1 times [2021-12-17 23:49:59,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:49:59,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208567466] [2021-12-17 23:49:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:49:59,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:49:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:49:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:49:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:49:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:49:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:49:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:49:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:49:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:49:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:49:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:49:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-17 23:50:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:50:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-17 23:50:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:50:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:50:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 23:50:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 23:50:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2021-12-17 23:50:00,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:00,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208567466] [2021-12-17 23:50:00,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208567466] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:00,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372186504] [2021-12-17 23:50:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:00,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:00,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:00,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:00,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 23:50:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:00,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 23:50:00,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-17 23:50:01,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:01,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372186504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:01,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:01,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-17 23:50:01,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81089060] [2021-12-17 23:50:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:01,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:50:01,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:01,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:50:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:50:01,010 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-17 23:50:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:01,221 INFO L93 Difference]: Finished difference Result 244 states and 327 transitions. [2021-12-17 23:50:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:50:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 127 [2021-12-17 23:50:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:01,224 INFO L225 Difference]: With dead ends: 244 [2021-12-17 23:50:01,224 INFO L226 Difference]: Without dead ends: 140 [2021-12-17 23:50:01,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:50:01,226 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 208 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:01,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 370 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:50:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-17 23:50:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-12-17 23:50:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 94 states have internal predecessors, (112), 36 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (37), 35 states have call predecessors, (37), 35 states have call successors, (37) [2021-12-17 23:50:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2021-12-17 23:50:01,241 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 127 [2021-12-17 23:50:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:01,241 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2021-12-17 23:50:01,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-17 23:50:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2021-12-17 23:50:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-17 23:50:01,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:01,243 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1] [2021-12-17 23:50:01,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:01,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:01,472 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2087307667, now seen corresponding path program 1 times [2021-12-17 23:50:01,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:01,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062024474] [2021-12-17 23:50:01,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:01,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:50:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:50:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:50:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 23:50:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-17 23:50:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2021-12-17 23:50:01,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:01,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062024474] [2021-12-17 23:50:01,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062024474] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:01,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136825648] [2021-12-17 23:50:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:01,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:01,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:01,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 23:50:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:02,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 23:50:02,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-17 23:50:02,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:02,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136825648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:02,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:02,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-17 23:50:02,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547558747] [2021-12-17 23:50:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:02,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:50:02,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:02,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:50:02,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-17 23:50:02,709 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-17 23:50:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:02,943 INFO L93 Difference]: Finished difference Result 231 states and 306 transitions. [2021-12-17 23:50:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:50:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 133 [2021-12-17 23:50:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:02,950 INFO L225 Difference]: With dead ends: 231 [2021-12-17 23:50:02,950 INFO L226 Difference]: Without dead ends: 137 [2021-12-17 23:50:02,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-12-17 23:50:02,951 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 232 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:02,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 597 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 23:50:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-17 23:50:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-12-17 23:50:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.211111111111111) internal successors, (109), 91 states have internal predecessors, (109), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-17 23:50:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2021-12-17 23:50:02,962 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 133 [2021-12-17 23:50:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:02,962 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2021-12-17 23:50:02,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-17 23:50:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2021-12-17 23:50:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-17 23:50:02,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:02,964 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:02,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:03,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-17 23:50:03,181 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 388826435, now seen corresponding path program 1 times [2021-12-17 23:50:03,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908671099] [2021-12-17 23:50:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:03,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:50:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:50:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 23:50:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:50:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-17 23:50:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2021-12-17 23:50:03,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:03,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908671099] [2021-12-17 23:50:03,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908671099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:03,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:50:03,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:50:03,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552348542] [2021-12-17 23:50:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:03,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:50:03,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:03,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:50:03,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:50:03,605 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2021-12-17 23:50:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:04,169 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2021-12-17 23:50:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:50:04,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2021-12-17 23:50:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:04,172 INFO L225 Difference]: With dead ends: 151 [2021-12-17 23:50:04,172 INFO L226 Difference]: Without dead ends: 149 [2021-12-17 23:50:04,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-12-17 23:50:04,173 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 147 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:04,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 915 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 23:50:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-17 23:50:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-12-17 23:50:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 98 states have internal predecessors, (115), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2021-12-17 23:50:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2021-12-17 23:50:04,186 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 145 [2021-12-17 23:50:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:04,187 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2021-12-17 23:50:04,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2021-12-17 23:50:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2021-12-17 23:50:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-17 23:50:04,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:04,189 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:04,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 23:50:04,190 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:04,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1495986421, now seen corresponding path program 1 times [2021-12-17 23:50:04,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:04,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988454127] [2021-12-17 23:50:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:04,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:50:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:50:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 23:50:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:50:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-17 23:50:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-12-17 23:50:04,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:04,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988454127] [2021-12-17 23:50:04,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988454127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:04,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:50:04,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:50:04,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355872458] [2021-12-17 23:50:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:04,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:50:04,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:50:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:50:04,733 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2021-12-17 23:50:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:05,216 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2021-12-17 23:50:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:50:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2021-12-17 23:50:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:05,218 INFO L225 Difference]: With dead ends: 286 [2021-12-17 23:50:05,219 INFO L226 Difference]: Without dead ends: 173 [2021-12-17 23:50:05,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:50:05,220 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 214 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:05,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 422 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 23:50:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-17 23:50:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 151. [2021-12-17 23:50:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2021-12-17 23:50:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2021-12-17 23:50:05,232 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 149 [2021-12-17 23:50:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:05,232 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2021-12-17 23:50:05,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2021-12-17 23:50:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2021-12-17 23:50:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-17 23:50:05,234 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:05,234 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:05,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 23:50:05,234 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1237820983, now seen corresponding path program 1 times [2021-12-17 23:50:05,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:05,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164966153] [2021-12-17 23:50:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:05,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:50:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:50:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 23:50:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:50:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-17 23:50:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-12-17 23:50:05,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:05,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164966153] [2021-12-17 23:50:05,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164966153] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:05,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420403363] [2021-12-17 23:50:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:05,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:05,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:05,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:05,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 23:50:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:06,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 2786 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-17 23:50:06,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:06,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:50:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-17 23:50:06,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:06,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420403363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:06,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:06,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2021-12-17 23:50:06,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869485368] [2021-12-17 23:50:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:06,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 23:50:06,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:06,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 23:50:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-12-17 23:50:06,971 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 10 states have internal predecessors, (71), 5 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2021-12-17 23:50:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:07,031 INFO L93 Difference]: Finished difference Result 292 states and 385 transitions. [2021-12-17 23:50:07,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 23:50:07,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 10 states have internal predecessors, (71), 5 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 149 [2021-12-17 23:50:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:07,032 INFO L225 Difference]: With dead ends: 292 [2021-12-17 23:50:07,032 INFO L226 Difference]: Without dead ends: 170 [2021-12-17 23:50:07,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 179 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-12-17 23:50:07,034 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 32 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:07,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 831 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2021-12-17 23:50:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-17 23:50:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-12-17 23:50:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.218487394957983) internal successors, (145), 121 states have internal predecessors, (145), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2021-12-17 23:50:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 222 transitions. [2021-12-17 23:50:07,044 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 222 transitions. Word has length 149 [2021-12-17 23:50:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:07,044 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 222 transitions. [2021-12-17 23:50:07,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 10 states have internal predecessors, (71), 5 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2021-12-17 23:50:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2021-12-17 23:50:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-17 23:50:07,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:07,046 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:07,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:07,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:07,272 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2008554549, now seen corresponding path program 1 times [2021-12-17 23:50:07,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:07,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94865163] [2021-12-17 23:50:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:07,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 23:50:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 23:50:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 23:50:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:50:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-17 23:50:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-17 23:50:07,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94865163] [2021-12-17 23:50:07,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94865163] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143365288] [2021-12-17 23:50:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:07,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:07,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:07,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 23:50:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 23:50:08,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-12-17 23:50:08,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:08,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143365288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:08,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:08,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-17 23:50:08,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675555947] [2021-12-17 23:50:08,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:08,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:50:08,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:08,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:50:08,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:50:08,290 INFO L87 Difference]: Start difference. First operand 170 states and 222 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:50:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:08,314 INFO L93 Difference]: Finished difference Result 301 states and 400 transitions. [2021-12-17 23:50:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:50:08,315 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2021-12-17 23:50:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:08,319 INFO L225 Difference]: With dead ends: 301 [2021-12-17 23:50:08,319 INFO L226 Difference]: Without dead ends: 179 [2021-12-17 23:50:08,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:50:08,321 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 20 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:08,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:50:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-17 23:50:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162. [2021-12-17 23:50:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 113 states have internal predecessors, (136), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (39), 36 states have call predecessors, (39), 36 states have call successors, (39) [2021-12-17 23:50:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2021-12-17 23:50:08,338 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 149 [2021-12-17 23:50:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:08,339 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2021-12-17 23:50:08,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:50:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2021-12-17 23:50:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-17 23:50:08,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:08,341 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:08,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:08,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:08,563 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1622537167, now seen corresponding path program 2 times [2021-12-17 23:50:08,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:08,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462409863] [2021-12-17 23:50:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:08,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 23:50:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 23:50:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 23:50:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-17 23:50:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-17 23:50:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:09,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-17 23:50:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:09,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 23:50:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:09,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-17 23:50:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-17 23:50:09,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:09,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462409863] [2021-12-17 23:50:09,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462409863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76460767] [2021-12-17 23:50:09,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 23:50:09,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:09,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:09,040 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:09,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 23:50:09,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 23:50:09,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:50:09,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-17 23:50:09,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:09,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:50:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-17 23:50:10,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:10,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76460767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:10,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:10,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2021-12-17 23:50:10,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49118734] [2021-12-17 23:50:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:10,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 23:50:10,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 23:50:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-12-17 23:50:10,663 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-17 23:50:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:11,104 INFO L93 Difference]: Finished difference Result 365 states and 493 transitions. [2021-12-17 23:50:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 23:50:11,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 153 [2021-12-17 23:50:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:11,106 INFO L225 Difference]: With dead ends: 365 [2021-12-17 23:50:11,106 INFO L226 Difference]: Without dead ends: 255 [2021-12-17 23:50:11,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2021-12-17 23:50:11,108 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 108 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:11,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 666 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 268 Invalid, 0 Unknown, 192 Unchecked, 0.3s Time] [2021-12-17 23:50:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-12-17 23:50:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 192. [2021-12-17 23:50:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 138 states have internal predecessors, (163), 41 states have call successors, (41), 13 states have call predecessors, (41), 15 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49) [2021-12-17 23:50:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 253 transitions. [2021-12-17 23:50:11,119 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 253 transitions. Word has length 153 [2021-12-17 23:50:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:11,119 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 253 transitions. [2021-12-17 23:50:11,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-17 23:50:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2021-12-17 23:50:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-17 23:50:11,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:11,121 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-17 23:50:11,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:11,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:11,347 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1022191658, now seen corresponding path program 1 times [2021-12-17 23:50:11,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921358871] [2021-12-17 23:50:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:11,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:50:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:50:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 23:50:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-17 23:50:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2021-12-17 23:50:11,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:11,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921358871] [2021-12-17 23:50:11,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921358871] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:11,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776813694] [2021-12-17 23:50:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:11,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:11,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:11,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 23:50:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 2803 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 23:50:12,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-12-17 23:50:12,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:12,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776813694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:12,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:12,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-17 23:50:12,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102037856] [2021-12-17 23:50:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:12,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:50:12,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:50:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:50:12,290 INFO L87 Difference]: Start difference. First operand 192 states and 253 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:50:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:12,317 INFO L93 Difference]: Finished difference Result 367 states and 489 transitions. [2021-12-17 23:50:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:50:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2021-12-17 23:50:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:12,321 INFO L225 Difference]: With dead ends: 367 [2021-12-17 23:50:12,321 INFO L226 Difference]: Without dead ends: 208 [2021-12-17 23:50:12,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:50:12,322 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:12,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 525 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:50:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-17 23:50:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 196. [2021-12-17 23:50:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.2014388489208634) internal successors, (167), 142 states have internal predecessors, (167), 41 states have call successors, (41), 13 states have call predecessors, (41), 15 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49) [2021-12-17 23:50:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 257 transitions. [2021-12-17 23:50:12,333 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 257 transitions. Word has length 155 [2021-12-17 23:50:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:12,333 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 257 transitions. [2021-12-17 23:50:12,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:50:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 257 transitions. [2021-12-17 23:50:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-17 23:50:12,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:12,335 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:12,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:12,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:12,552 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash 607379738, now seen corresponding path program 1 times [2021-12-17 23:50:12,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:12,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707660050] [2021-12-17 23:50:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:12,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:50:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:50:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 23:50:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-17 23:50:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-12-17 23:50:12,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707660050] [2021-12-17 23:50:12,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707660050] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507211035] [2021-12-17 23:50:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:12,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:12,809 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:12,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 23:50:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:13,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 23:50:13,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-12-17 23:50:13,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:13,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507211035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:13,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:13,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-17 23:50:13,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799790491] [2021-12-17 23:50:13,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:13,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:50:13,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:50:13,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:50:13,527 INFO L87 Difference]: Start difference. First operand 196 states and 257 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:50:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:13,550 INFO L93 Difference]: Finished difference Result 381 states and 503 transitions. [2021-12-17 23:50:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:50:13,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2021-12-17 23:50:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:13,552 INFO L225 Difference]: With dead ends: 381 [2021-12-17 23:50:13,553 INFO L226 Difference]: Without dead ends: 218 [2021-12-17 23:50:13,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:50:13,554 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 26 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:13,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 540 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:50:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-17 23:50:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2021-12-17 23:50:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 140 states have internal predecessors, (162), 41 states have call successors, (41), 13 states have call predecessors, (41), 15 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49) [2021-12-17 23:50:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 252 transitions. [2021-12-17 23:50:13,565 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 252 transitions. Word has length 155 [2021-12-17 23:50:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:13,565 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 252 transitions. [2021-12-17 23:50:13,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 23:50:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 252 transitions. [2021-12-17 23:50:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-17 23:50:13,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:13,568 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:13,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:13,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:13,792 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:13,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1958764956, now seen corresponding path program 1 times [2021-12-17 23:50:13,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:13,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732132952] [2021-12-17 23:50:13,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:13,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:50:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 23:50:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:50:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 23:50:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-17 23:50:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2021-12-17 23:50:14,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:14,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732132952] [2021-12-17 23:50:14,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732132952] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:14,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747047790] [2021-12-17 23:50:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:14,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:14,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:14,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:14,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 23:50:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:15,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 2800 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-17 23:50:15,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:15,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:50:15,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:50:15,931 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-17 23:50:15,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2021-12-17 23:50:15,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-17 23:50:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-17 23:50:16,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:16,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747047790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:16,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:16,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [16] total 31 [2021-12-17 23:50:16,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524683868] [2021-12-17 23:50:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:16,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 23:50:16,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 23:50:16,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2021-12-17 23:50:16,218 INFO L87 Difference]: Start difference. First operand 194 states and 252 transitions. Second operand has 17 states, 16 states have (on average 5.1875) internal successors, (83), 13 states have internal predecessors, (83), 7 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-17 23:50:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:16,731 INFO L93 Difference]: Finished difference Result 398 states and 521 transitions. [2021-12-17 23:50:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 23:50:16,731 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.1875) internal successors, (83), 13 states have internal predecessors, (83), 7 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 155 [2021-12-17 23:50:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:16,733 INFO L225 Difference]: With dead ends: 398 [2021-12-17 23:50:16,733 INFO L226 Difference]: Without dead ends: 277 [2021-12-17 23:50:16,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2021-12-17 23:50:16,735 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 152 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:16,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 1139 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 399 Invalid, 0 Unknown, 305 Unchecked, 0.4s Time] [2021-12-17 23:50:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-17 23:50:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 229. [2021-12-17 23:50:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 167 states have (on average 1.1736526946107784) internal successors, (196), 171 states have internal predecessors, (196), 41 states have call successors, (41), 17 states have call predecessors, (41), 20 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49) [2021-12-17 23:50:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 286 transitions. [2021-12-17 23:50:16,751 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 286 transitions. Word has length 155 [2021-12-17 23:50:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:16,752 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 286 transitions. [2021-12-17 23:50:16,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.1875) internal successors, (83), 13 states have internal predecessors, (83), 7 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-17 23:50:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 286 transitions. [2021-12-17 23:50:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 23:50:16,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:16,755 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:16,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:16,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 23:50:16,983 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:16,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash 633069327, now seen corresponding path program 1 times [2021-12-17 23:50:16,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:16,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051251819] [2021-12-17 23:50:16,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:16,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 23:50:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 23:50:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 23:50:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 23:50:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-17 23:50:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 23:50:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 23:50:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-17 23:50:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2021-12-17 23:50:17,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:17,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051251819] [2021-12-17 23:50:17,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051251819] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:17,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948770223] [2021-12-17 23:50:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:17,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:17,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:17,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:17,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 23:50:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:17,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 2838 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 23:50:17,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-17 23:50:18,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:18,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948770223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:18,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:18,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2021-12-17 23:50:18,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143787657] [2021-12-17 23:50:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:18,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 23:50:18,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:18,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 23:50:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:50:18,255 INFO L87 Difference]: Start difference. First operand 229 states and 286 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-17 23:50:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:18,386 INFO L93 Difference]: Finished difference Result 393 states and 500 transitions. [2021-12-17 23:50:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:50:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2021-12-17 23:50:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:18,389 INFO L225 Difference]: With dead ends: 393 [2021-12-17 23:50:18,389 INFO L226 Difference]: Without dead ends: 232 [2021-12-17 23:50:18,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:50:18,390 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 12 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:18,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1300 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:50:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-17 23:50:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-12-17 23:50:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 169 states have (on average 1.1597633136094674) internal successors, (196), 174 states have internal predecessors, (196), 41 states have call successors, (41), 17 states have call predecessors, (41), 21 states have return successors, (52), 40 states have call predecessors, (52), 40 states have call successors, (52) [2021-12-17 23:50:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 289 transitions. [2021-12-17 23:50:18,405 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 289 transitions. Word has length 160 [2021-12-17 23:50:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:18,408 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 289 transitions. [2021-12-17 23:50:18,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-17 23:50:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 289 transitions. [2021-12-17 23:50:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 23:50:18,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:18,410 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:18,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:18,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:18,623 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1596313372, now seen corresponding path program 1 times [2021-12-17 23:50:18,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:18,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019840815] [2021-12-17 23:50:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:18,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:50:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:50:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:50:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:50:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:50:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2021-12-17 23:50:19,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019840815] [2021-12-17 23:50:19,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019840815] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134539351] [2021-12-17 23:50:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:19,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:19,820 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:19,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 23:50:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:20,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-17 23:50:20,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:20,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:50:21,062 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_825 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_825))) is different from true [2021-12-17 23:50:21,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:50:21,079 WARN L860 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_826 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_826))) is different from true [2021-12-17 23:50:21,110 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:50:21,110 INFO L388 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 17 treesize of output 23 [2021-12-17 23:50:21,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 23:50:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 125 proven. 50 refuted. 0 times theorem prover too weak. 89 trivial. 2 not checked. [2021-12-17 23:50:22,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:50:22,737 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-17 23:50:22,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-17 23:50:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2021-12-17 23:50:22,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134539351] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:50:22,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:50:22,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 11] total 41 [2021-12-17 23:50:22,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332006417] [2021-12-17 23:50:22,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:50:22,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-17 23:50:22,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:22,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-17 23:50:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1351, Unknown=2, NotChecked=150, Total=1640 [2021-12-17 23:50:22,961 INFO L87 Difference]: Start difference. First operand 232 states and 289 transitions. Second operand has 41 states, 39 states have (on average 5.0) internal successors, (195), 38 states have internal predecessors, (195), 11 states have call successors, (51), 7 states have call predecessors, (51), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2021-12-17 23:50:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:29,532 INFO L93 Difference]: Finished difference Result 545 states and 744 transitions. [2021-12-17 23:50:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-17 23:50:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 5.0) internal successors, (195), 38 states have internal predecessors, (195), 11 states have call successors, (51), 7 states have call predecessors, (51), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) Word has length 162 [2021-12-17 23:50:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:29,535 INFO L225 Difference]: With dead ends: 545 [2021-12-17 23:50:29,536 INFO L226 Difference]: Without dead ends: 449 [2021-12-17 23:50:29,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 334 SyntacticMatches, 15 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=665, Invalid=4285, Unknown=28, NotChecked=278, Total=5256 [2021-12-17 23:50:29,538 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 501 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 4219 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 6304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 4219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1684 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:29,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 3195 Invalid, 6304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 4219 Invalid, 0 Unknown, 1684 Unchecked, 3.1s Time] [2021-12-17 23:50:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-12-17 23:50:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 270. [2021-12-17 23:50:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 198 states have (on average 1.1616161616161615) internal successors, (230), 203 states have internal predecessors, (230), 47 states have call successors, (47), 20 states have call predecessors, (47), 24 states have return successors, (62), 46 states have call predecessors, (62), 46 states have call successors, (62) [2021-12-17 23:50:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 339 transitions. [2021-12-17 23:50:29,556 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 339 transitions. Word has length 162 [2021-12-17 23:50:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:29,556 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 339 transitions. [2021-12-17 23:50:29,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 5.0) internal successors, (195), 38 states have internal predecessors, (195), 11 states have call successors, (51), 7 states have call predecessors, (51), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2021-12-17 23:50:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 339 transitions. [2021-12-17 23:50:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 23:50:29,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:29,559 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:29,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:29,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 23:50:29,773 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1418790246, now seen corresponding path program 2 times [2021-12-17 23:50:29,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:29,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354219009] [2021-12-17 23:50:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:29,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:50:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:50:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:50:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:50:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:50:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2021-12-17 23:50:30,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:30,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354219009] [2021-12-17 23:50:30,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354219009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:30,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:50:30,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-17 23:50:30,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607822568] [2021-12-17 23:50:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:30,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 23:50:30,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 23:50:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:50:30,378 INFO L87 Difference]: Start difference. First operand 270 states and 339 transitions. Second operand has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-17 23:50:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:31,315 INFO L93 Difference]: Finished difference Result 445 states and 576 transitions. [2021-12-17 23:50:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 23:50:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2021-12-17 23:50:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:31,318 INFO L225 Difference]: With dead ends: 445 [2021-12-17 23:50:31,318 INFO L226 Difference]: Without dead ends: 349 [2021-12-17 23:50:31,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-12-17 23:50:31,320 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 258 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:31,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 748 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 23:50:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-12-17 23:50:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 289. [2021-12-17 23:50:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 212 states have (on average 1.1603773584905661) internal successors, (246), 220 states have internal predecessors, (246), 49 states have call successors, (49), 20 states have call predecessors, (49), 27 states have return successors, (75), 48 states have call predecessors, (75), 48 states have call successors, (75) [2021-12-17 23:50:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 370 transitions. [2021-12-17 23:50:31,338 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 370 transitions. Word has length 162 [2021-12-17 23:50:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:31,339 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 370 transitions. [2021-12-17 23:50:31,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-17 23:50:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 370 transitions. [2021-12-17 23:50:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 23:50:31,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:31,342 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:31,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 23:50:31,342 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash -427723094, now seen corresponding path program 1 times [2021-12-17 23:50:31,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:31,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634733913] [2021-12-17 23:50:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:31,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:50:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:50:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:50:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:50:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:50:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2021-12-17 23:50:31,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:31,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634733913] [2021-12-17 23:50:31,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634733913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:31,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:50:31,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-17 23:50:31,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670921124] [2021-12-17 23:50:31,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:31,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 23:50:31,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:31,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 23:50:31,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:50:31,945 INFO L87 Difference]: Start difference. First operand 289 states and 370 transitions. Second operand has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-17 23:50:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:33,024 INFO L93 Difference]: Finished difference Result 450 states and 585 transitions. [2021-12-17 23:50:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 23:50:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2021-12-17 23:50:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:33,027 INFO L225 Difference]: With dead ends: 450 [2021-12-17 23:50:33,027 INFO L226 Difference]: Without dead ends: 347 [2021-12-17 23:50:33,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-12-17 23:50:33,028 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 221 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:33,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 976 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-17 23:50:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-17 23:50:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 289. [2021-12-17 23:50:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 212 states have (on average 1.1603773584905661) internal successors, (246), 220 states have internal predecessors, (246), 49 states have call successors, (49), 20 states have call predecessors, (49), 27 states have return successors, (75), 48 states have call predecessors, (75), 48 states have call successors, (75) [2021-12-17 23:50:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 370 transitions. [2021-12-17 23:50:33,047 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 370 transitions. Word has length 162 [2021-12-17 23:50:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:33,047 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 370 transitions. [2021-12-17 23:50:33,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-17 23:50:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 370 transitions. [2021-12-17 23:50:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 23:50:33,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:33,049 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:33,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 23:50:33,050 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash -169557656, now seen corresponding path program 3 times [2021-12-17 23:50:33,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:33,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865383718] [2021-12-17 23:50:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:33,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:50:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:50:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:50:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:50:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:50:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2021-12-17 23:50:33,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:33,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865383718] [2021-12-17 23:50:33,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865383718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:33,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:50:33,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:50:33,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308092009] [2021-12-17 23:50:33,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:33,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:50:33,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:50:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:50:33,455 INFO L87 Difference]: Start difference. First operand 289 states and 370 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-17 23:50:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:33,889 INFO L93 Difference]: Finished difference Result 431 states and 554 transitions. [2021-12-17 23:50:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:50:33,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2021-12-17 23:50:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:33,891 INFO L225 Difference]: With dead ends: 431 [2021-12-17 23:50:33,891 INFO L226 Difference]: Without dead ends: 292 [2021-12-17 23:50:33,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-17 23:50:33,892 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 139 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:33,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 433 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 23:50:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-17 23:50:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2021-12-17 23:50:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 206 states have (on average 1.1553398058252426) internal successors, (238), 213 states have internal predecessors, (238), 49 states have call successors, (49), 20 states have call predecessors, (49), 26 states have return successors, (69), 48 states have call predecessors, (69), 48 states have call successors, (69) [2021-12-17 23:50:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 356 transitions. [2021-12-17 23:50:33,907 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 356 transitions. Word has length 162 [2021-12-17 23:50:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:33,907 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 356 transitions. [2021-12-17 23:50:33,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-17 23:50:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 356 transitions. [2021-12-17 23:50:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 23:50:33,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:33,909 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:33,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 23:50:33,910 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1998554157, now seen corresponding path program 1 times [2021-12-17 23:50:33,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:33,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899746492] [2021-12-17 23:50:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:33,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:50:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:50:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:50:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:50:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:50:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-12-17 23:50:34,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:34,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899746492] [2021-12-17 23:50:34,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899746492] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:34,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640612978] [2021-12-17 23:50:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:34,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:34,360 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:34,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 23:50:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:34,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 2839 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-17 23:50:34,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:34,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:50:35,224 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1138 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1138))) is different from true [2021-12-17 23:50:35,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:50:35,236 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1139 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_1139))) is different from true [2021-12-17 23:50:35,254 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:50:35,254 INFO L388 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 17 treesize of output 23 [2021-12-17 23:50:35,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 23:50:35,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-17 23:50:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 121 proven. 54 refuted. 0 times theorem prover too weak. 89 trivial. 2 not checked. [2021-12-17 23:50:36,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:50:36,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-17 23:50:36,920 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-17 23:50:36,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-17 23:50:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2021-12-17 23:50:37,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640612978] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:50:37,109 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:50:37,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25, 13] total 44 [2021-12-17 23:50:37,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616564302] [2021-12-17 23:50:37,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:50:37,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-17 23:50:37,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:37,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-17 23:50:37,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1565, Unknown=2, NotChecked=162, Total=1892 [2021-12-17 23:50:37,111 INFO L87 Difference]: Start difference. First operand 282 states and 356 transitions. Second operand has 44 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 13 states have call successors, (48), 7 states have call predecessors, (48), 11 states have return successors, (43), 11 states have call predecessors, (43), 13 states have call successors, (43) [2021-12-17 23:50:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:43,837 INFO L93 Difference]: Finished difference Result 684 states and 943 transitions. [2021-12-17 23:50:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-12-17 23:50:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 13 states have call successors, (48), 7 states have call predecessors, (48), 11 states have return successors, (43), 11 states have call predecessors, (43), 13 states have call successors, (43) Word has length 162 [2021-12-17 23:50:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:43,842 INFO L225 Difference]: With dead ends: 684 [2021-12-17 23:50:43,842 INFO L226 Difference]: Without dead ends: 546 [2021-12-17 23:50:43,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 334 SyntacticMatches, 14 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2342 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=902, Invalid=7078, Unknown=38, NotChecked=354, Total=8372 [2021-12-17 23:50:43,845 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 628 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 4147 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 7310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 4147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2812 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:43,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [666 Valid, 3306 Invalid, 7310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 4147 Invalid, 0 Unknown, 2812 Unchecked, 2.7s Time] [2021-12-17 23:50:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-12-17 23:50:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 363. [2021-12-17 23:50:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 263 states have (on average 1.144486692015209) internal successors, (301), 271 states have internal predecessors, (301), 66 states have call successors, (66), 26 states have call predecessors, (66), 33 states have return successors, (101), 65 states have call predecessors, (101), 65 states have call successors, (101) [2021-12-17 23:50:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 468 transitions. [2021-12-17 23:50:43,870 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 468 transitions. Word has length 162 [2021-12-17 23:50:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:43,870 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 468 transitions. [2021-12-17 23:50:43,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 13 states have call successors, (48), 7 states have call predecessors, (48), 11 states have return successors, (43), 11 states have call predecessors, (43), 13 states have call successors, (43) [2021-12-17 23:50:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 468 transitions. [2021-12-17 23:50:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 23:50:43,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:43,873 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:43,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-17 23:50:44,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 23:50:44,091 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -172550999, now seen corresponding path program 1 times [2021-12-17 23:50:44,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:44,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680610965] [2021-12-17 23:50:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:44,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:50:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:50:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:50:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:50:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-17 23:50:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-12-17 23:50:44,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:44,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680610965] [2021-12-17 23:50:44,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680610965] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:44,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446385827] [2021-12-17 23:50:44,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:44,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:44,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:44,612 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:44,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 23:50:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:45,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-17 23:50:45,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:45,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:50:45,538 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1255 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1255))) is different from true [2021-12-17 23:50:45,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:50:45,553 WARN L860 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1256 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_1256))) is different from true [2021-12-17 23:50:45,573 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:50:45,574 INFO L388 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 26 treesize of output 30 [2021-12-17 23:50:45,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 23:50:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 121 proven. 50 refuted. 0 times theorem prover too weak. 93 trivial. 2 not checked. [2021-12-17 23:50:46,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:50:47,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446385827] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:47,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 23:50:47,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 26] total 34 [2021-12-17 23:50:47,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115278090] [2021-12-17 23:50:47,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 23:50:47,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 23:50:47,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:47,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 23:50:47,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1352, Unknown=2, NotChecked=150, Total=1640 [2021-12-17 23:50:47,117 INFO L87 Difference]: Start difference. First operand 363 states and 468 transitions. Second operand has 34 states, 30 states have (on average 4.833333333333333) internal successors, (145), 31 states have internal predecessors, (145), 15 states have call successors, (40), 8 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 15 states have call successors, (39) [2021-12-17 23:50:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:54,300 INFO L93 Difference]: Finished difference Result 1297 states and 1968 transitions. [2021-12-17 23:50:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-12-17 23:50:54,301 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.833333333333333) internal successors, (145), 31 states have internal predecessors, (145), 15 states have call successors, (40), 8 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 15 states have call successors, (39) Word has length 163 [2021-12-17 23:50:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:54,307 INFO L225 Difference]: With dead ends: 1297 [2021-12-17 23:50:54,307 INFO L226 Difference]: Without dead ends: 1127 [2021-12-17 23:50:54,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 212 SyntacticMatches, 15 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=760, Invalid=7052, Unknown=28, NotChecked=350, Total=8190 [2021-12-17 23:50:54,311 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1013 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 6685 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 12051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 6685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4327 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:54,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1054 Valid, 2900 Invalid, 12051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 6685 Invalid, 0 Unknown, 4327 Unchecked, 5.1s Time] [2021-12-17 23:50:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-12-17 23:50:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 511. [2021-12-17 23:50:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 362 states have (on average 1.12707182320442) internal successors, (408), 371 states have internal predecessors, (408), 106 states have call successors, (106), 34 states have call predecessors, (106), 42 states have return successors, (176), 105 states have call predecessors, (176), 105 states have call successors, (176) [2021-12-17 23:50:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 690 transitions. [2021-12-17 23:50:54,354 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 690 transitions. Word has length 163 [2021-12-17 23:50:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:54,354 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 690 transitions. [2021-12-17 23:50:54,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.833333333333333) internal successors, (145), 31 states have internal predecessors, (145), 15 states have call successors, (40), 8 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 15 states have call successors, (39) [2021-12-17 23:50:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 690 transitions. [2021-12-17 23:50:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-17 23:50:54,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:54,358 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:54,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:54,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 23:50:54,571 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:54,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1758298720, now seen corresponding path program 1 times [2021-12-17 23:50:54,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:54,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243880099] [2021-12-17 23:50:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:54,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:50:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-17 23:50:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 23:50:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 23:50:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-17 23:50:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-12-17 23:50:54,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:54,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243880099] [2021-12-17 23:50:54,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243880099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:54,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039199268] [2021-12-17 23:50:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:54,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:54,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:54,965 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:54,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 23:50:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:55,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 23:50:55,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-12-17 23:50:55,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:50:55,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039199268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:50:55,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:50:55,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2021-12-17 23:50:55,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971501718] [2021-12-17 23:50:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:50:55,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 23:50:55,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:50:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 23:50:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:50:55,707 INFO L87 Difference]: Start difference. First operand 511 states and 690 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-17 23:50:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:50:55,826 INFO L93 Difference]: Finished difference Result 723 states and 972 transitions. [2021-12-17 23:50:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:50:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 159 [2021-12-17 23:50:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:50:55,829 INFO L225 Difference]: With dead ends: 723 [2021-12-17 23:50:55,829 INFO L226 Difference]: Without dead ends: 407 [2021-12-17 23:50:55,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-12-17 23:50:55,831 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 12 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 23:50:55,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1327 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 23:50:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-12-17 23:50:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 395. [2021-12-17 23:50:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 281 states have (on average 1.1281138790035588) internal successors, (317), 287 states have internal predecessors, (317), 81 states have call successors, (81), 27 states have call predecessors, (81), 32 states have return successors, (120), 80 states have call predecessors, (120), 80 states have call successors, (120) [2021-12-17 23:50:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 518 transitions. [2021-12-17 23:50:55,856 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 518 transitions. Word has length 159 [2021-12-17 23:50:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:50:55,857 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 518 transitions. [2021-12-17 23:50:55,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-17 23:50:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 518 transitions. [2021-12-17 23:50:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-12-17 23:50:55,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:50:55,859 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:50:55,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 23:50:56,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:56,075 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:50:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:50:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 969726479, now seen corresponding path program 1 times [2021-12-17 23:50:56,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:50:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452417565] [2021-12-17 23:50:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:56,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:50:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:50:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:50:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:50:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:50:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:50:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:50:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:50:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:50:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:50:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:50:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:50:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:50:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:50:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:50:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:50:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:50:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:50:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:50:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:50:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-17 23:50:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2021-12-17 23:50:57,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:50:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452417565] [2021-12-17 23:50:57,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452417565] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:50:57,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208888503] [2021-12-17 23:50:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:50:57,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:50:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:50:57,392 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:50:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 23:50:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:50:57,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 2849 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-17 23:50:57,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:50:58,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:50:58,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:51:11,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 23:51:11,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:51:11,546 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1436 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1435 Int) (v_ArrVal_1438 Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_1436)) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| (store (store (select |c_old(#memory_int)| |save_byte_from_array_~storage#1.base|) |c_save_byte_from_array_#in~storage#1.offset| v_ArrVal_1435) (+ |c_save_byte_from_array_#in~storage#1.offset| 8) v_ArrVal_1438))))) is different from true [2021-12-17 23:51:11,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:51:11,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:51:11,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-17 23:51:11,582 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:51:11,582 INFO L388 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 17 treesize of output 23 [2021-12-17 23:51:11,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 23:51:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 129 proven. 42 refuted. 0 times theorem prover too weak. 91 trivial. 2 not checked. [2021-12-17 23:51:42,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:51:43,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_save_byte_from_array_~storage#1.base_20| Int) (v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1449 Int)) (or (not (= 0 (mod (select (select (store |c_#memory_int| |v_save_byte_from_array_~storage#1.base_20| (store (store (select |c_#memory_int| |v_save_byte_from_array_~storage#1.base_20|) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.offset| v_ArrVal_1449) (+ |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.offset| 8) v_ArrVal_1450)) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset| 16)) 18446744073709551616))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_save_byte_from_array_~storage#1.base_20| v_ArrVal_1448) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset| 8)))))) is different from false [2021-12-17 23:51:43,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208888503] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:51:43,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 23:51:43,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 49 [2021-12-17 23:51:43,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685985802] [2021-12-17 23:51:43,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 23:51:43,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-17 23:51:43,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:51:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-17 23:51:43,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2833, Unknown=12, NotChecked=218, Total=3306 [2021-12-17 23:51:43,356 INFO L87 Difference]: Start difference. First operand 395 states and 518 transitions. Second operand has 49 states, 43 states have (on average 3.813953488372093) internal successors, (164), 43 states have internal predecessors, (164), 20 states have call successors, (43), 8 states have call predecessors, (43), 14 states have return successors, (42), 17 states have call predecessors, (42), 20 states have call successors, (42) [2021-12-17 23:52:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:52:18,318 INFO L93 Difference]: Finished difference Result 588 states and 767 transitions. [2021-12-17 23:52:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-17 23:52:18,319 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 43 states have (on average 3.813953488372093) internal successors, (164), 43 states have internal predecessors, (164), 20 states have call successors, (43), 8 states have call predecessors, (43), 14 states have return successors, (42), 17 states have call predecessors, (42), 20 states have call successors, (42) Word has length 166 [2021-12-17 23:52:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:52:18,321 INFO L225 Difference]: With dead ends: 588 [2021-12-17 23:52:18,321 INFO L226 Difference]: Without dead ends: 406 [2021-12-17 23:52:18,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 242 SyntacticMatches, 12 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 78.6s TimeCoverageRelationStatistics Valid=592, Invalid=6504, Unknown=52, NotChecked=334, Total=7482 [2021-12-17 23:52:18,324 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 240 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 3597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1622 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:52:18,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 1793 Invalid, 3597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1790 Invalid, 0 Unknown, 1622 Unchecked, 1.0s Time] [2021-12-17 23:52:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-17 23:52:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2021-12-17 23:52:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 285 states have (on average 1.1298245614035087) internal successors, (322), 290 states have internal predecessors, (322), 85 states have call successors, (85), 28 states have call predecessors, (85), 32 states have return successors, (128), 84 states have call predecessors, (128), 84 states have call successors, (128) [2021-12-17 23:52:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 535 transitions. [2021-12-17 23:52:18,349 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 535 transitions. Word has length 166 [2021-12-17 23:52:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:52:18,349 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 535 transitions. [2021-12-17 23:52:18,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 43 states have (on average 3.813953488372093) internal successors, (164), 43 states have internal predecessors, (164), 20 states have call successors, (43), 8 states have call predecessors, (43), 14 states have return successors, (42), 17 states have call predecessors, (42), 20 states have call successors, (42) [2021-12-17 23:52:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 535 transitions. [2021-12-17 23:52:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-17 23:52:18,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:52:18,352 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:52:18,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 23:52:18,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:52:18,579 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:52:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:52:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1227194059, now seen corresponding path program 1 times [2021-12-17 23:52:18,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:52:18,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002880461] [2021-12-17 23:52:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:52:18,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:52:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:52:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:52:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:52:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:52:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:52:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:52:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:52:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:52:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:52:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:52:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:52:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:52:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:52:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:52:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:52:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:52:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:52:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-17 23:52:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:52:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:52:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-17 23:52:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2021-12-17 23:52:19,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:52:19,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002880461] [2021-12-17 23:52:19,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002880461] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:52:19,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946890016] [2021-12-17 23:52:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:52:19,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:52:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:52:19,873 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:52:19,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 23:52:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:20,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 2849 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-17 23:52:20,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:52:20,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:52:20,753 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1562 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1562))) is different from true [2021-12-17 23:52:20,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:52:20,770 WARN L860 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1563 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_1563))) is different from true [2021-12-17 23:52:20,786 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:52:20,786 INFO L388 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 19 treesize of output 25 [2021-12-17 23:52:20,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-12-17 23:52:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 122 proven. 28 refuted. 0 times theorem prover too weak. 124 trivial. 2 not checked. [2021-12-17 23:52:21,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:52:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2021-12-17 23:52:21,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946890016] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:52:21,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:52:21,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 9] total 33 [2021-12-17 23:52:21,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359329880] [2021-12-17 23:52:21,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:52:21,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-17 23:52:21,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:52:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-17 23:52:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=828, Unknown=2, NotChecked=118, Total=1056 [2021-12-17 23:52:21,836 INFO L87 Difference]: Start difference. First operand 403 states and 535 transitions. Second operand has 33 states, 32 states have (on average 5.65625) internal successors, (181), 31 states have internal predecessors, (181), 10 states have call successors, (50), 6 states have call predecessors, (50), 9 states have return successors, (50), 9 states have call predecessors, (50), 9 states have call successors, (50) [2021-12-17 23:52:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:52:26,315 INFO L93 Difference]: Finished difference Result 721 states and 954 transitions. [2021-12-17 23:52:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 23:52:26,316 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.65625) internal successors, (181), 31 states have internal predecessors, (181), 10 states have call successors, (50), 6 states have call predecessors, (50), 9 states have return successors, (50), 9 states have call predecessors, (50), 9 states have call successors, (50) Word has length 168 [2021-12-17 23:52:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:52:26,318 INFO L225 Difference]: With dead ends: 721 [2021-12-17 23:52:26,319 INFO L226 Difference]: Without dead ends: 525 [2021-12-17 23:52:26,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 354 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=343, Invalid=2001, Unknown=16, NotChecked=190, Total=2550 [2021-12-17 23:52:26,321 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 553 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 4828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1436 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-17 23:52:26,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [570 Valid, 2187 Invalid, 4828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 3064 Invalid, 0 Unknown, 1436 Unchecked, 1.9s Time] [2021-12-17 23:52:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-12-17 23:52:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 406. [2021-12-17 23:52:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 288 states have (on average 1.1145833333333333) internal successors, (321), 295 states have internal predecessors, (321), 82 states have call successors, (82), 29 states have call predecessors, (82), 35 states have return successors, (113), 81 states have call predecessors, (113), 81 states have call successors, (113) [2021-12-17 23:52:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 516 transitions. [2021-12-17 23:52:26,348 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 516 transitions. Word has length 168 [2021-12-17 23:52:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:52:26,348 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 516 transitions. [2021-12-17 23:52:26,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.65625) internal successors, (181), 31 states have internal predecessors, (181), 10 states have call successors, (50), 6 states have call predecessors, (50), 9 states have return successors, (50), 9 states have call predecessors, (50), 9 states have call successors, (50) [2021-12-17 23:52:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 516 transitions. [2021-12-17 23:52:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-17 23:52:26,351 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:52:26,351 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:52:26,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 23:52:26,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:52:26,579 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:52:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:52:26,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2079936362, now seen corresponding path program 1 times [2021-12-17 23:52:26,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:52:26,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952492450] [2021-12-17 23:52:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:52:26,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:52:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:52:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:52:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:52:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:52:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:52:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:52:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:52:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:52:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:52:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:52:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:52:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:52:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:52:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:52:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:52:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:52:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:52:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-17 23:52:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:52:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:52:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-17 23:52:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2021-12-17 23:52:27,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:52:27,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952492450] [2021-12-17 23:52:27,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952492450] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:52:27,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102084953] [2021-12-17 23:52:27,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:52:27,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:52:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:52:27,512 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:52:27,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 23:52:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:52:28,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 2855 conjuncts, 92 conjunts are in the unsatisfiable core [2021-12-17 23:52:28,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:52:28,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:52:29,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 23:52:31,511 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1680 Int) (|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1681 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| (store (store (select |c_old(#memory_int)| |save_byte_from_array_~storage#1.base|) |c_save_byte_from_array_#in~storage#1.offset| v_ArrVal_1680) (+ |c_save_byte_from_array_#in~storage#1.offset| 8) v_ArrVal_1681)))) is different from true [2021-12-17 23:52:31,526 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-17 23:52:31,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-17 23:52:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 135 proven. 41 refuted. 0 times theorem prover too weak. 98 trivial. 2 not checked. [2021-12-17 23:52:54,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:52:54,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102084953] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:52:54,781 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 23:52:54,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 51 [2021-12-17 23:52:54,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451289714] [2021-12-17 23:52:54,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 23:52:54,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-17 23:52:54,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:52:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-17 23:52:54,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3088, Unknown=7, NotChecked=112, Total=3422 [2021-12-17 23:52:54,783 INFO L87 Difference]: Start difference. First operand 406 states and 516 transitions. Second operand has 51 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 46 states have internal predecessors, (149), 22 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 16 states have call predecessors, (40), 22 states have call successors, (40) [2021-12-17 23:54:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:54:11,626 INFO L93 Difference]: Finished difference Result 695 states and 896 transitions. [2021-12-17 23:54:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-17 23:54:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 46 states have internal predecessors, (149), 22 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 16 states have call predecessors, (40), 22 states have call successors, (40) Word has length 168 [2021-12-17 23:54:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:54:11,628 INFO L225 Difference]: With dead ends: 695 [2021-12-17 23:54:11,628 INFO L226 Difference]: Without dead ends: 506 [2021-12-17 23:54:11,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 208 SyntacticMatches, 13 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2629 ImplicationChecksByTransitivity, 100.8s TimeCoverageRelationStatistics Valid=741, Invalid=7956, Unknown=49, NotChecked=184, Total=8930 [2021-12-17 23:54:11,631 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 389 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 5158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1157 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:54:11,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 2210 Invalid, 5158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3743 Invalid, 0 Unknown, 1157 Unchecked, 2.2s Time] [2021-12-17 23:54:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-12-17 23:54:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 400. [2021-12-17 23:54:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 288 states have (on average 1.1145833333333333) internal successors, (321), 294 states have internal predecessors, (321), 77 states have call successors, (77), 29 states have call predecessors, (77), 34 states have return successors, (102), 76 states have call predecessors, (102), 76 states have call successors, (102) [2021-12-17 23:54:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 500 transitions. [2021-12-17 23:54:11,657 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 500 transitions. Word has length 168 [2021-12-17 23:54:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:54:11,657 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 500 transitions. [2021-12-17 23:54:11,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 46 states have internal predecessors, (149), 22 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 16 states have call predecessors, (40), 22 states have call successors, (40) [2021-12-17 23:54:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 500 transitions. [2021-12-17 23:54:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 23:54:11,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:54:11,659 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:54:11,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-17 23:54:11,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 23:54:11,892 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:54:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:54:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash -512619859, now seen corresponding path program 1 times [2021-12-17 23:54:11,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:54:11,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391670666] [2021-12-17 23:54:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:11,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:54:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:54:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:54:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:54:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:54:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:54:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:54:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:54:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:54:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:54:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:54:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-17 23:54:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:54:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:54:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:54:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:54:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:54:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:54:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2021-12-17 23:54:12,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:54:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391670666] [2021-12-17 23:54:12,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391670666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:54:12,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:54:12,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 23:54:12,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348410175] [2021-12-17 23:54:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:54:12,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 23:54:12,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:54:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 23:54:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-17 23:54:12,202 INFO L87 Difference]: Start difference. First operand 400 states and 500 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-17 23:54:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:54:12,726 INFO L93 Difference]: Finished difference Result 408 states and 508 transitions. [2021-12-17 23:54:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 23:54:12,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2021-12-17 23:54:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:54:12,728 INFO L225 Difference]: With dead ends: 408 [2021-12-17 23:54:12,728 INFO L226 Difference]: Without dead ends: 406 [2021-12-17 23:54:12,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-12-17 23:54:12,729 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 154 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 23:54:12,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1133 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 23:54:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-17 23:54:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2021-12-17 23:54:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 291 states have (on average 1.1134020618556701) internal successors, (324), 297 states have internal predecessors, (324), 78 states have call successors, (78), 30 states have call predecessors, (78), 35 states have return successors, (103), 77 states have call predecessors, (103), 77 states have call successors, (103) [2021-12-17 23:54:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 505 transitions. [2021-12-17 23:54:12,753 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 505 transitions. Word has length 164 [2021-12-17 23:54:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:54:12,754 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 505 transitions. [2021-12-17 23:54:12,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-17 23:54:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 505 transitions. [2021-12-17 23:54:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-12-17 23:54:12,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:54:12,756 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:54:12,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-17 23:54:12,757 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:54:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:54:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -834950965, now seen corresponding path program 1 times [2021-12-17 23:54:12,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:54:12,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998823410] [2021-12-17 23:54:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:12,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:54:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:54:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:54:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:54:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:54:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:54:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:54:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:54:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:54:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:54:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:54:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-17 23:54:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 23:54:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 23:54:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 23:54:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 23:54:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:54:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 23:54:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-17 23:54:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2021-12-17 23:54:13,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:54:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998823410] [2021-12-17 23:54:13,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998823410] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:54:13,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587129980] [2021-12-17 23:54:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:13,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:54:13,676 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:54:13,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 23:54:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:14,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 2854 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-17 23:54:14,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:54:15,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-17 23:54:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 155 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-12-17 23:54:15,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:54:15,862 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:54:15,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2021-12-17 23:54:16,189 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-17 23:54:16,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2021-12-17 23:54:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 46 proven. 11 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-12-17 23:54:17,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587129980] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:54:17,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:54:17,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29, 24] total 69 [2021-12-17 23:54:17,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046129193] [2021-12-17 23:54:17,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:54:17,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-12-17 23:54:17,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:54:17,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-12-17 23:54:17,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4476, Unknown=0, NotChecked=0, Total=4692 [2021-12-17 23:54:17,369 INFO L87 Difference]: Start difference. First operand 405 states and 505 transitions. Second operand has 69 states, 60 states have (on average 3.316666666666667) internal successors, (199), 57 states have internal predecessors, (199), 29 states have call successors, (64), 8 states have call predecessors, (64), 13 states have return successors, (61), 28 states have call predecessors, (61), 27 states have call successors, (61) [2021-12-17 23:54:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:54:24,071 INFO L93 Difference]: Finished difference Result 815 states and 1062 transitions. [2021-12-17 23:54:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-17 23:54:24,072 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 60 states have (on average 3.316666666666667) internal successors, (199), 57 states have internal predecessors, (199), 29 states have call successors, (64), 8 states have call predecessors, (64), 13 states have return successors, (61), 28 states have call predecessors, (61), 27 states have call successors, (61) Word has length 166 [2021-12-17 23:54:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:54:24,073 INFO L225 Difference]: With dead ends: 815 [2021-12-17 23:54:24,074 INFO L226 Difference]: Without dead ends: 484 [2021-12-17 23:54:24,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 335 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2315 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=952, Invalid=11258, Unknown=0, NotChecked=0, Total=12210 [2021-12-17 23:54:24,076 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 1329 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 7854 mSolverCounterSat, 1164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 9252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1164 IncrementalHoareTripleChecker+Valid, 7854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:54:24,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1329 Valid, 2298 Invalid, 9252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1164 Valid, 7854 Invalid, 0 Unknown, 234 Unchecked, 4.3s Time] [2021-12-17 23:54:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-12-17 23:54:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 452. [2021-12-17 23:54:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 315 states have (on average 1.1047619047619048) internal successors, (348), 321 states have internal predecessors, (348), 101 states have call successors, (101), 30 states have call predecessors, (101), 35 states have return successors, (132), 100 states have call predecessors, (132), 99 states have call successors, (132) [2021-12-17 23:54:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 581 transitions. [2021-12-17 23:54:24,113 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 581 transitions. Word has length 166 [2021-12-17 23:54:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:54:24,114 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 581 transitions. [2021-12-17 23:54:24,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 60 states have (on average 3.316666666666667) internal successors, (199), 57 states have internal predecessors, (199), 29 states have call successors, (64), 8 states have call predecessors, (64), 13 states have return successors, (61), 28 states have call predecessors, (61), 27 states have call successors, (61) [2021-12-17 23:54:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 581 transitions. [2021-12-17 23:54:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-17 23:54:24,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:54:24,117 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:54:24,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 23:54:24,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:24,344 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:54:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:54:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash 584074951, now seen corresponding path program 1 times [2021-12-17 23:54:24,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:54:24,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258310981] [2021-12-17 23:54:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:24,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:54:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:54:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:54:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:54:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:54:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:54:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:54:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:54:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:54:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:54:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:54:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-17 23:54:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-17 23:54:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 23:54:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-17 23:54:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-17 23:54:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:54:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-17 23:54:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-17 23:54:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-12-17 23:54:25,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:54:25,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258310981] [2021-12-17 23:54:25,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258310981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:54:25,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650398672] [2021-12-17 23:54:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:25,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:54:25,374 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:54:25,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 23:54:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:25,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-17 23:54:25,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:54:25,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:26,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-17 23:54:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-17 23:54:26,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:54:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2021-12-17 23:54:26,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650398672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:54:26,972 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:54:26,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 9] total 43 [2021-12-17 23:54:26,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525467278] [2021-12-17 23:54:26,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:54:26,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-17 23:54:26,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:54:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-17 23:54:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2021-12-17 23:54:26,974 INFO L87 Difference]: Start difference. First operand 452 states and 581 transitions. Second operand has 43 states, 38 states have (on average 4.7368421052631575) internal successors, (180), 36 states have internal predecessors, (180), 19 states have call successors, (62), 5 states have call predecessors, (62), 10 states have return successors, (61), 18 states have call predecessors, (61), 19 states have call successors, (61) [2021-12-17 23:54:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:54:31,220 INFO L93 Difference]: Finished difference Result 754 states and 977 transitions. [2021-12-17 23:54:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 23:54:31,220 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 4.7368421052631575) internal successors, (180), 36 states have internal predecessors, (180), 19 states have call successors, (62), 5 states have call predecessors, (62), 10 states have return successors, (61), 18 states have call predecessors, (61), 19 states have call successors, (61) Word has length 173 [2021-12-17 23:54:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:54:31,223 INFO L225 Difference]: With dead ends: 754 [2021-12-17 23:54:31,223 INFO L226 Difference]: Without dead ends: 454 [2021-12-17 23:54:31,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 381 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=440, Invalid=4252, Unknown=0, NotChecked=0, Total=4692 [2021-12-17 23:54:31,225 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 758 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 5648 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 6593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 5648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-17 23:54:31,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 2125 Invalid, 6593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 5648 Invalid, 0 Unknown, 298 Unchecked, 3.2s Time] [2021-12-17 23:54:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-12-17 23:54:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 389. [2021-12-17 23:54:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 277 states have (on average 1.1227436823104693) internal successors, (311), 283 states have internal predecessors, (311), 83 states have call successors, (83), 23 states have call predecessors, (83), 28 states have return successors, (100), 82 states have call predecessors, (100), 81 states have call successors, (100) [2021-12-17 23:54:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 494 transitions. [2021-12-17 23:54:31,259 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 494 transitions. Word has length 173 [2021-12-17 23:54:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:54:31,259 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 494 transitions. [2021-12-17 23:54:31,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 4.7368421052631575) internal successors, (180), 36 states have internal predecessors, (180), 19 states have call successors, (62), 5 states have call predecessors, (62), 10 states have return successors, (61), 18 states have call predecessors, (61), 19 states have call successors, (61) [2021-12-17 23:54:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 494 transitions. [2021-12-17 23:54:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-17 23:54:31,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:54:31,261 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:54:31,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 23:54:31,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:31,483 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:54:31,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:54:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash -202579164, now seen corresponding path program 1 times [2021-12-17 23:54:31,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:54:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893179061] [2021-12-17 23:54:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:31,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:54:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:54:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:54:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:54:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:54:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:54:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:54:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:54:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:54:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:54:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:54:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-17 23:54:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-17 23:54:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-17 23:54:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-17 23:54:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-17 23:54:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:33,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:54:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 23:54:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-12-17 23:54:33,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:54:33,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893179061] [2021-12-17 23:54:33,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893179061] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:54:33,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616945662] [2021-12-17 23:54:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:33,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:33,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:54:33,283 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:54:33,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 23:54:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:33,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 2905 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-17 23:54:33,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:54:33,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:54:34,281 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2177 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2177))) is different from true [2021-12-17 23:54:34,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:34,294 WARN L860 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_2178 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2178))) is different from true [2021-12-17 23:54:34,310 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:54:34,311 INFO L388 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 24 treesize of output 28 [2021-12-17 23:54:34,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:54:34,326 INFO L388 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 13 treesize of output 7 [2021-12-17 23:54:34,343 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2179 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2179))) is different from true [2021-12-17 23:54:34,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:34,356 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2180 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2180))) is different from true [2021-12-17 23:54:34,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 152 proven. 18 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2021-12-17 23:54:35,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:54:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-12-17 23:54:36,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616945662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:54:36,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:54:36,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 11] total 47 [2021-12-17 23:54:36,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391698605] [2021-12-17 23:54:36,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:54:36,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-17 23:54:36,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:54:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-17 23:54:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1648, Unknown=4, NotChecked=340, Total=2162 [2021-12-17 23:54:36,026 INFO L87 Difference]: Start difference. First operand 389 states and 494 transitions. Second operand has 47 states, 43 states have (on average 4.441860465116279) internal successors, (191), 44 states have internal predecessors, (191), 16 states have call successors, (53), 6 states have call predecessors, (53), 10 states have return successors, (53), 12 states have call predecessors, (53), 15 states have call successors, (53) [2021-12-17 23:54:38,975 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2179 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2179))) (exists ((v_ArrVal_2177 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2177)))) is different from true [2021-12-17 23:54:38,978 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_2178 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2178))) (exists ((v_ArrVal_2180 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2180)))) is different from true [2021-12-17 23:54:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:54:43,465 INFO L93 Difference]: Finished difference Result 626 states and 810 transitions. [2021-12-17 23:54:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-17 23:54:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 4.441860465116279) internal successors, (191), 44 states have internal predecessors, (191), 16 states have call successors, (53), 6 states have call predecessors, (53), 10 states have return successors, (53), 12 states have call predecessors, (53), 15 states have call successors, (53) Word has length 175 [2021-12-17 23:54:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:54:43,467 INFO L225 Difference]: With dead ends: 626 [2021-12-17 23:54:43,467 INFO L226 Difference]: Without dead ends: 488 [2021-12-17 23:54:43,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 360 SyntacticMatches, 14 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=549, Invalid=4005, Unknown=26, NotChecked=822, Total=5402 [2021-12-17 23:54:43,469 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 357 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1169 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:54:43,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 1845 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2746 Invalid, 0 Unknown, 1169 Unchecked, 2.0s Time] [2021-12-17 23:54:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-12-17 23:54:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 391. [2021-12-17 23:54:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 280 states have (on average 1.1214285714285714) internal successors, (314), 285 states have internal predecessors, (314), 83 states have call successors, (83), 23 states have call predecessors, (83), 27 states have return successors, (95), 82 states have call predecessors, (95), 81 states have call successors, (95) [2021-12-17 23:54:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 492 transitions. [2021-12-17 23:54:43,511 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 492 transitions. Word has length 175 [2021-12-17 23:54:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:54:43,512 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 492 transitions. [2021-12-17 23:54:43,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 4.441860465116279) internal successors, (191), 44 states have internal predecessors, (191), 16 states have call successors, (53), 6 states have call predecessors, (53), 10 states have return successors, (53), 12 states have call predecessors, (53), 15 states have call successors, (53) [2021-12-17 23:54:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 492 transitions. [2021-12-17 23:54:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-12-17 23:54:43,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:54:43,515 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 23:54:43,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 23:54:43,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:43,731 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:54:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:54:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash 265351339, now seen corresponding path program 1 times [2021-12-17 23:54:43,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:54:43,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735694672] [2021-12-17 23:54:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:43,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:54:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:54:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:54:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:54:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:54:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:54:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:54:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:54:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:54:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:54:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:54:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-17 23:54:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 23:54:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-17 23:54:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-17 23:54:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-17 23:54:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-17 23:54:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:54:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 23:54:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2021-12-17 23:54:44,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:54:44,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735694672] [2021-12-17 23:54:44,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735694672] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:54:44,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57278004] [2021-12-17 23:54:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:44,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:44,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:54:44,744 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:54:44,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-17 23:54:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:45,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 2915 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-17 23:54:45,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:54:45,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:54:45,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 23:54:46,005 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2352 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2352))) (exists ((v_ArrVal_2351 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2351)))) is different from true [2021-12-17 23:54:46,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:46,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:46,040 WARN L860 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int)) (and (exists ((v_ArrVal_2354 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |save_byte_from_array_~storage#1.base| v_ArrVal_2354))) (exists ((v_ArrVal_2353 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_2353))))) is different from true [2021-12-17 23:54:46,070 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:54:46,070 INFO L388 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 [2021-12-17 23:54:46,082 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:54:46,082 INFO L388 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 17 treesize of output 23 [2021-12-17 23:54:46,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 23:54:46,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 23:54:46,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:46,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:46,266 INFO L388 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 11 treesize of output 14 [2021-12-17 23:54:46,269 INFO L388 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 11 treesize of output 14 [2021-12-17 23:54:46,278 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimArr_2 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_arrayElimArr_1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |save_byte_from_array_~storage#1.base| v_arrayElimArr_2)))) is different from true [2021-12-17 23:54:46,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:46,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:54:49,635 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:54:49,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2021-12-17 23:54:49,640 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:54:49,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 49 [2021-12-17 23:54:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 89 proven. 64 refuted. 0 times theorem prover too weak. 170 trivial. 4 not checked. [2021-12-17 23:54:49,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:54:50,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57278004] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:54:50,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 23:54:50,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 40] total 50 [2021-12-17 23:54:50,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150510079] [2021-12-17 23:54:50,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 23:54:50,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 23:54:50,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:54:50,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 23:54:50,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2913, Unknown=5, NotChecked=330, Total=3422 [2021-12-17 23:54:50,759 INFO L87 Difference]: Start difference. First operand 391 states and 492 transitions. Second operand has 50 states, 45 states have (on average 3.2666666666666666) internal successors, (147), 43 states have internal predecessors, (147), 17 states have call successors, (36), 7 states have call predecessors, (36), 11 states have return successors, (36), 15 states have call predecessors, (36), 16 states have call successors, (36) [2021-12-17 23:54:54,087 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_2 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_arrayElimArr_1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |save_byte_from_array_~storage#1.base| v_arrayElimArr_2)))) (exists ((|save_byte_from_array_~storage#1.base| Int)) (and (exists ((v_ArrVal_2354 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |save_byte_from_array_~storage#1.base| v_ArrVal_2354))) (exists ((v_ArrVal_2353 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_2353)))))) is different from true [2021-12-17 23:54:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:54:57,628 INFO L93 Difference]: Finished difference Result 475 states and 592 transitions. [2021-12-17 23:54:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-12-17 23:54:57,628 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 3.2666666666666666) internal successors, (147), 43 states have internal predecessors, (147), 17 states have call successors, (36), 7 states have call predecessors, (36), 11 states have return successors, (36), 15 states have call predecessors, (36), 16 states have call successors, (36) Word has length 177 [2021-12-17 23:54:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:54:57,630 INFO L225 Difference]: With dead ends: 475 [2021-12-17 23:54:57,631 INFO L226 Difference]: Without dead ends: 473 [2021-12-17 23:54:57,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 211 SyntacticMatches, 11 SemanticMatches, 116 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3461 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=850, Invalid=12039, Unknown=9, NotChecked=908, Total=13806 [2021-12-17 23:54:57,633 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 519 mSDsluCounter, 2845 mSDsCounter, 0 mSdLazyCounter, 3941 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 6317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 3941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2003 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-17 23:54:57,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 3016 Invalid, 6317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 3941 Invalid, 0 Unknown, 2003 Unchecked, 2.3s Time] [2021-12-17 23:54:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-12-17 23:54:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 417. [2021-12-17 23:54:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 298 states have (on average 1.1208053691275168) internal successors, (334), 304 states have internal predecessors, (334), 87 states have call successors, (87), 26 states have call predecessors, (87), 31 states have return successors, (99), 86 states have call predecessors, (99), 85 states have call successors, (99) [2021-12-17 23:54:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 520 transitions. [2021-12-17 23:54:57,670 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 520 transitions. Word has length 177 [2021-12-17 23:54:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:54:57,671 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 520 transitions. [2021-12-17 23:54:57,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 3.2666666666666666) internal successors, (147), 43 states have internal predecessors, (147), 17 states have call successors, (36), 7 states have call predecessors, (36), 11 states have return successors, (36), 15 states have call predecessors, (36), 16 states have call successors, (36) [2021-12-17 23:54:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 520 transitions. [2021-12-17 23:54:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-17 23:54:57,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 23:54:57,673 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:54:57,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-17 23:54:57,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-17 23:54:57,887 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 23:54:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:54:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash 321455655, now seen corresponding path program 1 times [2021-12-17 23:54:57,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:54:57,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916730042] [2021-12-17 23:54:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:57,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:54:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 23:54:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 23:54:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 23:54:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 23:54:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-17 23:54:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 23:54:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 23:54:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 23:54:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 23:54:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 23:54:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 23:54:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 23:54:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 23:54:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 23:54:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-17 23:54:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 23:54:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 23:54:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-17 23:54:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-17 23:54:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2021-12-17 23:54:58,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:54:58,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916730042] [2021-12-17 23:54:58,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916730042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:54:58,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624615641] [2021-12-17 23:54:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:54:58,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:54:58,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:54:58,762 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) [2021-12-17 23:54:58,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-17 23:54:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:54:59,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 2822 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-17 23:54:59,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:55:01,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-17 23:55:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 20 proven. 138 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-17 23:55:01,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:55:03,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2021-12-17 23:55:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-12-17 23:55:04,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624615641] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:55:04,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:55:04,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 15] total 67 [2021-12-17 23:55:04,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165002827] [2021-12-17 23:55:04,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:55:04,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-17 23:55:04,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:55:04,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-17 23:55:04,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4173, Unknown=0, NotChecked=0, Total=4422 [2021-12-17 23:55:04,055 INFO L87 Difference]: Start difference. First operand 417 states and 520 transitions. Second operand has 67 states, 57 states have (on average 3.3859649122807016) internal successors, (193), 55 states have internal predecessors, (193), 26 states have call successors, (60), 12 states have call predecessors, (60), 15 states have return successors, (57), 23 states have call predecessors, (57), 24 states have call successors, (57) [2021-12-17 23:55:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 23:55:04,057 INFO L93 Difference]: Finished difference Result 417 states and 520 transitions. [2021-12-17 23:55:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 23:55:04,058 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 57 states have (on average 3.3859649122807016) internal successors, (193), 55 states have internal predecessors, (193), 26 states have call successors, (60), 12 states have call predecessors, (60), 15 states have return successors, (57), 23 states have call predecessors, (57), 24 states have call successors, (57) Word has length 171 [2021-12-17 23:55:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 23:55:04,058 INFO L225 Difference]: With dead ends: 417 [2021-12-17 23:55:04,058 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 23:55:04,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 324 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=249, Invalid=4173, Unknown=0, NotChecked=0, Total=4422 [2021-12-17 23:55:04,060 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 23:55:04,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 23:55:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 23:55:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 23:55:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 23:55:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 23:55:04,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2021-12-17 23:55:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 23:55:04,062 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 23:55:04,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 57 states have (on average 3.3859649122807016) internal successors, (193), 55 states have internal predecessors, (193), 26 states have call successors, (60), 12 states have call predecessors, (60), 15 states have return successors, (57), 23 states have call predecessors, (57), 24 states have call successors, (57) [2021-12-17 23:55:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 23:55:04,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 23:55:04,065 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 23:55:04,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-17 23:55:04,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-17 23:55:04,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 23:55:48,239 WARN L227 SmtUtils]: Spent 43.95s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 23:55:49,097 INFO L861 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: true [2021-12-17 23:55:49,098 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-17 23:55:49,098 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-17 23:55:49,098 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-17 23:55:49,098 INFO L861 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: true [2021-12-17 23:55:49,098 INFO L858 garLoopResultBuilder]: For program point L7135(lines 7135 7139) no Hoare annotation was computed. [2021-12-17 23:55:49,098 INFO L858 garLoopResultBuilder]: For program point L7137-1(line 7137) no Hoare annotation was computed. [2021-12-17 23:55:49,098 INFO L858 garLoopResultBuilder]: For program point save_byte_from_arrayEXIT(lines 7134 7140) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L861 garLoopResultBuilder]: At program point L7137(line 7137) the Hoare annotation is: true [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7135-2(lines 7134 7140) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L861 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: true [2021-12-17 23:55:49,101 INFO L861 garLoopResultBuilder]: At program point save_byte_from_arrayENTRY(lines 7134 7140) the Hoare annotation is: true [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385-3(line 7385) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385-1(line 7385) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385-7(lines 7385 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385-6(lines 7385 7386) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7383 7389) the Hoare annotation is: true [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385-4(lines 7385 7386) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385-11(lines 7385 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7385-9(lines 7385 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7383 7389) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7383 7389) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7388-2(line 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,101 INFO L858 garLoopResultBuilder]: For program point L7388(line 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L7388-6(line 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L7388-4(line 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L7388-3(line 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L7388-8(line 7388) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L7772(lines 7772 7774) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point aws_array_eq_c_strFINAL(lines 7767 7800) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L854 garLoopResultBuilder]: At program point L7769-1(line 7769) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21| Int)) (not (= 0 (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21|) 16) 18446744073709551616)))) (= |aws_array_eq_c_str_#in~array_len| aws_array_eq_c_str_~array_len) (forall ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3|) 8) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3|) 8) 0)))) (not (< 0 |#StackHeapBarrier|))) [2021-12-17 23:55:49,102 INFO L854 garLoopResultBuilder]: At program point L7769(line 7769) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21| Int)) (not (= 0 (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21|) 16) 18446744073709551616)))) (= |aws_array_eq_c_str_#in~array_len| aws_array_eq_c_str_~array_len) (forall ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3|) 8) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3|) 8) 0)))) (not (< 0 |#StackHeapBarrier|))) [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L7792(lines 7792 7796) no Hoare annotation was computed. [2021-12-17 23:55:49,102 INFO L858 garLoopResultBuilder]: For program point L7786(lines 7786 7790) no Hoare annotation was computed. [2021-12-17 23:55:49,103 INFO L861 garLoopResultBuilder]: At program point aws_array_eq_c_strENTRY(lines 7767 7800) the Hoare annotation is: true [2021-12-17 23:55:49,103 INFO L858 garLoopResultBuilder]: For program point L7784-2(lines 7784 7797) no Hoare annotation was computed. [2021-12-17 23:55:49,103 INFO L858 garLoopResultBuilder]: For program point aws_array_eq_c_strEXIT(lines 7767 7800) no Hoare annotation was computed. [2021-12-17 23:55:49,103 INFO L858 garLoopResultBuilder]: For program point L7784-4(lines 7784 7797) no Hoare annotation was computed. [2021-12-17 23:55:49,103 INFO L854 garLoopResultBuilder]: At program point L7784-3(lines 7784 7797) the Hoare annotation is: (let ((.cse0 (= |aws_array_eq_c_str_#in~array_len| aws_array_eq_c_str_~array_len))) (or (forall ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21| Int)) (not (= 0 (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21|) 16) 18446744073709551616)))) (forall ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3|) 8) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3|) 8) 0)))) (not (< 0 |#StackHeapBarrier|)) (and .cse0 (<= |aws_array_eq_c_str_#in~array_len| (+ (* 18446744073709551616 (div (+ |aws_array_eq_c_str_#in~array_len| (- 1)) 18446744073709551616)) 18446744073709551615))) (and .cse0 (= aws_array_eq_c_str_~i~9 0)))) [2021-12-17 23:55:49,103 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-17 23:55:49,103 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-17 23:55:49,103 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-17 23:55:49,103 INFO L861 garLoopResultBuilder]: At program point L7130(line 7130) the Hoare annotation is: true [2021-12-17 23:55:49,103 INFO L858 garLoopResultBuilder]: For program point assert_byte_from_buffer_matchesEXIT(lines 7128 7132) no Hoare annotation was computed. [2021-12-17 23:55:49,103 INFO L861 garLoopResultBuilder]: At program point assert_byte_from_buffer_matchesENTRY(lines 7128 7132) the Hoare annotation is: true [2021-12-17 23:55:49,103 INFO L858 garLoopResultBuilder]: For program point L7129-2(lines 7128 7132) no Hoare annotation was computed. [2021-12-17 23:55:49,104 INFO L858 garLoopResultBuilder]: For program point L7129(lines 7129 7131) no Hoare annotation was computed. [2021-12-17 23:55:49,104 INFO L858 garLoopResultBuilder]: For program point L7130-1(line 7130) no Hoare annotation was computed. [2021-12-17 23:55:49,104 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-17 23:55:49,104 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-17 23:55:49,104 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-17 23:55:49,104 INFO L854 garLoopResultBuilder]: At program point L8987(line 8987) the Hoare annotation is: false [2021-12-17 23:55:49,104 INFO L858 garLoopResultBuilder]: For program point L8987-1(line 8987) no Hoare annotation was computed. [2021-12-17 23:55:49,105 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-12-17 23:55:49,105 INFO L858 garLoopResultBuilder]: For program point L7468-1(lines 7468 7470) no Hoare annotation was computed. [2021-12-17 23:55:49,105 INFO L854 garLoopResultBuilder]: At program point L7468(lines 7468 7470) the Hoare annotation is: false [2021-12-17 23:55:49,105 INFO L858 garLoopResultBuilder]: For program point L8996(lines 8996 8998) no Hoare annotation was computed. [2021-12-17 23:55:49,105 INFO L858 garLoopResultBuilder]: For program point L8996-1(lines 8996 8998) no Hoare annotation was computed. [2021-12-17 23:55:49,105 INFO L858 garLoopResultBuilder]: For program point L7171-1(line 7171) no Hoare annotation was computed. [2021-12-17 23:55:49,105 INFO L854 garLoopResultBuilder]: At program point L7171(line 7171) the Hoare annotation is: false [2021-12-17 23:55:49,105 INFO L858 garLoopResultBuilder]: For program point L8988(lines 8988 8990) no Hoare annotation was computed. [2021-12-17 23:55:49,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 23:55:49,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 23:55:49,106 INFO L854 garLoopResultBuilder]: At program point L8980(line 8980) the Hoare annotation is: false [2021-12-17 23:55:49,106 INFO L858 garLoopResultBuilder]: For program point L8980-1(line 8980) no Hoare annotation was computed. [2021-12-17 23:55:49,106 INFO L854 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: false [2021-12-17 23:55:49,106 INFO L858 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2021-12-17 23:55:49,106 INFO L858 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2021-12-17 23:55:49,106 INFO L854 garLoopResultBuilder]: At program point L8997(line 8997) the Hoare annotation is: false [2021-12-17 23:55:49,107 INFO L858 garLoopResultBuilder]: For program point L6825-1(line 6825) no Hoare annotation was computed. [2021-12-17 23:55:49,107 INFO L854 garLoopResultBuilder]: At program point L6825(line 6825) the Hoare annotation is: false [2021-12-17 23:55:49,107 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-17 23:55:49,107 INFO L858 garLoopResultBuilder]: For program point L7172-1(line 7172) no Hoare annotation was computed. [2021-12-17 23:55:49,107 INFO L854 garLoopResultBuilder]: At program point L7172(line 7172) the Hoare annotation is: false [2021-12-17 23:55:49,107 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-17 23:55:49,107 INFO L858 garLoopResultBuilder]: For program point L8981(line 8981) no Hoare annotation was computed. [2021-12-17 23:55:49,107 INFO L858 garLoopResultBuilder]: For program point L8981-2(line 8981) no Hoare annotation was computed. [2021-12-17 23:55:49,108 INFO L854 garLoopResultBuilder]: At program point L8973(line 8973) the Hoare annotation is: false [2021-12-17 23:55:49,108 INFO L858 garLoopResultBuilder]: For program point L8973-1(line 8973) no Hoare annotation was computed. [2021-12-17 23:55:49,108 INFO L854 garLoopResultBuilder]: At program point L6826(lines 6818 6827) the Hoare annotation is: false [2021-12-17 23:55:49,108 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-17 23:55:49,108 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-17 23:55:49,108 INFO L858 garLoopResultBuilder]: For program point L7173-1(line 7173) no Hoare annotation was computed. [2021-12-17 23:55:49,108 INFO L854 garLoopResultBuilder]: At program point L7173(line 7173) the Hoare annotation is: false [2021-12-17 23:55:49,109 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-17 23:55:49,109 INFO L858 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2021-12-17 23:55:49,109 INFO L854 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: false [2021-12-17 23:55:49,109 INFO L858 garLoopResultBuilder]: For program point L7174(lines 7174 7176) no Hoare annotation was computed. [2021-12-17 23:55:49,109 INFO L858 garLoopResultBuilder]: For program point L6819-1(line 6819) no Hoare annotation was computed. [2021-12-17 23:55:49,109 INFO L854 garLoopResultBuilder]: At program point L6819(line 6819) the Hoare annotation is: false [2021-12-17 23:55:49,109 INFO L858 garLoopResultBuilder]: For program point L7166(lines 7166 7170) no Hoare annotation was computed. [2021-12-17 23:55:49,109 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-17 23:55:49,110 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-17 23:55:49,110 INFO L858 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2021-12-17 23:55:49,110 INFO L854 garLoopResultBuilder]: At program point L8983(line 8983) the Hoare annotation is: false [2021-12-17 23:55:49,110 INFO L854 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: false [2021-12-17 23:55:49,110 INFO L858 garLoopResultBuilder]: For program point L8983-1(line 8983) no Hoare annotation was computed. [2021-12-17 23:55:49,110 INFO L858 garLoopResultBuilder]: For program point L8975-2(line 8975) no Hoare annotation was computed. [2021-12-17 23:55:49,110 INFO L854 garLoopResultBuilder]: At program point L8975(line 8975) the Hoare annotation is: false [2021-12-17 23:55:49,110 INFO L854 garLoopResultBuilder]: At program point L8975-1(line 8975) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_#t~ret1213#1|) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset| 8)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (< 1 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (<= |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_#t~ret1213#1| 0) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|) (< 0 |#StackHeapBarrier|) (= 0 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|)) [2021-12-17 23:55:49,111 INFO L858 garLoopResultBuilder]: For program point L7175-1(line 7175) no Hoare annotation was computed. [2021-12-17 23:55:49,111 INFO L854 garLoopResultBuilder]: At program point L7175(line 7175) the Hoare annotation is: false [2021-12-17 23:55:49,111 INFO L854 garLoopResultBuilder]: At program point L6820-1(line 6820) the Hoare annotation is: false [2021-12-17 23:55:49,111 INFO L861 garLoopResultBuilder]: At program point L9000(line 9000) the Hoare annotation is: true [2021-12-17 23:55:49,111 INFO L854 garLoopResultBuilder]: At program point L6820(line 6820) the Hoare annotation is: false [2021-12-17 23:55:49,111 INFO L858 garLoopResultBuilder]: For program point L8967(lines 8967 8999) no Hoare annotation was computed. [2021-12-17 23:55:49,111 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 23:55:49,112 INFO L858 garLoopResultBuilder]: For program point L7473-1(line 7473) no Hoare annotation was computed. [2021-12-17 23:55:49,112 INFO L854 garLoopResultBuilder]: At program point L7473(line 7473) the Hoare annotation is: false [2021-12-17 23:55:49,112 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-17 23:55:49,112 INFO L858 garLoopResultBuilder]: For program point L6821(line 6821) no Hoare annotation was computed. [2021-12-17 23:55:49,112 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-17 23:55:49,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 23:55:49,112 INFO L854 garLoopResultBuilder]: At program point L7474(line 7474) the Hoare annotation is: false [2021-12-17 23:55:49,112 INFO L858 garLoopResultBuilder]: For program point L7474-2(line 7474) no Hoare annotation was computed. [2021-12-17 23:55:49,113 INFO L854 garLoopResultBuilder]: At program point L7474-1(line 7474) the Hoare annotation is: false [2021-12-17 23:55:49,113 INFO L854 garLoopResultBuilder]: At program point L8994(line 8994) the Hoare annotation is: false [2021-12-17 23:55:49,113 INFO L858 garLoopResultBuilder]: For program point L7169-1(line 7169) no Hoare annotation was computed. [2021-12-17 23:55:49,113 INFO L858 garLoopResultBuilder]: For program point L8986(lines 8986 8991) no Hoare annotation was computed. [2021-12-17 23:55:49,113 INFO L854 garLoopResultBuilder]: At program point L7169(line 7169) the Hoare annotation is: false [2021-12-17 23:55:49,113 INFO L858 garLoopResultBuilder]: For program point L8994-1(line 8994) no Hoare annotation was computed. [2021-12-17 23:55:49,113 INFO L854 garLoopResultBuilder]: At program point L7161(lines 7161 7177) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (not (= 0 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~c_str~0#1.base|)) (= |ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base| |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (<= (mod |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~str_len~0#1| 18446744073709551616) 0) (= 1 (select |#valid| |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|) (not (= 0 |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base|)) (not (= 0 |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base|)) (< 0 |#StackHeapBarrier|) (< 1 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.base|) (= 0 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|)) [2021-12-17 23:55:49,113 INFO L854 garLoopResultBuilder]: At program point L8986-1(lines 8986 8991) the Hoare annotation is: false [2021-12-17 23:55:49,114 INFO L854 garLoopResultBuilder]: At program point L7475(lines 7465 7476) the Hoare annotation is: false [2021-12-17 23:55:49,114 INFO L854 garLoopResultBuilder]: At program point L7467-1(line 7467) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_byte_buf_eq_c_str_#t~ret728#1| 0) (= |ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset| 0) (< 1 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (< 0 |#StackHeapBarrier|) (= 0 |ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|) (< 1 |ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base|) (<= 0 |ULTIMATE.start_aws_byte_buf_eq_c_str_#t~ret728#1|)) [2021-12-17 23:55:49,114 INFO L854 garLoopResultBuilder]: At program point L7467(line 7467) the Hoare annotation is: false [2021-12-17 23:55:49,114 INFO L854 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: false [2021-12-17 23:55:49,114 INFO L858 garLoopResultBuilder]: For program point L7467-2(line 7467) no Hoare annotation was computed. [2021-12-17 23:55:49,114 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-17 23:55:49,114 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-17 23:55:49,115 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-17 23:55:49,115 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-17 23:55:49,115 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-17 23:55:49,115 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-17 23:55:49,118 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:55:49,119 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 23:55:49,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21,QUANTIFIED] [2021-12-17 23:55:49,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:55:49,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] [2021-12-17 23:55:49,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:55:49,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] [2021-12-17 23:55:49,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21,QUANTIFIED] [2021-12-17 23:55:49,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:55:49,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] [2021-12-17 23:55:49,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:55:49,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] [2021-12-17 23:55:49,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 11:55:49 BoogieIcfgContainer [2021-12-17 23:55:49,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 23:55:49,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 23:55:49,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 23:55:49,136 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 23:55:49,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:49:58" (3/4) ... [2021-12-17 23:55:49,138 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 23:55:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-17 23:55:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure save_byte_from_array [2021-12-17 23:55:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-17 23:55:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-17 23:55:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-17 23:55:49,145 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-17 23:55:49,145 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-17 23:55:49,145 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq_c_str [2021-12-17 23:55:49,145 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-17 23:55:49,145 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assert_byte_from_buffer_matches [2021-12-17 23:55:49,160 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2021-12-17 23:55:49,161 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2021-12-17 23:55:49,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-17 23:55:49,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-17 23:55:49,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-17 23:55:49,166 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-17 23:55:49,167 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 23:55:49,168 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 23:55:49,193 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((forall v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21 : int :: !(0 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21][16] % 18446744073709551616)) || (forall v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3][8] == 0) || !(#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3][8] == 0))) || !(0 < unknown-#StackHeapBarrier-unknown)) || (\old(array_len) == array_len && \old(array_len) <= 18446744073709551616 * ((\old(array_len) + -1) / 18446744073709551616) + 18446744073709551615)) || (\old(array_len) == array_len && i == 0) [2021-12-17 23:55:49,194 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((buf == buf && !(0 == c_str)) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && str_len % 18446744073709551616 <= 0) && 1 == \valid[buf]) && buf == buf) && !(0 == str)) && !(0 == \result)) && 0 < unknown-#StackHeapBarrier-unknown) && 1 < \old_byte_from_str) && 0 == buf [2021-12-17 23:55:49,803 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 23:55:49,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 23:55:49,803 INFO L158 Benchmark]: Toolchain (without parser) took 355405.59ms. Allocated memory was 100.7MB in the beginning and 627.0MB in the end (delta: 526.4MB). Free memory was 58.7MB in the beginning and 472.6MB in the end (delta: -413.9MB). Peak memory consumption was 414.3MB. Max. memory is 16.1GB. [2021-12-17 23:55:49,804 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 53.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 23:55:49,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2230.45ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 58.6MB in the beginning and 63.2MB in the end (delta: -4.6MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2021-12-17 23:55:49,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 202.28ms. Allocated memory is still 121.6MB. Free memory was 63.2MB in the beginning and 51.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 23:55:49,804 INFO L158 Benchmark]: Boogie Preprocessor took 88.71ms. Allocated memory is still 121.6MB. Free memory was 51.3MB in the beginning and 43.7MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 23:55:49,805 INFO L158 Benchmark]: RCFGBuilder took 1175.34ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 43.7MB in the beginning and 80.0MB in the end (delta: -36.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2021-12-17 23:55:49,805 INFO L158 Benchmark]: TraceAbstraction took 351032.57ms. Allocated memory was 159.4MB in the beginning and 627.0MB in the end (delta: 467.7MB). Free memory was 80.0MB in the beginning and 554.4MB in the end (delta: -474.3MB). Peak memory consumption was 371.9MB. Max. memory is 16.1GB. [2021-12-17 23:55:49,805 INFO L158 Benchmark]: Witness Printer took 667.65ms. Allocated memory is still 627.0MB. Free memory was 553.3MB in the beginning and 472.6MB in the end (delta: 80.7MB). Peak memory consumption was 382.7MB. Max. memory is 16.1GB. [2021-12-17 23:55:49,806 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.20ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 53.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2230.45ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 58.6MB in the beginning and 63.2MB in the end (delta: -4.6MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 202.28ms. Allocated memory is still 121.6MB. Free memory was 63.2MB in the beginning and 51.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.71ms. Allocated memory is still 121.6MB. Free memory was 51.3MB in the beginning and 43.7MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1175.34ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 43.7MB in the beginning and 80.0MB in the end (delta: -36.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 351032.57ms. Allocated memory was 159.4MB in the beginning and 627.0MB in the end (delta: 467.7MB). Free memory was 80.0MB in the beginning and 554.4MB in the end (delta: -474.3MB). Peak memory consumption was 371.9MB. Max. memory is 16.1GB. * Witness Printer took 667.65ms. Allocated memory is still 627.0MB. Free memory was 553.3MB in the beginning and 472.6MB in the end (delta: 80.7MB). Peak memory consumption was 382.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 351.0s, OverallIterations: 28, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 168.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8648 SdHoareTripleChecker+Valid, 32.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8350 mSDsluCounter, 37586 SdHoareTripleChecker+Invalid, 28.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17297 IncrementalHoareTripleChecker+Unchecked, 32576 mSDsCounter, 5796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49228 IncrementalHoareTripleChecker+Invalid, 72321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5796 mSolverCounterUnsat, 5010 mSDtfsCounter, 49228 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6748 GetRequests, 5457 SyntacticMatches, 140 SemanticMatches, 1151 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 22065 ImplicationChecksByTransitivity, 222.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=511occurred in iteration=18, InterpolantAutomatonStates: 648, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 1788 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 1066 PreInvPairs, 1094 NumberOfFragments, 277 HoareAnnotationTreeSize, 1066 FomulaSimplifications, 178 FormulaSimplificationTreeSizeReduction, 44.1s HoareSimplificationTime, 53 FomulaSimplificationsInter, 11046087 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 12.9s SatisfiabilityAnalysisTime, 114.9s InterpolantComputationTime, 7763 NumberOfCodeBlocks, 7763 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 8884 ConstructedInterpolants, 582 QuantifiedInterpolants, 42370 SizeOfPredicates, 410 NumberOfNonLiveVariables, 59346 ConjunctsInSsa, 1067 ConjunctsInUnsatCore, 56 InterpolantComputations, 17 PerfectInterpolantSequences, 13282/14336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9000]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7784]: Loop Invariant [2021-12-17 23:55:49,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21,QUANTIFIED] [2021-12-17 23:55:49,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:55:49,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] [2021-12-17 23:55:49,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:55:49,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] [2021-12-17 23:55:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21,QUANTIFIED] [2021-12-17 23:55:49,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 23:55:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] [2021-12-17 23:55:49,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 23:55:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3,QUANTIFIED] Derived loop invariant: ((((forall v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21 : int :: !(0 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_21][16] % 18446744073709551616)) || (forall v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3][8] == 0) || !(#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_3][8] == 0))) || !(0 < unknown-#StackHeapBarrier-unknown)) || (\old(array_len) == array_len && \old(array_len) <= 18446744073709551616 * ((\old(array_len) + -1) / 18446744073709551616) + 18446744073709551615)) || (\old(array_len) == array_len && i == 0) - InvariantResult [Line: 7161]: Loop Invariant Derived loop invariant: ((((((((((buf == buf && !(0 == c_str)) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && str_len % 18446744073709551616 <= 0) && 1 == \valid[buf]) && buf == buf) && !(0 == str)) && !(0 == \result)) && 0 < unknown-#StackHeapBarrier-unknown) && 1 < \old_byte_from_str) && 0 == buf - InvariantResult [Line: 7465]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6818]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-12-17 23:55:50,020 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-12-17 23:55:50,047 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE