./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_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_linked_list_back_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 f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:44:51,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:44:51,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:44:51,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:44:51,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:44:51,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:44:51,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:44:51,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:44:51,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:44:51,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:44:51,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:44:51,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:44:51,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:44:51,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:44:51,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:44:51,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:44:51,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:44:51,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:44:51,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:44:51,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:44:51,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:44:51,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:44:51,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:44:51,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:44:51,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:44:51,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:44:51,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:44:51,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:44:51,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:44:51,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:44:51,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:44:51,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:44:51,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:44:51,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:44:51,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:44:51,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:44:51,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:44:51,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:44:51,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:44:51,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:44:51,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:44:51,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 00:44:51,969 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:44:51,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:44:51,970 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:44:51,970 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:44:51,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:44:51,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:44:51,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:44:51,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:44:51,972 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:44:51,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:44:51,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 00:44:51,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:44:51,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:44:51,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:44:51,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:44:51,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:44:51,974 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:44:51,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:44:51,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:44:51,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:44:51,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:44:51,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:44:51,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:44:51,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:44:51,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:44:51,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 00:44:51,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 00:44:51,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:44:51,976 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:44:51,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:44:51,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:44:51,977 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 -> f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 [2021-12-18 00:44:52,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:44:52,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:44:52,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:44:52,198 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:44:52,199 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:44:52,200 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2021-12-18 00:44:52,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2da5b59/1c4b6251c2c843f496b9a038179bffab/FLAGa4a55a12c [2021-12-18 00:44:52,772 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:44:52,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2021-12-18 00:44:52,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2da5b59/1c4b6251c2c843f496b9a038179bffab/FLAGa4a55a12c [2021-12-18 00:44:53,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2da5b59/1c4b6251c2c843f496b9a038179bffab [2021-12-18 00:44:53,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:44:53,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:44:53,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:44:53,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:44:53,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:44:53,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:44:53" (1/1) ... [2021-12-18 00:44:53,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608a1d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:53, skipping insertion in model container [2021-12-18 00:44:53,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:44:53" (1/1) ... [2021-12-18 00:44:53,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:44:53,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:44:53,496 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_linked_list_back_harness.i[4494,4507] [2021-12-18 00:44:53,501 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_linked_list_back_harness.i[4554,4567] [2021-12-18 00:44:53,916 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,917 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,917 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,917 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,918 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,925 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,930 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,935 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,935 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,935 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:53,936 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,079 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:44:54,080 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:44:54,081 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:44:54,081 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:44:54,082 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:44:54,083 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:44:54,083 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:44:54,084 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:44:54,084 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:44:54,092 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:44:54,179 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:44:54,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:44:54,206 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:44:54,214 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_linked_list_back_harness.i[4494,4507] [2021-12-18 00:44:54,215 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_linked_list_back_harness.i[4554,4567] [2021-12-18 00:44:54,235 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,236 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,236 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,236 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,237 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,240 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,241 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,241 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,242 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,242 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,243 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,243 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,243 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:44:54,329 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:44:54,330 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:44:54,331 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:44:54,331 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:44:54,336 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:44:54,372 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:44:54,373 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:44:54,373 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:44:54,373 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:44:54,373 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:44:54,398 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:44:54,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:44:54,543 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:44:54,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54 WrapperNode [2021-12-18 00:44:54,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:44:54,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:44:54,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:44:54,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:44:54,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,663 INFO L137 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2021-12-18 00:44:54,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:44:54,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:44:54,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:44:54,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:44:54,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:44:54,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:44:54,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:44:54,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:44:54,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (1/1) ... [2021-12-18 00:44:54,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:44:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:44:54,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 00:44:54,721 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-18 00:44:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2021-12-18 00:44:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2021-12-18 00:44:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 00:44:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:44:54,747 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:44:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2021-12-18 00:44:54,747 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2021-12-18 00:44:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 00:44:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2021-12-18 00:44:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2021-12-18 00:44:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:44:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 00:44:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:44:54,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:44:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2021-12-18 00:44:54,750 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2021-12-18 00:44:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:44:54,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:44:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 00:44:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 00:44:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:44:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 00:44:54,751 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 00:44:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2021-12-18 00:44:54,751 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2021-12-18 00:44:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 00:44:54,920 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:44:54,936 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:44:55,163 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:44:55,168 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:44:55,168 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-18 00:44:55,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:44:55 BoogieIcfgContainer [2021-12-18 00:44:55,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:44:55,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:44:55,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:44:55,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:44:55,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:44:53" (1/3) ... [2021-12-18 00:44:55,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7585120e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:44:55, skipping insertion in model container [2021-12-18 00:44:55,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:44:54" (2/3) ... [2021-12-18 00:44:55,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7585120e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:44:55, skipping insertion in model container [2021-12-18 00:44:55,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:44:55" (3/3) ... [2021-12-18 00:44:55,179 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2021-12-18 00:44:55,183 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:44:55,183 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:44:55,211 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:44:55,215 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-18 00:44:55,216 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:44:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-12-18 00:44:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-18 00:44:55,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:44:55,233 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:44:55,233 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:44:55,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:44:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 464723229, now seen corresponding path program 1 times [2021-12-18 00:44:55,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:44:55,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813732282] [2021-12-18 00:44:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:55,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:44:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:44:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:44:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:44:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:44:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:44:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:44:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 00:44:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 00:44:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:44:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:44:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 00:44:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 00:44:55,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:44:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813732282] [2021-12-18 00:44:55,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813732282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:44:55,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:44:55,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 00:44:55,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601593670] [2021-12-18 00:44:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:44:55,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 00:44:55,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:44:55,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 00:44:55,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 00:44:55,682 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-18 00:44:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:44:55,703 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2021-12-18 00:44:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 00:44:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2021-12-18 00:44:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:44:55,714 INFO L225 Difference]: With dead ends: 188 [2021-12-18 00:44:55,715 INFO L226 Difference]: Without dead ends: 93 [2021-12-18 00:44:55,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 00:44:55,721 INFO L933 BasicCegarLoop]: 127 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, 127 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-18 00:44:55,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:44:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-18 00:44:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-18 00:44:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-18 00:44:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2021-12-18 00:44:55,751 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2021-12-18 00:44:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:44:55,752 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2021-12-18 00:44:55,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-18 00:44:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2021-12-18 00:44:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-18 00:44:55,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:44:55,755 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:44:55,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 00:44:55,755 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:44:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:44:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 463621205, now seen corresponding path program 1 times [2021-12-18 00:44:55,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:44:55,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699595808] [2021-12-18 00:44:55,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:55,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:44:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:44:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:44:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:44:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:44:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:44:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:44:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 00:44:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 00:44:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:44:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:44:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 00:44:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-18 00:44:55,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:44:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699595808] [2021-12-18 00:44:55,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699595808] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:44:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677504997] [2021-12-18 00:44:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:55,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:44:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:44:55,973 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-18 00:44:55,985 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-18 00:44:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:56,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-18 00:44:56,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:44:56,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,270 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 18 treesize of output 19 [2021-12-18 00:44:56,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,281 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 18 treesize of output 19 [2021-12-18 00:44:56,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,340 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 28 treesize of output 31 [2021-12-18 00:44:56,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:56,349 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 26 treesize of output 29 [2021-12-18 00:44:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-12-18 00:44:57,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:44:57,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677504997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:44:57,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:44:57,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2021-12-18 00:44:57,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521334406] [2021-12-18 00:44:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:44:57,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:44:57,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:44:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:44:57,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:44:57,406 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-18 00:44:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:44:57,575 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2021-12-18 00:44:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:44:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 84 [2021-12-18 00:44:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:44:57,579 INFO L225 Difference]: With dead ends: 201 [2021-12-18 00:44:57,579 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 00:44:57,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 13 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-18 00:44:57,581 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 33 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:44:57,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 558 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2021-12-18 00:44:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 00:44:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2021-12-18 00:44:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 88 states have internal predecessors, (107), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2021-12-18 00:44:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2021-12-18 00:44:57,596 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 84 [2021-12-18 00:44:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:44:57,596 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2021-12-18 00:44:57,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-18 00:44:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2021-12-18 00:44:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-18 00:44:57,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:44:57,599 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:44:57,618 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-18 00:44:57,799 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-18 00:44:57,800 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:44:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:44:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash -345725421, now seen corresponding path program 1 times [2021-12-18 00:44:57,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:44:57,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119161236] [2021-12-18 00:44:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:57,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:44:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:44:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:44:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:44:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:44:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:44:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:44:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 00:44:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 00:44:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:44:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:44:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 00:44:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-18 00:44:57,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:44:57,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119161236] [2021-12-18 00:44:57,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119161236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:44:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108000216] [2021-12-18 00:44:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:57,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:44:57,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:44:57,990 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-18 00:44:57,991 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-18 00:44:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:58,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 00:44:58,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:44:58,174 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:44:58,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:44:58,184 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:44:58,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:45:00,406 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0)))) is different from true [2021-12-18 00:45:02,471 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 24)) 0)))) is different from true [2021-12-18 00:45:12,564 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 24)) 0)))) is different from true [2021-12-18 00:45:20,635 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 24)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 24)) 0)))) is different from true [2021-12-18 00:45:28,696 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:45:36,834 WARN L227 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:45:44,936 WARN L227 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:45:50,994 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:45:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2021-12-18 00:45:51,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:45:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-18 00:45:53,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108000216] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:45:53,538 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:45:53,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 11] total 27 [2021-12-18 00:45:53,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917276032] [2021-12-18 00:45:53,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:45:53,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-18 00:45:53,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:45:53,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-18 00:45:53,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=438, Unknown=8, NotChecked=180, Total=702 [2021-12-18 00:45:53,546 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2021-12-18 00:46:30,155 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:46:38,213 WARN L227 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:46:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:46,531 INFO L93 Difference]: Finished difference Result 270 states and 364 transitions. [2021-12-18 00:46:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 00:46:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 84 [2021-12-18 00:46:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:46,534 INFO L225 Difference]: With dead ends: 270 [2021-12-18 00:46:46,534 INFO L226 Difference]: Without dead ends: 153 [2021-12-18 00:46:46,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 107.1s TimeCoverageRelationStatistics Valid=224, Invalid=1174, Unknown=24, NotChecked=300, Total=1722 [2021-12-18 00:46:46,535 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 98 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 671 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:46,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1323 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 618 Invalid, 0 Unknown, 671 Unchecked, 0.4s Time] [2021-12-18 00:46:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-18 00:46:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2021-12-18 00:46:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 104 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2021-12-18 00:46:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2021-12-18 00:46:46,559 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 84 [2021-12-18 00:46:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:46,560 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2021-12-18 00:46:46,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2021-12-18 00:46:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2021-12-18 00:46:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-18 00:46:46,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:46,564 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:46:46,583 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-18 00:46:46,765 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-18 00:46:46,765 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash -583798319, now seen corresponding path program 1 times [2021-12-18 00:46:46,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964508230] [2021-12-18 00:46:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:46,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-18 00:46:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:46:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 00:46:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 00:46:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-18 00:46:46,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:46,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964508230] [2021-12-18 00:46:46,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964508230] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:46,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671862759] [2021-12-18 00:46:46,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:46,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:46,949 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-18 00:46:46,954 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-18 00:46:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 00:46:47,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 00:46:47,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:46:47,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671862759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:47,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:46:47,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2021-12-18 00:46:47,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165016383] [2021-12-18 00:46:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:47,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:46:47,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:46:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:46:47,258 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-18 00:46:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:47,458 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2021-12-18 00:46:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:46:47,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2021-12-18 00:46:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:47,460 INFO L225 Difference]: With dead ends: 241 [2021-12-18 00:46:47,460 INFO L226 Difference]: Without dead ends: 146 [2021-12-18 00:46:47,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-12-18 00:46:47,461 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 149 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:47,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 548 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:46:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-18 00:46:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-12-18 00:46:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 104 states have internal predecessors, (127), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2021-12-18 00:46:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2021-12-18 00:46:47,482 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 86 [2021-12-18 00:46:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:47,482 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2021-12-18 00:46:47,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-18 00:46:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2021-12-18 00:46:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-18 00:46:47,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:47,487 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:46:47,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-18 00:46:47,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:47,691 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1801781246, now seen corresponding path program 1 times [2021-12-18 00:46:47,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:47,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954741766] [2021-12-18 00:46:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:47,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:46:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 00:46:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 00:46:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 00:46:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-18 00:46:47,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954741766] [2021-12-18 00:46:47,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954741766] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396808799] [2021-12-18 00:46:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:47,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:47,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:47,881 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-18 00:46:47,882 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-18 00:46:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 00:46:48,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 00:46:48,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:46:48,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396808799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:48,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:46:48,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-12-18 00:46:48,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085235061] [2021-12-18 00:46:48,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:48,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 00:46:48,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 00:46:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-12-18 00:46:48,181 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-18 00:46:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:48,426 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2021-12-18 00:46:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:46:48,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2021-12-18 00:46:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:48,427 INFO L225 Difference]: With dead ends: 250 [2021-12-18 00:46:48,427 INFO L226 Difference]: Without dead ends: 154 [2021-12-18 00:46:48,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-12-18 00:46:48,429 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 185 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:48,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 613 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:46:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-18 00:46:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2021-12-18 00:46:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 105 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2021-12-18 00:46:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2021-12-18 00:46:48,441 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 88 [2021-12-18 00:46:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:48,442 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2021-12-18 00:46:48,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-18 00:46:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2021-12-18 00:46:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-18 00:46:48,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:48,443 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-18 00:46:48,462 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-18 00:46:48,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:48,658 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash -595148758, now seen corresponding path program 1 times [2021-12-18 00:46:48,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:48,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456790325] [2021-12-18 00:46:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:48,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:46:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:46:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:46:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 00:46:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 00:46:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-18 00:46:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:46:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-18 00:46:48,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:48,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456790325] [2021-12-18 00:46:48,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456790325] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:48,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85416052] [2021-12-18 00:46:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:48,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:48,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:48,825 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-18 00:46:48,827 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-18 00:46:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:48,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 00:46:48,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-18 00:46:49,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:46:49,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85416052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:49,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:46:49,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-18 00:46:49,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291258651] [2021-12-18 00:46:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:49,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 00:46:49,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 00:46:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:46:49,092 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-18 00:46:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:49,103 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2021-12-18 00:46:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 00:46:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2021-12-18 00:46:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:49,107 INFO L225 Difference]: With dead ends: 246 [2021-12-18 00:46:49,107 INFO L226 Difference]: Without dead ends: 153 [2021-12-18 00:46:49,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:46:49,108 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:49,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:46:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-18 00:46:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2021-12-18 00:46:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 106 states have internal predecessors, (129), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2021-12-18 00:46:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2021-12-18 00:46:49,116 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 91 [2021-12-18 00:46:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:49,116 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2021-12-18 00:46:49,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-18 00:46:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2021-12-18 00:46:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-18 00:46:49,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:49,117 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-18 00:46:49,145 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-18 00:46:49,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:49,328 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1734248118, now seen corresponding path program 1 times [2021-12-18 00:46:49,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873726440] [2021-12-18 00:46:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:49,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:46:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 00:46:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:46:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:46:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:46:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-18 00:46:49,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873726440] [2021-12-18 00:46:49,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873726440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515090078] [2021-12-18 00:46:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:49,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:49,511 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-18 00:46:49,512 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-18 00:46:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:49,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-18 00:46:49,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:49,672 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:46:49,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:46:49,684 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:46:49,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:46:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 00:46:50,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:46:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-18 00:46:50,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515090078] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:46:50,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:46:50,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2021-12-18 00:46:50,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339128420] [2021-12-18 00:46:50,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:46:50,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 00:46:50,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 00:46:50,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-12-18 00:46:50,824 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-18 00:46:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:51,265 INFO L93 Difference]: Finished difference Result 261 states and 341 transitions. [2021-12-18 00:46:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 00:46:51,266 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 97 [2021-12-18 00:46:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:51,269 INFO L225 Difference]: With dead ends: 261 [2021-12-18 00:46:51,270 INFO L226 Difference]: Without dead ends: 167 [2021-12-18 00:46:51,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 197 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2021-12-18 00:46:51,271 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 114 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:51,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 1359 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 397 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2021-12-18 00:46:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-18 00:46:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2021-12-18 00:46:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 115 states have internal predecessors, (139), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (33), 27 states have call predecessors, (33), 29 states have call successors, (33) [2021-12-18 00:46:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2021-12-18 00:46:51,283 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 97 [2021-12-18 00:46:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:51,283 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2021-12-18 00:46:51,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-18 00:46:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2021-12-18 00:46:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-18 00:46:51,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:51,284 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-18 00:46:51,302 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-18 00:46:51,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:51,502 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1176254157, now seen corresponding path program 1 times [2021-12-18 00:46:51,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:51,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258825202] [2021-12-18 00:46:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:51,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:46:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:46:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 00:46:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:46:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:46:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-18 00:46:51,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258825202] [2021-12-18 00:46:51,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258825202] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461032409] [2021-12-18 00:46:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:51,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:51,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:51,681 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-18 00:46:51,682 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-18 00:46:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:51,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 00:46:51,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:51,836 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:46:51,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:46:51,844 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:46:51,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:46:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 00:46:52,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:46:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-18 00:46:53,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461032409] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:46:53,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:46:53,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 26 [2021-12-18 00:46:53,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585167428] [2021-12-18 00:46:53,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:46:53,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 00:46:53,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 00:46:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:46:53,094 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-18 00:46:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:54,270 INFO L93 Difference]: Finished difference Result 387 states and 527 transitions. [2021-12-18 00:46:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 00:46:54,275 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 99 [2021-12-18 00:46:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:54,276 INFO L225 Difference]: With dead ends: 387 [2021-12-18 00:46:54,276 INFO L226 Difference]: Without dead ends: 282 [2021-12-18 00:46:54,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 210 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=442, Invalid=1910, Unknown=0, NotChecked=0, Total=2352 [2021-12-18 00:46:54,278 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 360 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:54,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1773 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 846 Invalid, 0 Unknown, 147 Unchecked, 0.5s Time] [2021-12-18 00:46:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-18 00:46:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2021-12-18 00:46:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 182 states have (on average 1.2747252747252746) internal successors, (232), 187 states have internal predecessors, (232), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-12-18 00:46:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2021-12-18 00:46:54,301 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 99 [2021-12-18 00:46:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:54,302 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2021-12-18 00:46:54,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-18 00:46:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2021-12-18 00:46:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-18 00:46:54,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:54,306 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-18 00:46:54,325 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-18 00:46:54,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:54,524 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:54,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1043485939, now seen corresponding path program 1 times [2021-12-18 00:46:54,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:54,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966316951] [2021-12-18 00:46:54,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:54,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:46:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:46:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 00:46:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:46:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:46:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-18 00:46:54,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:54,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966316951] [2021-12-18 00:46:54,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966316951] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:54,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828499308] [2021-12-18 00:46:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:54,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:54,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:54,667 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-18 00:46:54,691 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-18 00:46:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:54,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 00:46:54,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 00:46:54,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:46:54,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828499308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:54,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:46:54,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-18 00:46:54,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422419752] [2021-12-18 00:46:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:54,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 00:46:54,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 00:46:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 00:46:54,897 INFO L87 Difference]: Start difference. First operand 243 states and 319 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-18 00:46:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:54,929 INFO L93 Difference]: Finished difference Result 390 states and 520 transitions. [2021-12-18 00:46:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:46:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2021-12-18 00:46:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:54,931 INFO L225 Difference]: With dead ends: 390 [2021-12-18 00:46:54,931 INFO L226 Difference]: Without dead ends: 238 [2021-12-18 00:46:54,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 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-18 00:46:54,932 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:54,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:46:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-18 00:46:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2021-12-18 00:46:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 177 states have (on average 1.2485875706214689) internal successors, (221), 182 states have internal predecessors, (221), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-12-18 00:46:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 308 transitions. [2021-12-18 00:46:54,943 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 308 transitions. Word has length 99 [2021-12-18 00:46:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:54,943 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 308 transitions. [2021-12-18 00:46:54,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-18 00:46:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 308 transitions. [2021-12-18 00:46:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-18 00:46:54,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:54,944 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-18 00:46:54,969 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-18 00:46:55,163 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,SelfDestructingSolverStorable8 [2021-12-18 00:46:55,163 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1346020279, now seen corresponding path program 1 times [2021-12-18 00:46:55,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987920880] [2021-12-18 00:46:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:55,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:46:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:46:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 00:46:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:46:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:46:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-18 00:46:55,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:55,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987920880] [2021-12-18 00:46:55,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987920880] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:55,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400938635] [2021-12-18 00:46:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:55,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:55,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:55,276 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-18 00:46:55,277 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-18 00:46:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 00:46:55,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-18 00:46:55,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:46:55,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400938635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:55,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:46:55,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-18 00:46:55,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870374906] [2021-12-18 00:46:55,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:55,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 00:46:55,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:55,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 00:46:55,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 00:46:55,529 INFO L87 Difference]: Start difference. First operand 238 states and 308 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-18 00:46:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:55,557 INFO L93 Difference]: Finished difference Result 328 states and 431 transitions. [2021-12-18 00:46:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:46:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2021-12-18 00:46:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:55,558 INFO L225 Difference]: With dead ends: 328 [2021-12-18 00:46:55,558 INFO L226 Difference]: Without dead ends: 168 [2021-12-18 00:46:55,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 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-18 00:46:55,560 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:55,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 351 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:46:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-18 00:46:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2021-12-18 00:46:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 117 states have internal predecessors, (135), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2021-12-18 00:46:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2021-12-18 00:46:55,568 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 99 [2021-12-18 00:46:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:55,568 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2021-12-18 00:46:55,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-18 00:46:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2021-12-18 00:46:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-18 00:46:55,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:55,570 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-18 00:46:55,587 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-18 00:46:55,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-18 00:46:55,787 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1287286857, now seen corresponding path program 1 times [2021-12-18 00:46:55,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:55,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580899832] [2021-12-18 00:46:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:55,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:46:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:46:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 00:46:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:46:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 00:46:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-18 00:46:56,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:56,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580899832] [2021-12-18 00:46:56,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580899832] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:56,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489039957] [2021-12-18 00:46:56,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:56,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:56,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:56,023 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-18 00:46:56,025 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-18 00:46:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:56,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-18 00:46:56,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:56,243 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:46:56,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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:46:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 00:46:57,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:46:57,562 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 236 treesize of output 220 [2021-12-18 00:46:57,565 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 220 treesize of output 204 [2021-12-18 00:46:57,568 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 204 treesize of output 196 [2021-12-18 00:46:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-18 00:46:57,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489039957] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:46:57,712 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:46:57,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 38 [2021-12-18 00:46:57,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863777320] [2021-12-18 00:46:57,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:46:57,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 00:46:57,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:57,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 00:46:57,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2021-12-18 00:46:57,714 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) [2021-12-18 00:46:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:58,821 INFO L93 Difference]: Finished difference Result 405 states and 507 transitions. [2021-12-18 00:46:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 00:46:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) Word has length 100 [2021-12-18 00:46:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:58,823 INFO L225 Difference]: With dead ends: 405 [2021-12-18 00:46:58,823 INFO L226 Difference]: Without dead ends: 317 [2021-12-18 00:46:58,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 190 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=383, Invalid=3157, Unknown=0, NotChecked=0, Total=3540 [2021-12-18 00:46:58,824 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 670 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:58,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 2095 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1222 Invalid, 0 Unknown, 230 Unchecked, 0.7s Time] [2021-12-18 00:46:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-12-18 00:46:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 248. [2021-12-18 00:46:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 179 states have (on average 1.1955307262569832) internal successors, (214), 183 states have internal predecessors, (214), 43 states have call successors, (43), 24 states have call predecessors, (43), 25 states have return successors, (50), 40 states have call predecessors, (50), 42 states have call successors, (50) [2021-12-18 00:46:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 307 transitions. [2021-12-18 00:46:58,837 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 307 transitions. Word has length 100 [2021-12-18 00:46:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:58,837 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 307 transitions. [2021-12-18 00:46:58,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) [2021-12-18 00:46:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 307 transitions. [2021-12-18 00:46:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-18 00:46:58,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:58,838 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:46:58,860 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-18 00:46:59,060 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,SelfDestructingSolverStorable10 [2021-12-18 00:46:59,060 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1381429819, now seen corresponding path program 1 times [2021-12-18 00:46:59,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735847123] [2021-12-18 00:46:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:59,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:46:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:46:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:46:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:46:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 00:46:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 00:46:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 00:46:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-18 00:46:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-18 00:46:59,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:59,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735847123] [2021-12-18 00:46:59,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735847123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:59,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:46:59,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 00:46:59,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180953717] [2021-12-18 00:46:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:59,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:46:59,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:59,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:46:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:46:59,190 INFO L87 Difference]: Start difference. First operand 248 states and 307 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 00:46:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:59,229 INFO L93 Difference]: Finished difference Result 517 states and 650 transitions. [2021-12-18 00:46:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:46:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2021-12-18 00:46:59,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:59,230 INFO L225 Difference]: With dead ends: 517 [2021-12-18 00:46:59,231 INFO L226 Difference]: Without dead ends: 241 [2021-12-18 00:46:59,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:46:59,232 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 37 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:59,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 720 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:46:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-18 00:46:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-12-18 00:46:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 172 states have (on average 1.1744186046511629) internal successors, (202), 176 states have internal predecessors, (202), 43 states have call successors, (43), 24 states have call predecessors, (43), 25 states have return successors, (50), 40 states have call predecessors, (50), 42 states have call successors, (50) [2021-12-18 00:46:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 295 transitions. [2021-12-18 00:46:59,241 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 295 transitions. Word has length 102 [2021-12-18 00:46:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:59,241 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 295 transitions. [2021-12-18 00:46:59,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 00:46:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 295 transitions. [2021-12-18 00:46:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-18 00:46:59,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:59,242 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:46:59,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 00:46:59,243 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:59,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2116106520, now seen corresponding path program 1 times [2021-12-18 00:46:59,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:59,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260444518] [2021-12-18 00:46:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:59,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:46:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:46:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:46:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:46:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:46:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:46:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:46:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 00:46:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:46:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:46:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:46:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:46:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-18 00:46:59,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:59,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260444518] [2021-12-18 00:46:59,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260444518] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:46:59,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336757840] [2021-12-18 00:46:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:59,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:59,480 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-18 00:46:59,481 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-18 00:46:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:59,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 00:46:59,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 00:46:59,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:46:59,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336757840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:59,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:46:59,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2021-12-18 00:46:59,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230749790] [2021-12-18 00:46:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:59,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:46:59,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:59,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:46:59,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:46:59,859 INFO L87 Difference]: Start difference. First operand 241 states and 295 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-18 00:47:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:47:00,025 INFO L93 Difference]: Finished difference Result 425 states and 534 transitions. [2021-12-18 00:47:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:47:00,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2021-12-18 00:47:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:47:00,026 INFO L225 Difference]: With dead ends: 425 [2021-12-18 00:47:00,026 INFO L226 Difference]: Without dead ends: 279 [2021-12-18 00:47:00,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:47:00,028 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 17 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:47:00,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 683 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2021-12-18 00:47:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-18 00:47:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 253. [2021-12-18 00:47:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 182 states have (on average 1.1813186813186813) internal successors, (215), 187 states have internal predecessors, (215), 43 states have call successors, (43), 24 states have call predecessors, (43), 27 states have return successors, (54), 41 states have call predecessors, (54), 42 states have call successors, (54) [2021-12-18 00:47:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 312 transitions. [2021-12-18 00:47:00,037 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 312 transitions. Word has length 110 [2021-12-18 00:47:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:47:00,037 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 312 transitions. [2021-12-18 00:47:00,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-18 00:47:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 312 transitions. [2021-12-18 00:47:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-18 00:47:00,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:47:00,039 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:47:00,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 00:47:00,256 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,SelfDestructingSolverStorable12 [2021-12-18 00:47:00,256 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:47:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:47:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -376942188, now seen corresponding path program 1 times [2021-12-18 00:47:00,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:47:00,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978395897] [2021-12-18 00:47:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:47:00,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:47:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:47:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:47:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:47:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:47:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:47:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:47:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:47:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:47:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 00:47:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 00:47:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:47:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 00:47:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 00:47:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-18 00:47:00,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:47:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978395897] [2021-12-18 00:47:00,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978395897] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:47:00,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382536596] [2021-12-18 00:47:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:47:00,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:47:00,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:47:00,419 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-18 00:47:00,421 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-18 00:47:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 00:47:00,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:47:00,619 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:47:00,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:47:00,631 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:47:00,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:47:01,458 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2021-12-18 00:47:02,203 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0)))) is different from true [2021-12-18 00:47:02,948 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_43 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) v_aws_linked_list_back_~list.offset_BEFORE_CALL_43) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_43 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) v_aws_linked_list_back_~list.offset_BEFORE_CALL_43) 0)))) is different from true [2021-12-18 00:47:03,650 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_44 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) v_aws_linked_list_back_~list.offset_BEFORE_CALL_44) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_44 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) v_aws_linked_list_back_~list.offset_BEFORE_CALL_44) 0)))) is different from true [2021-12-18 00:47:04,368 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_45 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) v_aws_linked_list_back_~list.offset_BEFORE_CALL_45) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_45 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) v_aws_linked_list_back_~list.offset_BEFORE_CALL_45) 0)))) is different from true [2021-12-18 00:47:05,068 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_46 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) v_aws_linked_list_back_~list.offset_BEFORE_CALL_46) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_46 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) v_aws_linked_list_back_~list.offset_BEFORE_CALL_46) 0)))) is different from true [2021-12-18 00:47:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 19 not checked. [2021-12-18 00:47:15,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:47:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-18 00:47:16,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382536596] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:47:16,438 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:47:16,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 11] total 31 [2021-12-18 00:47:16,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26659403] [2021-12-18 00:47:16,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:47:16,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 00:47:16,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:47:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 00:47:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=530, Unknown=10, NotChecked=306, Total=930 [2021-12-18 00:47:16,439 INFO L87 Difference]: Start difference. First operand 253 states and 312 transitions. Second operand has 31 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 8 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2021-12-18 00:47:17,408 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0)))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))))) is different from true [2021-12-18 00:47:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:47:26,547 INFO L93 Difference]: Finished difference Result 392 states and 490 transitions. [2021-12-18 00:47:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 00:47:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 8 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 112 [2021-12-18 00:47:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:47:26,548 INFO L225 Difference]: With dead ends: 392 [2021-12-18 00:47:26,548 INFO L226 Difference]: Without dead ends: 268 [2021-12-18 00:47:26,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 225 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=209, Invalid=1365, Unknown=14, NotChecked=574, Total=2162 [2021-12-18 00:47:26,550 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 101 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1132 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:47:26,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 1642 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 636 Invalid, 0 Unknown, 1132 Unchecked, 0.3s Time] [2021-12-18 00:47:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-18 00:47:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2021-12-18 00:47:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 178 states have internal predecessors, (205), 43 states have call successors, (43), 23 states have call predecessors, (43), 26 states have return successors, (53), 41 states have call predecessors, (53), 42 states have call successors, (53) [2021-12-18 00:47:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 301 transitions. [2021-12-18 00:47:26,560 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 301 transitions. Word has length 112 [2021-12-18 00:47:26,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:47:26,560 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 301 transitions. [2021-12-18 00:47:26,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 8 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2021-12-18 00:47:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 301 transitions. [2021-12-18 00:47:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-18 00:47:26,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:47:26,562 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:47:26,597 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-18 00:47:26,775 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,SelfDestructingSolverStorable13 [2021-12-18 00:47:26,775 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:47:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:47:26,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1093753190, now seen corresponding path program 1 times [2021-12-18 00:47:26,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:47:26,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940763399] [2021-12-18 00:47:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:47:26,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:47:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:47:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:47:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:47:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:47:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:47:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:47:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:47:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:47:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 00:47:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:47:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:47:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 00:47:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:47:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-18 00:47:27,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:47:27,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940763399] [2021-12-18 00:47:27,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940763399] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:47:27,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484686756] [2021-12-18 00:47:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:47:27,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:47:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:47:27,303 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-18 00:47:27,305 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-18 00:47:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:27,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 131 conjunts are in the unsatisfiable core [2021-12-18 00:47:27,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:47:27,594 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-18 00:47:27,598 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-18 00:47:27,602 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-18 00:47:27,604 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-18 00:47:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 00:47:29,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:47:43,070 WARN L227 SmtUtils]: Spent 10.16s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:47:53,928 WARN L227 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:47:55,123 INFO L354 Elim1Store]: treesize reduction 8, result has 95.2 percent of original size [2021-12-18 00:47:55,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 4324 treesize of output 4226 [2021-12-18 00:47:55,387 INFO L354 Elim1Store]: treesize reduction 30, result has 85.8 percent of original size [2021-12-18 00:47:55,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74008 treesize of output 68560 [2021-12-18 00:47:55,717 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:47:55,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90776 treesize of output 86190 [2021-12-18 00:47:56,530 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:47:56,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 84496 treesize of output 81053 [2021-12-18 00:47:57,436 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:47:57,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 93527 treesize of output 90512 [2021-12-18 00:48:00,671 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:48:00,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 85032 treesize of output 83247 [2021-12-18 00:48:01,415 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 00:48:01,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:48:01,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-18 00:48:01,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96091479] [2021-12-18 00:48:01,415 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 00:48:01,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 00:48:01,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:48:01,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 00:48:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=4020, Unknown=1, NotChecked=0, Total=4290 [2021-12-18 00:48:01,417 INFO L87 Difference]: Start difference. First operand 243 states and 301 transitions. Second operand has 17 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2021-12-18 00:48:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:48:02,161 INFO L93 Difference]: Finished difference Result 346 states and 437 transitions. [2021-12-18 00:48:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 00:48:02,161 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 113 [2021-12-18 00:48:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:48:02,162 INFO L225 Difference]: With dead ends: 346 [2021-12-18 00:48:02,162 INFO L226 Difference]: Without dead ends: 169 [2021-12-18 00:48:02,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=311, Invalid=4944, Unknown=1, NotChecked=0, Total=5256 [2021-12-18 00:48:02,164 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 96 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:48:02,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 1010 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 00:48:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-18 00:48:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 160. [2021-12-18 00:48:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.1696428571428572) internal successors, (131), 115 states have internal predecessors, (131), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (35), 29 states have call predecessors, (35), 30 states have call successors, (35) [2021-12-18 00:48:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2021-12-18 00:48:02,172 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 113 [2021-12-18 00:48:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:48:02,172 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2021-12-18 00:48:02,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2021-12-18 00:48:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2021-12-18 00:48:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-18 00:48:02,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:48:02,173 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:48:02,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-18 00:48:02,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 00:48:02,387 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:48:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:48:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 802745279, now seen corresponding path program 1 times [2021-12-18 00:48:02,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:48:02,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620299220] [2021-12-18 00:48:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:48:02,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:48:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:48:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:48:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:48:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:48:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:48:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:48:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:48:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:48:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:48:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:48:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:48:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:48:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:48:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:48:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-12-18 00:48:03,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:48:03,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620299220] [2021-12-18 00:48:03,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620299220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:48:03,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224998694] [2021-12-18 00:48:03,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:48:03,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:48:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:48:03,105 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-18 00:48:03,106 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-18 00:48:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:03,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 117 conjunts are in the unsatisfiable core [2021-12-18 00:48:03,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:48:03,353 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:48:03,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:48:03,362 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:48:03,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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:48:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 69 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 00:48:06,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:48:17,824 WARN L227 SmtUtils]: Spent 10.16s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:48:28,297 WARN L227 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:48:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 21 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-18 00:48:32,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224998694] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:48:32,572 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:48:32,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31, 25] total 67 [2021-12-18 00:48:32,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305355873] [2021-12-18 00:48:32,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:48:32,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-18 00:48:32,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:48:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-18 00:48:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4146, Unknown=0, NotChecked=0, Total=4422 [2021-12-18 00:48:32,575 INFO L87 Difference]: Start difference. First operand 160 states and 197 transitions. Second operand has 67 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 57 states have internal predecessors, (179), 20 states have call successors, (38), 6 states have call predecessors, (38), 16 states have return successors, (35), 19 states have call predecessors, (35), 19 states have call successors, (35) [2021-12-18 00:48:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:48:37,206 INFO L93 Difference]: Finished difference Result 327 states and 414 transitions. [2021-12-18 00:48:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-12-18 00:48:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 57 states have internal predecessors, (179), 20 states have call successors, (38), 6 states have call predecessors, (38), 16 states have return successors, (35), 19 states have call predecessors, (35), 19 states have call successors, (35) Word has length 126 [2021-12-18 00:48:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:48:37,207 INFO L225 Difference]: With dead ends: 327 [2021-12-18 00:48:37,207 INFO L226 Difference]: Without dead ends: 234 [2021-12-18 00:48:37,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 235 SyntacticMatches, 8 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=821, Invalid=10735, Unknown=0, NotChecked=0, Total=11556 [2021-12-18 00:48:37,210 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 213 mSDsluCounter, 4013 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 4150 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 510 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:48:37,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 4150 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2232 Invalid, 0 Unknown, 510 Unchecked, 1.5s Time] [2021-12-18 00:48:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-18 00:48:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2021-12-18 00:48:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 143 states have (on average 1.167832167832168) internal successors, (167), 146 states have internal predecessors, (167), 32 states have call successors, (32), 18 states have call predecessors, (32), 20 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2021-12-18 00:48:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2021-12-18 00:48:37,220 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 126 [2021-12-18 00:48:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:48:37,220 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2021-12-18 00:48:37,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 57 states have internal predecessors, (179), 20 states have call successors, (38), 6 states have call predecessors, (38), 16 states have return successors, (35), 19 states have call predecessors, (35), 19 states have call successors, (35) [2021-12-18 00:48:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2021-12-18 00:48:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-18 00:48:37,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:48:37,221 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:48:37,241 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-18 00:48:37,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:48:37,435 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:48:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:48:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1683260991, now seen corresponding path program 1 times [2021-12-18 00:48:37,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:48:37,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122433229] [2021-12-18 00:48:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:48:37,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:48:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:48:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:48:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:48:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:48:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:48:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:48:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:48:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:48:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 00:48:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 00:48:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:48:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 00:48:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 00:48:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:48:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 00:48:37,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:48:37,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122433229] [2021-12-18 00:48:37,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122433229] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:48:37,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252312840] [2021-12-18 00:48:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:48:37,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:48:37,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:48:37,752 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-18 00:48:37,756 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-18 00:48:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:48:37,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-18 00:48:37,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:48:38,011 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:48:38,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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:48:38,021 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:48:38,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:48:40,126 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|) 0)))) is different from true [2021-12-18 00:48:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 7 not checked. [2021-12-18 00:48:41,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:48:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 00:48:42,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252312840] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:48:42,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:48:42,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 16] total 41 [2021-12-18 00:48:42,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366613700] [2021-12-18 00:48:42,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:48:42,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 00:48:42,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:48:42,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 00:48:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1428, Unknown=1, NotChecked=76, Total=1640 [2021-12-18 00:48:42,272 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 41 states, 40 states have (on average 3.6) internal successors, (144), 40 states have internal predecessors, (144), 14 states have call successors, (30), 5 states have call predecessors, (30), 9 states have return successors, (28), 12 states have call predecessors, (28), 13 states have call successors, (28) [2021-12-18 00:48:50,340 WARN L227 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:49:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:49:02,761 INFO L93 Difference]: Finished difference Result 382 states and 475 transitions. [2021-12-18 00:49:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-18 00:49:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.6) internal successors, (144), 40 states have internal predecessors, (144), 14 states have call successors, (30), 5 states have call predecessors, (30), 9 states have return successors, (28), 12 states have call predecessors, (28), 13 states have call successors, (28) Word has length 124 [2021-12-18 00:49:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:49:02,762 INFO L225 Difference]: With dead ends: 382 [2021-12-18 00:49:02,763 INFO L226 Difference]: Without dead ends: 235 [2021-12-18 00:49:02,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 241 SyntacticMatches, 18 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=324, Invalid=2756, Unknown=4, NotChecked=108, Total=3192 [2021-12-18 00:49:02,764 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 219 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 681 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:49:02,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 2494 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 844 Invalid, 0 Unknown, 681 Unchecked, 0.5s Time] [2021-12-18 00:49:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-18 00:49:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2021-12-18 00:49:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 147 states have (on average 1.163265306122449) internal successors, (171), 150 states have internal predecessors, (171), 32 states have call successors, (32), 18 states have call predecessors, (32), 20 states have return successors, (37), 31 states have call predecessors, (37), 31 states have call successors, (37) [2021-12-18 00:49:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 240 transitions. [2021-12-18 00:49:02,774 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 240 transitions. Word has length 124 [2021-12-18 00:49:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:49:02,774 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 240 transitions. [2021-12-18 00:49:02,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.6) internal successors, (144), 40 states have internal predecessors, (144), 14 states have call successors, (30), 5 states have call predecessors, (30), 9 states have return successors, (28), 12 states have call predecessors, (28), 13 states have call successors, (28) [2021-12-18 00:49:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 240 transitions. [2021-12-18 00:49:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-18 00:49:02,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:49:02,776 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:49:02,797 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-18 00:49:02,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 00:49:02,990 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:49:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:49:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash 49793467, now seen corresponding path program 1 times [2021-12-18 00:49:02,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:49:02,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602296190] [2021-12-18 00:49:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:49:02,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:49:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:49:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:49:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:49:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:49:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:49:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:49:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:49:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:49:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:49:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:49:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:49:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:49:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:49:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:49:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-18 00:49:03,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:49:03,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602296190] [2021-12-18 00:49:03,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602296190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:49:03,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:49:03,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:49:03,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581040316] [2021-12-18 00:49:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:49:03,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:49:03,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:49:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:49:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:49:03,173 INFO L87 Difference]: Start difference. First operand 200 states and 240 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:49:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:49:03,357 INFO L93 Difference]: Finished difference Result 386 states and 475 transitions. [2021-12-18 00:49:03,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:49:03,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 126 [2021-12-18 00:49:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:49:03,358 INFO L225 Difference]: With dead ends: 386 [2021-12-18 00:49:03,358 INFO L226 Difference]: Without dead ends: 199 [2021-12-18 00:49:03,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:49:03,359 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:49:03,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 992 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:49:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-18 00:49:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2021-12-18 00:49:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (35), 30 states have call predecessors, (35), 31 states have call successors, (35) [2021-12-18 00:49:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 224 transitions. [2021-12-18 00:49:03,369 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 224 transitions. Word has length 126 [2021-12-18 00:49:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:49:03,369 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 224 transitions. [2021-12-18 00:49:03,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:49:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 224 transitions. [2021-12-18 00:49:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-18 00:49:03,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:49:03,371 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:49:03,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 00:49:03,371 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:49:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:49:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1962682844, now seen corresponding path program 2 times [2021-12-18 00:49:03,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:49:03,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092120851] [2021-12-18 00:49:03,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:49:03,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:49:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:49:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:49:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:49:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:49:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:49:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:49:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:49:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:49:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 00:49:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 00:49:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:49:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 00:49:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 00:49:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:49:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:49:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:49:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 00:49:03,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:49:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092120851] [2021-12-18 00:49:03,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092120851] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:49:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712262593] [2021-12-18 00:49:03,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:49:03,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:49:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:49:03,692 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-18 00:49:03,693 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-18 00:49:03,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:49:03,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:49:03,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 138 conjunts are in the unsatisfiable core [2021-12-18 00:49:03,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:49:03,971 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-12-18 00:49:03,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 55 [2021-12-18 00:49:03,993 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-12-18 00:49:03,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 55 [2021-12-18 00:49:03,999 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-18 00:49:04,005 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2021-12-18 00:49:04,011 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-18 00:49:04,017 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2021-12-18 00:49:04,044 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 15 treesize of output 9 [2021-12-18 00:49:04,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-12-18 00:49:04,055 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 13 treesize of output 9 [2021-12-18 00:49:04,098 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 15 treesize of output 9 [2021-12-18 00:49:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-18 00:49:06,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:49:22,613 WARN L227 SmtUtils]: Spent 10.37s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:49:35,360 WARN L227 SmtUtils]: Spent 10.39s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:49:47,911 WARN L227 SmtUtils]: Spent 10.84s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:49:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 18 proven. 56 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-18 00:49:48,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712262593] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:49:48,574 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:49:48,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 22] total 56 [2021-12-18 00:49:48,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833881127] [2021-12-18 00:49:48,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:49:48,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-18 00:49:48,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:49:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-18 00:49:48,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2863, Unknown=1, NotChecked=0, Total=3080 [2021-12-18 00:49:48,576 INFO L87 Difference]: Start difference. First operand 189 states and 224 transitions. Second operand has 56 states, 54 states have (on average 3.462962962962963) internal successors, (187), 50 states have internal predecessors, (187), 21 states have call successors, (44), 5 states have call predecessors, (44), 11 states have return successors, (40), 19 states have call predecessors, (40), 21 states have call successors, (40) [2021-12-18 00:50:06,724 WARN L227 SmtUtils]: Spent 10.72s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:50:33,650 WARN L227 SmtUtils]: Spent 11.65s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:50:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:36,659 INFO L93 Difference]: Finished difference Result 583 states and 804 transitions. [2021-12-18 00:50:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-12-18 00:50:36,660 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 3.462962962962963) internal successors, (187), 50 states have internal predecessors, (187), 21 states have call successors, (44), 5 states have call predecessors, (44), 11 states have return successors, (40), 19 states have call predecessors, (40), 21 states have call successors, (40) Word has length 135 [2021-12-18 00:50:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:36,661 INFO L225 Difference]: With dead ends: 583 [2021-12-18 00:50:36,661 INFO L226 Difference]: Without dead ends: 446 [2021-12-18 00:50:36,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 258 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=651, Invalid=7720, Unknown=1, NotChecked=0, Total=8372 [2021-12-18 00:50:36,664 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 417 mSDsluCounter, 3524 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 5190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1250 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:36,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 3731 Invalid, 5190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 3524 Invalid, 0 Unknown, 1250 Unchecked, 4.3s Time] [2021-12-18 00:50:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-12-18 00:50:36,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 340. [2021-12-18 00:50:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 245 states have (on average 1.1551020408163266) internal successors, (283), 249 states have internal predecessors, (283), 62 states have call successors, (62), 24 states have call predecessors, (62), 32 states have return successors, (103), 66 states have call predecessors, (103), 61 states have call successors, (103) [2021-12-18 00:50:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 448 transitions. [2021-12-18 00:50:36,685 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 448 transitions. Word has length 135 [2021-12-18 00:50:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:36,686 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 448 transitions. [2021-12-18 00:50:36,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 3.462962962962963) internal successors, (187), 50 states have internal predecessors, (187), 21 states have call successors, (44), 5 states have call predecessors, (44), 11 states have return successors, (40), 19 states have call predecessors, (40), 21 states have call successors, (40) [2021-12-18 00:50:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 448 transitions. [2021-12-18 00:50:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-18 00:50:36,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:36,687 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:36,707 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-18 00:50:36,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:36,905 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash 915145000, now seen corresponding path program 1 times [2021-12-18 00:50:36,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752814477] [2021-12-18 00:50:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:36,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:36,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:50:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:50:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:50:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:50:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:36,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:50:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:50:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:50:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:50:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:50:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-12-18 00:50:37,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752814477] [2021-12-18 00:50:37,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752814477] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:50:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612166404] [2021-12-18 00:50:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:37,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:50:37,159 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-18 00:50:37,160 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-18 00:50:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:37,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 00:50:37,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:50:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-18 00:50:37,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:50:37,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612166404] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:37,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:50:37,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 20 [2021-12-18 00:50:37,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343809664] [2021-12-18 00:50:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:37,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:50:37,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:37,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:50:37,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:50:37,890 INFO L87 Difference]: Start difference. First operand 340 states and 448 transitions. Second operand has 15 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-18 00:50:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:38,177 INFO L93 Difference]: Finished difference Result 631 states and 878 transitions. [2021-12-18 00:50:38,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 00:50:38,178 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 137 [2021-12-18 00:50:38,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:38,180 INFO L225 Difference]: With dead ends: 631 [2021-12-18 00:50:38,180 INFO L226 Difference]: Without dead ends: 410 [2021-12-18 00:50:38,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:50:38,181 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 59 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:38,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 1033 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 190 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2021-12-18 00:50:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-12-18 00:50:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 363. [2021-12-18 00:50:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 265 states have (on average 1.1886792452830188) internal successors, (315), 268 states have internal predecessors, (315), 62 states have call successors, (62), 24 states have call predecessors, (62), 35 states have return successors, (111), 70 states have call predecessors, (111), 61 states have call successors, (111) [2021-12-18 00:50:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 488 transitions. [2021-12-18 00:50:38,205 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 488 transitions. Word has length 137 [2021-12-18 00:50:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:38,205 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 488 transitions. [2021-12-18 00:50:38,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.071428571428571) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-18 00:50:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 488 transitions. [2021-12-18 00:50:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-18 00:50:38,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:38,206 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:38,224 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-18 00:50:38,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:38,415 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1645717846, now seen corresponding path program 2 times [2021-12-18 00:50:38,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:38,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136707018] [2021-12-18 00:50:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:38,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:50:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:50:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:50:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:50:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:50:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:50:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:50:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:50:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:50:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-18 00:50:38,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:38,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136707018] [2021-12-18 00:50:38,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136707018] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:50:38,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146054609] [2021-12-18 00:50:38,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:50:38,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:50:38,599 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-18 00:50:38,600 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-18 00:50:38,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:50:38,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:50:38,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 00:50:38,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:50:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-18 00:50:39,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:50:39,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146054609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:50:39,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:50:39,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2021-12-18 00:50:39,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471062181] [2021-12-18 00:50:39,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:50:39,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:50:39,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:50:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:50:39,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:50:39,081 INFO L87 Difference]: Start difference. First operand 363 states and 488 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-18 00:50:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:50:39,148 INFO L93 Difference]: Finished difference Result 664 states and 931 transitions. [2021-12-18 00:50:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:50:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 137 [2021-12-18 00:50:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:50:39,150 INFO L225 Difference]: With dead ends: 664 [2021-12-18 00:50:39,150 INFO L226 Difference]: Without dead ends: 340 [2021-12-18 00:50:39,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:50:39,151 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:50:39,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 447 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 33 Unchecked, 0.0s Time] [2021-12-18 00:50:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-12-18 00:50:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 335. [2021-12-18 00:50:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 241 states have (on average 1.1493775933609958) internal successors, (277), 246 states have internal predecessors, (277), 62 states have call successors, (62), 24 states have call predecessors, (62), 31 states have return successors, (97), 64 states have call predecessors, (97), 61 states have call successors, (97) [2021-12-18 00:50:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 436 transitions. [2021-12-18 00:50:39,174 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 436 transitions. Word has length 137 [2021-12-18 00:50:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:50:39,174 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 436 transitions. [2021-12-18 00:50:39,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-18 00:50:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 436 transitions. [2021-12-18 00:50:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-18 00:50:39,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:50:39,175 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:50:39,199 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-18 00:50:39,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:39,391 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:50:39,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:50:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1210614300, now seen corresponding path program 2 times [2021-12-18 00:50:39,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:50:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974432648] [2021-12-18 00:50:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:50:39,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:50:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:50:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:50:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:50:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:50:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:50:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:50:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:50:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:50:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:50:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:50:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:50:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:50:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:50:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-18 00:50:39,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:50:39,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974432648] [2021-12-18 00:50:39,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974432648] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:50:39,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122533761] [2021-12-18 00:50:39,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:50:39,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:50:39,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:50:39,918 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-18 00:50:39,951 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-18 00:50:40,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:50:40,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:50:40,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-18 00:50:40,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:50:40,223 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-18 00:50:40,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-12-18 00:51:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 85 proven. 35 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-18 00:51:13,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:51:16,610 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-18 00:51:16,610 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2021-12-18 00:51:17,550 INFO L354 Elim1Store]: treesize reduction 4, result has 95.6 percent of original size [2021-12-18 00:51:17,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 103 [2021-12-18 00:51:17,570 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:51:17,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 63 [2021-12-18 00:51:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 19 proven. 43 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-18 00:51:19,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122533761] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:51:19,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:51:19,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 22] total 58 [2021-12-18 00:51:19,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155892105] [2021-12-18 00:51:19,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:51:19,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-18 00:51:19,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:51:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-18 00:51:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3114, Unknown=1, NotChecked=0, Total=3306 [2021-12-18 00:51:19,134 INFO L87 Difference]: Start difference. First operand 335 states and 436 transitions. Second operand has 58 states, 55 states have (on average 3.327272727272727) internal successors, (183), 55 states have internal predecessors, (183), 24 states have call successors, (45), 6 states have call predecessors, (45), 11 states have return successors, (41), 21 states have call predecessors, (41), 23 states have call successors, (41) [2021-12-18 00:51:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:51:28,166 INFO L93 Difference]: Finished difference Result 614 states and 815 transitions. [2021-12-18 00:51:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-18 00:51:28,167 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 3.327272727272727) internal successors, (183), 55 states have internal predecessors, (183), 24 states have call successors, (45), 6 states have call predecessors, (45), 11 states have return successors, (41), 21 states have call predecessors, (41), 23 states have call successors, (41) Word has length 137 [2021-12-18 00:51:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:51:28,169 INFO L225 Difference]: With dead ends: 614 [2021-12-18 00:51:28,169 INFO L226 Difference]: Without dead ends: 414 [2021-12-18 00:51:28,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 261 SyntacticMatches, 13 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=592, Invalid=8337, Unknown=1, NotChecked=0, Total=8930 [2021-12-18 00:51:28,171 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 600 mSDsluCounter, 3976 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 677 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-18 00:51:28,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 4142 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2074 Invalid, 0 Unknown, 677 Unchecked, 1.9s Time] [2021-12-18 00:51:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-12-18 00:51:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 323. [2021-12-18 00:51:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 232 states have (on average 1.1422413793103448) internal successors, (265), 233 states have internal predecessors, (265), 60 states have call successors, (60), 26 states have call predecessors, (60), 30 states have return successors, (78), 63 states have call predecessors, (78), 59 states have call successors, (78) [2021-12-18 00:51:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 403 transitions. [2021-12-18 00:51:28,193 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 403 transitions. Word has length 137 [2021-12-18 00:51:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:51:28,194 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 403 transitions. [2021-12-18 00:51:28,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 3.327272727272727) internal successors, (183), 55 states have internal predecessors, (183), 24 states have call successors, (45), 6 states have call predecessors, (45), 11 states have return successors, (41), 21 states have call predecessors, (41), 23 states have call successors, (41) [2021-12-18 00:51:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 403 transitions. [2021-12-18 00:51:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-12-18 00:51:28,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:51:28,195 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:51:28,217 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-18 00:51:28,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:51:28,417 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:51:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:51:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash -707550403, now seen corresponding path program 1 times [2021-12-18 00:51:28,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:51:28,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412604975] [2021-12-18 00:51:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:51:28,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:51:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:51:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:51:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:51:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:51:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:51:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:51:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:51:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:51:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:51:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:51:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:51:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-12-18 00:51:28,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:51:28,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412604975] [2021-12-18 00:51:28,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412604975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:51:28,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:51:28,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:51:28,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545281439] [2021-12-18 00:51:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:51:28,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:51:28,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:51:28,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:51:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:51:28,612 INFO L87 Difference]: Start difference. First operand 323 states and 403 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-18 00:51:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:51:28,745 INFO L93 Difference]: Finished difference Result 347 states and 432 transitions. [2021-12-18 00:51:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:51:28,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 140 [2021-12-18 00:51:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:51:28,747 INFO L225 Difference]: With dead ends: 347 [2021-12-18 00:51:28,747 INFO L226 Difference]: Without dead ends: 345 [2021-12-18 00:51:28,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:51:28,748 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 10 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:51:28,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 852 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:51:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-18 00:51:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2021-12-18 00:51:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 244 states have (on average 1.1352459016393444) internal successors, (277), 247 states have internal predecessors, (277), 63 states have call successors, (63), 28 states have call predecessors, (63), 34 states have return successors, (86), 66 states have call predecessors, (86), 62 states have call successors, (86) [2021-12-18 00:51:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 426 transitions. [2021-12-18 00:51:28,771 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 426 transitions. Word has length 140 [2021-12-18 00:51:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:51:28,772 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 426 transitions. [2021-12-18 00:51:28,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-18 00:51:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 426 transitions. [2021-12-18 00:51:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-18 00:51:28,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:51:28,773 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:51:28,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-18 00:51:28,773 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:51:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:51:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1370483361, now seen corresponding path program 2 times [2021-12-18 00:51:28,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:51:28,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247340765] [2021-12-18 00:51:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:51:28,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:51:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:51:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:51:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:51:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:51:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:51:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:51:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:51:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:51:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:51:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:51:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:51:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:51:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:51:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:51:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:51:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-12-18 00:51:29,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:51:29,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247340765] [2021-12-18 00:51:29,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247340765] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:51:29,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800563698] [2021-12-18 00:51:29,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:51:29,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:51:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:51:29,429 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-18 00:51:29,430 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-18 00:51:29,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:51:29,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:51:29,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 115 conjunts are in the unsatisfiable core [2021-12-18 00:51:29,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:51:29,774 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:51:29,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:51:29,796 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:51:29,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 00:51:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 104 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 00:51:36,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:51:49,049 WARN L227 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:52:01,251 WARN L227 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:52:13,701 WARN L227 SmtUtils]: Spent 12.37s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:52:27,857 WARN L227 SmtUtils]: Spent 14.05s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:52:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 26 proven. 60 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-12-18 00:52:30,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800563698] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:52:30,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:52:30,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27, 20] total 53 [2021-12-18 00:52:30,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296034311] [2021-12-18 00:52:30,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:52:30,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-18 00:52:30,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:52:30,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-18 00:52:30,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2545, Unknown=0, NotChecked=0, Total=2756 [2021-12-18 00:52:30,220 INFO L87 Difference]: Start difference. First operand 342 states and 426 transitions. Second operand has 53 states, 52 states have (on average 3.6153846153846154) internal successors, (188), 52 states have internal predecessors, (188), 22 states have call successors, (43), 5 states have call predecessors, (43), 11 states have return successors, (41), 21 states have call predecessors, (41), 21 states have call successors, (41) [2021-12-18 00:52:43,536 WARN L227 SmtUtils]: Spent 12.17s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:52:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:52:49,222 INFO L93 Difference]: Finished difference Result 562 states and 727 transitions. [2021-12-18 00:52:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-18 00:52:49,223 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.6153846153846154) internal successors, (188), 52 states have internal predecessors, (188), 22 states have call successors, (43), 5 states have call predecessors, (43), 11 states have return successors, (41), 21 states have call predecessors, (41), 21 states have call successors, (41) Word has length 148 [2021-12-18 00:52:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:52:49,228 INFO L225 Difference]: With dead ends: 562 [2021-12-18 00:52:49,228 INFO L226 Difference]: Without dead ends: 371 [2021-12-18 00:52:49,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 277 SyntacticMatches, 22 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 74.8s TimeCoverageRelationStatistics Valid=556, Invalid=5764, Unknown=0, NotChecked=0, Total=6320 [2021-12-18 00:52:49,230 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 221 mSDsluCounter, 3811 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 2364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:52:49,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 3966 Invalid, 2364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1457 Invalid, 0 Unknown, 826 Unchecked, 1.8s Time] [2021-12-18 00:52:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-12-18 00:52:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 316. [2021-12-18 00:52:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 225 states have (on average 1.1155555555555556) internal successors, (251), 228 states have internal predecessors, (251), 58 states have call successors, (58), 28 states have call predecessors, (58), 32 states have return successors, (75), 59 states have call predecessors, (75), 57 states have call successors, (75) [2021-12-18 00:52:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 384 transitions. [2021-12-18 00:52:49,252 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 384 transitions. Word has length 148 [2021-12-18 00:52:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:52:49,252 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 384 transitions. [2021-12-18 00:52:49,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.6153846153846154) internal successors, (188), 52 states have internal predecessors, (188), 22 states have call successors, (43), 5 states have call predecessors, (43), 11 states have return successors, (41), 21 states have call predecessors, (41), 21 states have call successors, (41) [2021-12-18 00:52:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 384 transitions. [2021-12-18 00:52:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-18 00:52:49,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:52:49,254 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:52:49,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-18 00:52:49,467 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,SelfDestructingSolverStorable23 [2021-12-18 00:52:49,467 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:52:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:52:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1436287351, now seen corresponding path program 2 times [2021-12-18 00:52:49,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:52:49,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572337527] [2021-12-18 00:52:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:52:49,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:52:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:52:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:52:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:52:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 00:52:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:52:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:52:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:52:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 00:52:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 00:52:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:52:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:52:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 00:52:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:52:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:52:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:52:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2021-12-18 00:52:49,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:52:49,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572337527] [2021-12-18 00:52:49,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572337527] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:52:49,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569791321] [2021-12-18 00:52:49,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:52:49,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:52:49,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:52:49,905 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-18 00:52:49,907 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-18 00:52:50,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:52:50,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:52:50,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-18 00:52:50,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:52:52,815 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_111 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_111) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_111) 0)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_111 Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_111) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_111) 0)) 0)))) is different from true [2021-12-18 00:52:55,231 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_112 Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_112) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_112) 0)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_112 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_112) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_112) 0)) 0)))) is different from true [2021-12-18 00:52:57,601 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_113 Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_113) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_113) 0)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_113 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_113) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_113) 0)) 0)))) is different from true [2021-12-18 00:52:59,918 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_114 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_114 Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) 0)))) is different from true [2021-12-18 00:53:08,683 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:17,517 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:27,121 WARN L227 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:35,503 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:44,002 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:50,184 WARN L227 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:53:56,370 WARN L227 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:54:05,175 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:54:13,690 WARN L227 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:54:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 26 not checked. [2021-12-18 00:54:13,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:54:15,193 INFO L354 Elim1Store]: treesize reduction 8, result has 91.2 percent of original size [2021-12-18 00:54:15,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 122 [2021-12-18 00:54:15,247 INFO L354 Elim1Store]: treesize reduction 22, result has 67.2 percent of original size [2021-12-18 00:54:15,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 115 [2021-12-18 00:54:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 31 proven. 54 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-12-18 00:54:15,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569791321] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:54:15,874 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:54:15,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26, 18] total 42 [2021-12-18 00:54:15,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228035136] [2021-12-18 00:54:15,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:54:15,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-18 00:54:15,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:54:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-18 00:54:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1265, Unknown=11, NotChecked=300, Total=1722 [2021-12-18 00:54:15,875 INFO L87 Difference]: Start difference. First operand 316 states and 384 transitions. Second operand has 42 states, 41 states have (on average 3.5365853658536586) internal successors, (145), 41 states have internal predecessors, (145), 15 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) [2021-12-18 00:54:34,403 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:54:42,689 WARN L227 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:54:48,919 WARN L227 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:54:59,837 WARN L227 SmtUtils]: Spent 10.85s on a formula simplification. DAG size of input: 65 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:55:01,841 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_57| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_55| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_55|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_57|)) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_55|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_57|)) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_57| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_55| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_55|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_57|)) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_55|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_57|)) 0)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_114 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_114 Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_114) 0)) 0))))) is different from true [2021-12-18 00:55:10,102 WARN L227 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:55:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:55:22,771 INFO L93 Difference]: Finished difference Result 532 states and 662 transitions. [2021-12-18 00:55:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-18 00:55:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.5365853658536586) internal successors, (145), 41 states have internal predecessors, (145), 15 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) Word has length 146 [2021-12-18 00:55:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:55:22,774 INFO L225 Difference]: With dead ends: 532 [2021-12-18 00:55:22,774 INFO L226 Difference]: Without dead ends: 396 [2021-12-18 00:55:22,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 292 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 149.7s TimeCoverageRelationStatistics Valid=360, Invalid=3296, Unknown=24, NotChecked=610, Total=4290 [2021-12-18 00:55:22,775 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 224 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1527 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:55:22,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 2234 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 848 Invalid, 0 Unknown, 1527 Unchecked, 0.8s Time] [2021-12-18 00:55:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-12-18 00:55:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 351. [2021-12-18 00:55:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 252 states have (on average 1.123015873015873) internal successors, (283), 257 states have internal predecessors, (283), 60 states have call successors, (60), 33 states have call predecessors, (60), 38 states have return successors, (78), 60 states have call predecessors, (78), 59 states have call successors, (78) [2021-12-18 00:55:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 421 transitions. [2021-12-18 00:55:22,801 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 421 transitions. Word has length 146 [2021-12-18 00:55:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:55:22,802 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 421 transitions. [2021-12-18 00:55:22,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.5365853658536586) internal successors, (145), 41 states have internal predecessors, (145), 15 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) [2021-12-18 00:55:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 421 transitions. [2021-12-18 00:55:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-18 00:55:22,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:55:22,804 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:55:22,825 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-18 00:55:23,015 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,SelfDestructingSolverStorable24 [2021-12-18 00:55:23,015 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:55:23,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:55:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1819499468, now seen corresponding path program 1 times [2021-12-18 00:55:23,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:55:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436323959] [2021-12-18 00:55:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:55:23,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:55:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:55:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:55:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:55:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:55:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:55:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:55:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:55:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:55:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:55:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:55:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:55:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:55:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 00:55:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:55:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:24,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:55:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:24,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 00:55:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:24,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 00:55:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-18 00:55:24,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:55:24,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436323959] [2021-12-18 00:55:24,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436323959] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:55:24,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349531874] [2021-12-18 00:55:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:55:24,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:55:24,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:55:24,332 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 00:55:24,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-18 00:55:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:55:24,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 188 conjunts are in the unsatisfiable core [2021-12-18 00:55:24,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:55:24,595 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 00:55:24,890 INFO L354 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-12-18 00:55:24,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2021-12-18 00:55:24,930 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-12-18 00:55:24,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2021-12-18 00:55:24,938 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-18 00:55:24,950 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-18 00:55:24,986 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 8 treesize of output 6 [2021-12-18 00:55:25,068 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-18 00:55:25,086 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 37 treesize of output 36 [2021-12-18 00:55:25,111 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 5 treesize of output 3 [2021-12-18 00:55:25,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-18 00:55:25,147 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 5 treesize of output 3 [2021-12-18 00:55:25,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:55:25,180 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 27 treesize of output 15 [2021-12-18 00:55:25,201 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 00:55:25,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-12-18 00:55:25,408 INFO L354 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2021-12-18 00:55:25,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 120 [2021-12-18 00:55:25,439 INFO L354 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2021-12-18 00:55:25,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 122 [2021-12-18 00:55:25,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:55:25,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 103 [2021-12-18 00:55:25,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2021-12-18 00:55:25,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2021-12-18 00:55:25,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:55:25,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:55:25,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 47 [2021-12-18 00:55:25,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2021-12-18 00:55:25,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:55:34,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:55:34,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:55:34,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:55:34,736 INFO L354 Elim1Store]: treesize reduction 180, result has 11.3 percent of original size [2021-12-18 00:55:34,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 43 case distinctions, treesize of input 287 treesize of output 154 [2021-12-18 00:55:34,822 INFO L354 Elim1Store]: treesize reduction 230, result has 9.1 percent of original size [2021-12-18 00:55:34,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 41 case distinctions, treesize of input 109 treesize of output 71 [2021-12-18 00:55:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 64 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 00:55:34,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:55:44,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2231 Int) (v_ArrVal_2223 (Array Int Int))) (let ((.cse13 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_2231)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_2223) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) (.cse0 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|)) (.cse7 (select .cse4 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset|)) (.cse11 (select .cse9 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset|))) (or (let ((.cse8 (+ |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset| 24))) (let ((.cse3 (select .cse9 .cse8))) (let ((.cse5 (select .cse7 .cse8)) (.cse6 (+ .cse3 8))) (let ((.cse1 (select (select .cse4 .cse5) .cse6)) (.cse2 (select (select .cse0 .cse5) .cse6))) (and (= (select (select .cse0 .cse1) .cse2) .cse3) (= (select (select .cse4 .cse1) .cse2) .cse5)))))) (not (= |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| (select (select .cse4 .cse10) .cse11))) (not (= (+ |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset| 16) (select (select .cse0 .cse10) .cse11))))))))) is different from false [2021-12-18 00:55:44,991 INFO L354 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2021-12-18 00:55:44,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1300 treesize of output 957 [2021-12-18 00:55:45,019 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:55:45,019 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 2300 treesize of output 2042 [2021-12-18 00:55:45,036 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:55:45,037 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 1 case distinctions, treesize of input 1994 treesize of output 1927 [2021-12-18 00:55:45,181 INFO L354 Elim1Store]: treesize reduction 17, result has 67.3 percent of original size [2021-12-18 00:55:45,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3448 treesize of output 2602 [2021-12-18 00:55:45,214 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:55:45,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2568 treesize of output 2230 [2021-12-18 00:57:30,936 WARN L227 SmtUtils]: Spent 1.76m on a formula simplification. DAG size of input: 1778 DAG size of output: 1690 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 00:57:30,939 INFO L354 Elim1Store]: treesize reduction 2813, result has 93.5 percent of original size [2021-12-18 00:57:30,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 40 new quantified variables, introduced 435 case distinctions, treesize of input 10322 treesize of output 47407 [2021-12-18 00:57:39,732 INFO L244 Elim1Store]: Index analysis took 560 ms Killed by 15